./Ultimate.py --spec /mnt/goblint-svcomp/goblint-bench/bench/concrat/properties/no-data-race.prp --file /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-ptr.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for data races
Using default analysis
Version 2329fc70
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-ptr.i -s /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 31c29ca274bb23b3129d78f6f059ea3fe37eb6c8dc63a58fc5f33d992ac2608c
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2024-03-11 22:00:49,356 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2024-03-11 22:00:49,358 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2024-03-11 22:00:49,384 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2024-03-11 22:00:49,385 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2024-03-11 22:00:49,386 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2024-03-11 22:00:49,386 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2024-03-11 22:00:49,388 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2024-03-11 22:00:49,389 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2024-03-11 22:00:49,389 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2024-03-11 22:00:49,390 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2024-03-11 22:00:49,391 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2024-03-11 22:00:49,391 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2024-03-11 22:00:49,391 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2024-03-11 22:00:49,392 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2024-03-11 22:00:49,393 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2024-03-11 22:00:49,394 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2024-03-11 22:00:49,394 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2024-03-11 22:00:49,396 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2024-03-11 22:00:49,397 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2024-03-11 22:00:49,398 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2024-03-11 22:00:49,399 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2024-03-11 22:00:49,400 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2024-03-11 22:00:49,400 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2024-03-11 22:00:49,403 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2024-03-11 22:00:49,403 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2024-03-11 22:00:49,403 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2024-03-11 22:00:49,404 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2024-03-11 22:00:49,404 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2024-03-11 22:00:49,405 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2024-03-11 22:00:49,405 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2024-03-11 22:00:49,405 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2024-03-11 22:00:49,406 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2024-03-11 22:00:49,406 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2024-03-11 22:00:49,407 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2024-03-11 22:00:49,407 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2024-03-11 22:00:49,408 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2024-03-11 22:00:49,408 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2024-03-11 22:00:49,408 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2024-03-11 22:00:49,409 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2024-03-11 22:00:49,409 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2024-03-11 22:00:49,410 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-03-11 22:00:49,426 INFO  L113        SettingsManager]: Loading preferences was successful
[2024-03-11 22:00:49,426 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-11 22:00:49,426 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-11 22:00:49,426 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-11 22:00:49,427 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-11 22:00:49,427 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-11 22:00:49,427 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-11 22:00:49,427 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-11 22:00:49,427 INFO  L138        SettingsManager]:  * Use SBE=true
[2024-03-11 22:00:49,428 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-11 22:00:49,428 INFO  L138        SettingsManager]:  * sizeof long=4
[2024-03-11 22:00:49,428 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2024-03-11 22:00:49,428 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-11 22:00:49,428 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2024-03-11 22:00:49,428 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-11 22:00:49,428 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-11 22:00:49,428 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-11 22:00:49,428 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-11 22:00:49,428 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-11 22:00:49,429 INFO  L138        SettingsManager]:  * sizeof long double=12
[2024-03-11 22:00:49,429 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-11 22:00:49,429 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2024-03-11 22:00:49,429 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-11 22:00:49,429 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-11 22:00:49,429 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-11 22:00:49,429 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-11 22:00:49,429 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-03-11 22:00:49,429 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-11 22:00:49,430 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-11 22:00:49,430 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2024-03-11 22:00:49,430 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-11 22:00:49,430 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-11 22:00:49,430 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-11 22:00:49,430 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-11 22:00:49,430 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-11 22:00:49,430 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-11 22:00:49,430 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2024-03-11 22:00:49,430 INFO  L138        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 31c29ca274bb23b3129d78f6f059ea3fe37eb6c8dc63a58fc5f33d992ac2608c
[2024-03-11 22:00:49,603 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-11 22:00:49,628 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-11 22:00:49,630 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-11 22:00:49,631 INFO  L271        PluginConnector]: Initializing CDTParser...
[2024-03-11 22:00:49,631 INFO  L275        PluginConnector]: CDTParser initialized
[2024-03-11 22:00:49,632 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-ptr.i
[2024-03-11 22:00:50,718 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2024-03-11 22:00:50,932 INFO  L351              CDTParser]: Found 1 translation units.
[2024-03-11 22:00:50,932 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-ptr.i
[2024-03-11 22:00:50,942 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/3c067186d/8a92f1e0a3ad4bc39173c8c1e2217a7e/FLAG3ca6d47c3
[2024-03-11 22:00:50,953 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/3c067186d/8a92f1e0a3ad4bc39173c8c1e2217a7e
[2024-03-11 22:00:50,955 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-11 22:00:50,956 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-11 22:00:50,956 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-11 22:00:50,957 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-11 22:00:50,959 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-11 22:00:50,960 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 10:00:50" (1/1) ...
[2024-03-11 22:00:50,960 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e51ddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:00:50, skipping insertion in model container
[2024-03-11 22:00:50,961 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 10:00:50" (1/1) ...
[2024-03-11 22:00:50,966 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2024-03-11 22:00:50,998 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2024-03-11 22:00:51,110 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-03-11 22:00:51,262 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-03-11 22:00:51,268 INFO  L203         MainTranslator]: Completed pre-run
[2024-03-11 22:00:51,278 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-03-11 22:00:51,299 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-03-11 22:00:51,333 INFO  L208         MainTranslator]: Completed translation
[2024-03-11 22:00:51,333 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:00:51 WrapperNode
[2024-03-11 22:00:51,333 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-11 22:00:51,334 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-11 22:00:51,334 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-11 22:00:51,334 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-11 22:00:51,339 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:00:51" (1/1) ...
[2024-03-11 22:00:51,353 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:00:51" (1/1) ...
[2024-03-11 22:00:51,372 INFO  L138                Inliner]: procedures = 266, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 97
[2024-03-11 22:00:51,372 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-11 22:00:51,373 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-11 22:00:51,373 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-11 22:00:51,373 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2024-03-11 22:00:51,380 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:00:51" (1/1) ...
[2024-03-11 22:00:51,380 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:00:51" (1/1) ...
[2024-03-11 22:00:51,383 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:00:51" (1/1) ...
[2024-03-11 22:00:51,383 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:00:51" (1/1) ...
[2024-03-11 22:00:51,391 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:00:51" (1/1) ...
[2024-03-11 22:00:51,393 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:00:51" (1/1) ...
[2024-03-11 22:00:51,395 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:00:51" (1/1) ...
[2024-03-11 22:00:51,396 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:00:51" (1/1) ...
[2024-03-11 22:00:51,398 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-11 22:00:51,399 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-11 22:00:51,399 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2024-03-11 22:00:51,399 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2024-03-11 22:00:51,399 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:00:51" (1/1) ...
[2024-03-11 22:00:51,405 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-03-11 22:00:51,412 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:00:51,423 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2024-03-11 22:00:51,426 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2024-03-11 22:00:51,448 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-03-11 22:00:51,448 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-03-11 22:00:51,448 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-11 22:00:51,448 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-03-11 22:00:51,448 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-11 22:00:51,448 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-11 22:00:51,448 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-03-11 22:00:51,448 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-11 22:00:51,448 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-11 22:00:51,449 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-11 22:00:51,449 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-11 22:00:51,450 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2024-03-11 22:00:51,597 INFO  L235             CfgBuilder]: Building ICFG
[2024-03-11 22:00:51,599 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-11 22:00:51,783 INFO  L276             CfgBuilder]: Performing block encoding
[2024-03-11 22:00:51,789 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-11 22:00:51,789 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-11 22:00:51,791 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 10:00:51 BoogieIcfgContainer
[2024-03-11 22:00:51,791 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-11 22:00:51,792 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-11 22:00:51,792 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2024-03-11 22:00:51,794 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2024-03-11 22:00:51,795 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 10:00:50" (1/3) ...
[2024-03-11 22:00:51,795 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60591eb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 10:00:51, skipping insertion in model container
[2024-03-11 22:00:51,795 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:00:51" (2/3) ...
[2024-03-11 22:00:51,795 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60591eb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 10:00:51, skipping insertion in model container
[2024-03-11 22:00:51,796 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 10:00:51" (3/3) ...
[2024-03-11 22:00:51,797 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-array-ptr.i
[2024-03-11 22:00:51,802 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-11 22:00:51,810 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-11 22:00:51,810 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations.
[2024-03-11 22:00:51,810 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-11 22:00:51,849 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-11 22:00:51,896 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 121 places, 122 transitions, 252 flow
[2024-03-11 22:00:51,963 INFO  L130       PetriNetUnfolder]: 6/186 cut-off events.
[2024-03-11 22:00:51,964 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-11 22:00:51,970 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 192 conditions, 186 events. 6/186 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 364 event pairs, 0 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 92. Up to 4 conditions per place. 
[2024-03-11 22:00:51,970 INFO  L82        GeneralOperation]: Start removeDead. Operand has 121 places, 122 transitions, 252 flow
[2024-03-11 22:00:51,974 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 121 places, 122 transitions, 252 flow
[2024-03-11 22:00:51,976 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-11 22:00:51,983 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 122 transitions, 252 flow
[2024-03-11 22:00:51,985 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 122 transitions, 252 flow
[2024-03-11 22:00:51,986 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 121 places, 122 transitions, 252 flow
[2024-03-11 22:00:52,015 INFO  L130       PetriNetUnfolder]: 6/186 cut-off events.
[2024-03-11 22:00:52,016 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-11 22:00:52,016 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 192 conditions, 186 events. 6/186 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 364 event pairs, 0 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 92. Up to 4 conditions per place. 
[2024-03-11 22:00:52,018 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2160
[2024-03-11 22:00:55,366 INFO  L134        LiptonReduction]: Checked pairs total: 11796
[2024-03-11 22:00:55,366 INFO  L136        LiptonReduction]: Total number of compositions: 75
[2024-03-11 22:00:55,378 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-11 22:00:55,383 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1fc14a02, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-11 22:00:55,383 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 9 error locations.
[2024-03-11 22:00:55,386 INFO  L130       PetriNetUnfolder]: 0/15 cut-off events.
[2024-03-11 22:00:55,386 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 22:00:55,386 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:00:55,387 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:00:55,387 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-11 22:00:55,390 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:00:55,391 INFO  L85        PathProgramCache]: Analyzing trace with hash -2111679578, now seen corresponding path program 1 times
[2024-03-11 22:00:55,398 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:00:55,398 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265898931]
[2024-03-11 22:00:55,398 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:00:55,398 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:00:55,497 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:00:55,791 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:00:55,792 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:00:55,792 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265898931]
[2024-03-11 22:00:55,793 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265898931] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:00:55,793 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:00:55,793 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 22:00:55,794 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434523002]
[2024-03-11 22:00:55,794 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:00:55,800 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 22:00:55,800 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:00:55,815 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 22:00:55,816 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 22:00:56,142 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 197
[2024-03-11 22:00:56,145 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 122 flow. Second operand  has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:00:56,145 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:00:56,145 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 197
[2024-03-11 22:00:56,146 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:00:56,368 INFO  L130       PetriNetUnfolder]: 152/518 cut-off events.
[2024-03-11 22:00:56,368 INFO  L131       PetriNetUnfolder]: For 4/8 co-relation queries the response was YES.
[2024-03-11 22:00:56,370 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 895 conditions, 518 events. 152/518 cut-off events. For 4/8 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2748 event pairs, 47 based on Foata normal form. 0/473 useless extension candidates. Maximal degree in co-relation 808. Up to 237 conditions per place. 
[2024-03-11 22:00:56,372 INFO  L137   encePairwiseOnDemand]: 181/197 looper letters, 49 selfloop transitions, 23 changer transitions 0/99 dead transitions.
[2024-03-11 22:00:56,372 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 99 transitions, 350 flow
[2024-03-11 22:00:56,374 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:00:56,375 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:00:56,383 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 662 transitions.
[2024-03-11 22:00:56,386 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.560067681895093
[2024-03-11 22:00:56,386 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 662 transitions.
[2024-03-11 22:00:56,386 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 662 transitions.
[2024-03-11 22:00:56,388 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:00:56,390 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 662 transitions.
[2024-03-11 22:00:56,395 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 110.33333333333333) internal successors, (662), 6 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:00:56,401 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:00:56,402 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:00:56,403 INFO  L175             Difference]: Start difference. First operand has 59 places, 57 transitions, 122 flow. Second operand 6 states and 662 transitions.
[2024-03-11 22:00:56,404 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 99 transitions, 350 flow
[2024-03-11 22:00:56,406 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 99 transitions, 350 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 22:00:56,408 INFO  L231             Difference]: Finished difference. Result has 69 places, 80 transitions, 292 flow
[2024-03-11 22:00:56,409 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=292, PETRI_PLACES=69, PETRI_TRANSITIONS=80}
[2024-03-11 22:00:56,412 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 10 predicate places.
[2024-03-11 22:00:56,412 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 80 transitions, 292 flow
[2024-03-11 22:00:56,413 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:00:56,413 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:00:56,413 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:00:56,413 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-11 22:00:56,413 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-11 22:00:56,414 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:00:56,414 INFO  L85        PathProgramCache]: Analyzing trace with hash 1923103629, now seen corresponding path program 1 times
[2024-03-11 22:00:56,414 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:00:56,414 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709991074]
[2024-03-11 22:00:56,414 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:00:56,414 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:00:56,426 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:00:56,460 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:00:56,460 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:00:56,461 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709991074]
[2024-03-11 22:00:56,461 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709991074] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:00:56,461 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:00:56,461 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-11 22:00:56,461 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396551388]
[2024-03-11 22:00:56,461 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:00:56,462 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-11 22:00:56,462 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:00:56,462 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-11 22:00:56,463 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-03-11 22:00:56,518 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 111 out of 197
[2024-03-11 22:00:56,518 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 80 transitions, 292 flow. Second operand  has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:00:56,518 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:00:56,518 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 197
[2024-03-11 22:00:56,519 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:00:56,610 INFO  L130       PetriNetUnfolder]: 74/414 cut-off events.
[2024-03-11 22:00:56,610 INFO  L131       PetriNetUnfolder]: For 77/77 co-relation queries the response was YES.
[2024-03-11 22:00:56,611 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 812 conditions, 414 events. 74/414 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2246 event pairs, 13 based on Foata normal form. 0/381 useless extension candidates. Maximal degree in co-relation 680. Up to 91 conditions per place. 
[2024-03-11 22:00:56,613 INFO  L137   encePairwiseOnDemand]: 193/197 looper letters, 22 selfloop transitions, 3 changer transitions 3/90 dead transitions.
[2024-03-11 22:00:56,613 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 90 transitions, 374 flow
[2024-03-11 22:00:56,615 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-11 22:00:56,615 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-11 22:00:56,617 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 471 transitions.
[2024-03-11 22:00:56,617 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5977157360406091
[2024-03-11 22:00:56,617 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 471 transitions.
[2024-03-11 22:00:56,617 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 471 transitions.
[2024-03-11 22:00:56,618 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:00:56,618 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 471 transitions.
[2024-03-11 22:00:56,619 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:00:56,620 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:00:56,621 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:00:56,621 INFO  L175             Difference]: Start difference. First operand has 69 places, 80 transitions, 292 flow. Second operand 4 states and 471 transitions.
[2024-03-11 22:00:56,621 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 90 transitions, 374 flow
[2024-03-11 22:00:56,624 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 90 transitions, 374 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 22:00:56,626 INFO  L231             Difference]: Finished difference. Result has 74 places, 81 transitions, 308 flow
[2024-03-11 22:00:56,627 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=308, PETRI_PLACES=74, PETRI_TRANSITIONS=81}
[2024-03-11 22:00:56,627 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 15 predicate places.
[2024-03-11 22:00:56,628 INFO  L495      AbstractCegarLoop]: Abstraction has has 74 places, 81 transitions, 308 flow
[2024-03-11 22:00:56,628 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:00:56,628 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:00:56,628 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:00:56,629 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-11 22:00:56,629 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-11 22:00:56,629 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:00:56,630 INFO  L85        PathProgramCache]: Analyzing trace with hash -1793601009, now seen corresponding path program 1 times
[2024-03-11 22:00:56,630 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:00:56,630 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988831737]
[2024-03-11 22:00:56,630 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:00:56,630 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:00:56,642 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:00:56,785 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:00:56,785 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:00:56,785 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988831737]
[2024-03-11 22:00:56,786 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988831737] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:00:56,786 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:00:56,786 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 22:00:56,786 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023416529]
[2024-03-11 22:00:56,786 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:00:56,787 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 22:00:56,787 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:00:56,787 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 22:00:56,788 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 22:00:57,007 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 92 out of 197
[2024-03-11 22:00:57,007 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 81 transitions, 308 flow. Second operand  has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:00:57,008 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:00:57,008 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 197
[2024-03-11 22:00:57,008 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:00:57,215 INFO  L130       PetriNetUnfolder]: 293/878 cut-off events.
[2024-03-11 22:00:57,216 INFO  L131       PetriNetUnfolder]: For 353/362 co-relation queries the response was YES.
[2024-03-11 22:00:57,218 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2134 conditions, 878 events. 293/878 cut-off events. For 353/362 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5270 event pairs, 47 based on Foata normal form. 5/858 useless extension candidates. Maximal degree in co-relation 2006. Up to 413 conditions per place. 
[2024-03-11 22:00:57,222 INFO  L137   encePairwiseOnDemand]: 174/197 looper letters, 75 selfloop transitions, 50 changer transitions 1/154 dead transitions.
[2024-03-11 22:00:57,222 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 154 transitions, 830 flow
[2024-03-11 22:00:57,222 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:00:57,222 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:00:57,224 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 645 transitions.
[2024-03-11 22:00:57,225 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5456852791878173
[2024-03-11 22:00:57,225 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 645 transitions.
[2024-03-11 22:00:57,225 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 645 transitions.
[2024-03-11 22:00:57,225 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:00:57,226 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 645 transitions.
[2024-03-11 22:00:57,227 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:00:57,229 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:00:57,229 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:00:57,229 INFO  L175             Difference]: Start difference. First operand has 74 places, 81 transitions, 308 flow. Second operand 6 states and 645 transitions.
[2024-03-11 22:00:57,229 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 154 transitions, 830 flow
[2024-03-11 22:00:57,232 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 154 transitions, 827 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-11 22:00:57,234 INFO  L231             Difference]: Finished difference. Result has 83 places, 129 transitions, 778 flow
[2024-03-11 22:00:57,234 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=778, PETRI_PLACES=83, PETRI_TRANSITIONS=129}
[2024-03-11 22:00:57,235 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 24 predicate places.
[2024-03-11 22:00:57,235 INFO  L495      AbstractCegarLoop]: Abstraction has has 83 places, 129 transitions, 778 flow
[2024-03-11 22:00:57,235 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:00:57,235 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:00:57,235 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:00:57,235 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-11 22:00:57,236 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-11 22:00:57,236 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:00:57,236 INFO  L85        PathProgramCache]: Analyzing trace with hash -111535527, now seen corresponding path program 1 times
[2024-03-11 22:00:57,236 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:00:57,236 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072328429]
[2024-03-11 22:00:57,236 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:00:57,237 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:00:57,260 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:00:57,475 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:00:57,475 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:00:57,475 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072328429]
[2024-03-11 22:00:57,475 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072328429] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:00:57,475 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:00:57,475 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 22:00:57,476 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980554892]
[2024-03-11 22:00:57,476 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:00:57,476 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 22:00:57,476 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:00:57,477 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 22:00:57,477 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 22:00:57,616 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 84 out of 197
[2024-03-11 22:00:57,616 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 129 transitions, 778 flow. Second operand  has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:00:57,616 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:00:57,617 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 197
[2024-03-11 22:00:57,617 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:00:58,253 INFO  L130       PetriNetUnfolder]: 533/1338 cut-off events.
[2024-03-11 22:00:58,254 INFO  L131       PetriNetUnfolder]: For 1294/1306 co-relation queries the response was YES.
[2024-03-11 22:00:58,257 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4355 conditions, 1338 events. 533/1338 cut-off events. For 1294/1306 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 8327 event pairs, 97 based on Foata normal form. 0/1256 useless extension candidates. Maximal degree in co-relation 4145. Up to 987 conditions per place. 
[2024-03-11 22:00:58,264 INFO  L137   encePairwiseOnDemand]: 167/197 looper letters, 148 selfloop transitions, 107 changer transitions 6/275 dead transitions.
[2024-03-11 22:00:58,264 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 275 transitions, 1904 flow
[2024-03-11 22:00:58,266 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:00:58,266 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:00:58,268 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 690 transitions.
[2024-03-11 22:00:58,269 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.583756345177665
[2024-03-11 22:00:58,269 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 690 transitions.
[2024-03-11 22:00:58,269 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 690 transitions.
[2024-03-11 22:00:58,269 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:00:58,269 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 690 transitions.
[2024-03-11 22:00:58,271 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:00:58,272 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:00:58,273 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:00:58,273 INFO  L175             Difference]: Start difference. First operand has 83 places, 129 transitions, 778 flow. Second operand 6 states and 690 transitions.
[2024-03-11 22:00:58,273 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 275 transitions, 1904 flow
[2024-03-11 22:00:58,279 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 275 transitions, 1888 flow, removed 5 selfloop flow, removed 2 redundant places.
[2024-03-11 22:00:58,283 INFO  L231             Difference]: Finished difference. Result has 89 places, 233 transitions, 1622 flow
[2024-03-11 22:00:58,283 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1622, PETRI_PLACES=89, PETRI_TRANSITIONS=233}
[2024-03-11 22:00:58,284 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 30 predicate places.
[2024-03-11 22:00:58,284 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 233 transitions, 1622 flow
[2024-03-11 22:00:58,284 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:00:58,284 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:00:58,284 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:00:58,284 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-11 22:00:58,284 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-11 22:00:58,285 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:00:58,285 INFO  L85        PathProgramCache]: Analyzing trace with hash 2008110853, now seen corresponding path program 1 times
[2024-03-11 22:00:58,285 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:00:58,285 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455521503]
[2024-03-11 22:00:58,285 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:00:58,285 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:00:58,304 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:00:58,643 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:00:58,644 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:00:58,644 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455521503]
[2024-03-11 22:00:58,644 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455521503] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:00:58,644 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940538811]
[2024-03-11 22:00:58,644 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:00:58,644 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:00:58,644 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:00:58,645 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:00:58,647 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-03-11 22:00:58,750 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:00:58,762 INFO  L263         TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 32 conjunts are in the unsatisfiable core
[2024-03-11 22:00:58,772 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:00:58,837 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2024-03-11 22:00:58,969 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-11 22:00:59,008 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:00:59,009 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-11 22:00:59,055 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:00:59,057 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:00:59,059 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-03-11 22:00:59,125 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:00:59,127 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:00:59,129 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:00:59,132 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-03-11 22:00:59,189 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:00:59,190 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:00:59,230 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:00:59,230 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:00:59,274 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_229 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_229) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)) (forall ((v_ArrVal_229 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_229) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3)) 0)) (forall ((v_ArrVal_229 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_229) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0)) (forall ((v_ArrVal_229 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_229) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) 0))) is different from false
[2024-03-11 22:00:59,304 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_229 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_229) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0)) (forall ((v_ArrVal_229 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_229) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)) (forall ((v_ArrVal_229 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_229) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_229 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_229) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) 0))))) is different from false
[2024-03-11 22:00:59,332 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) (.cse2 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_229 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_229) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0)) (forall ((v_ArrVal_229 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_229) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)) (forall ((v_ArrVal_229 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_229) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_229 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_229) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse2) 0))))) is different from false
[2024-03-11 22:00:59,356 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) (.cse2 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) (.cse3 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1 0) .cse2 0) .cse3 0)))) (and (forall ((v_ArrVal_229 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_229) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)) (forall ((v_ArrVal_229 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_229) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_229 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_229) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_229 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_229) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse3) 0))))) is different from false
[2024-03-11 22:00:59,377 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:00:59,377 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 51
[2024-03-11 22:00:59,383 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:00:59,384 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 36
[2024-03-11 22:00:59,388 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-03-11 22:00:59,395 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:00:59,395 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2024-03-11 22:00:59,401 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:00:59,401 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2024-03-11 22:00:59,406 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:00:59,406 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 1
[2024-03-11 22:00:59,437 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked.
[2024-03-11 22:00:59,437 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940538811] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:00:59,437 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:00:59,438 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23
[2024-03-11 22:00:59,438 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248318326]
[2024-03-11 22:00:59,438 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:00:59,438 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 25 states
[2024-03-11 22:00:59,438 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:00:59,439 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2024-03-11 22:00:59,439 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=341, Unknown=4, NotChecked=164, Total=600
[2024-03-11 22:00:59,453 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 59 out of 197
[2024-03-11 22:00:59,455 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 233 transitions, 1622 flow. Second operand  has 25 states, 25 states have (on average 61.64) internal successors, (1541), 25 states have internal predecessors, (1541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:00:59,455 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:00:59,455 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 197
[2024-03-11 22:00:59,455 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:01:00,242 INFO  L130       PetriNetUnfolder]: 625/1462 cut-off events.
[2024-03-11 22:01:00,243 INFO  L131       PetriNetUnfolder]: For 2955/2957 co-relation queries the response was YES.
[2024-03-11 22:01:00,245 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6013 conditions, 1462 events. 625/1462 cut-off events. For 2955/2957 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 8851 event pairs, 169 based on Foata normal form. 10/1364 useless extension candidates. Maximal degree in co-relation 5783. Up to 1332 conditions per place. 
[2024-03-11 22:01:00,250 INFO  L137   encePairwiseOnDemand]: 187/197 looper letters, 277 selfloop transitions, 12 changer transitions 8/299 dead transitions.
[2024-03-11 22:01:00,250 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 299 transitions, 2568 flow
[2024-03-11 22:01:00,250 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-03-11 22:01:00,251 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-03-11 22:01:00,252 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 709 transitions.
[2024-03-11 22:01:00,253 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3598984771573604
[2024-03-11 22:01:00,253 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 709 transitions.
[2024-03-11 22:01:00,253 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 709 transitions.
[2024-03-11 22:01:00,253 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:01:00,253 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 709 transitions.
[2024-03-11 22:01:00,254 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 70.9) internal successors, (709), 10 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:00,257 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 197.0) internal successors, (2167), 11 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:00,257 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 197.0) internal successors, (2167), 11 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:00,257 INFO  L175             Difference]: Start difference. First operand has 89 places, 233 transitions, 1622 flow. Second operand 10 states and 709 transitions.
[2024-03-11 22:01:00,257 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 299 transitions, 2568 flow
[2024-03-11 22:01:00,270 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 299 transitions, 2448 flow, removed 60 selfloop flow, removed 0 redundant places.
[2024-03-11 22:01:00,273 INFO  L231             Difference]: Finished difference. Result has 99 places, 236 transitions, 1543 flow
[2024-03-11 22:01:00,274 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=1494, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1543, PETRI_PLACES=99, PETRI_TRANSITIONS=236}
[2024-03-11 22:01:00,274 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 40 predicate places.
[2024-03-11 22:01:00,274 INFO  L495      AbstractCegarLoop]: Abstraction has has 99 places, 236 transitions, 1543 flow
[2024-03-11 22:01:00,275 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 25 states, 25 states have (on average 61.64) internal successors, (1541), 25 states have internal predecessors, (1541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:00,275 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:01:00,275 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:01:00,285 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-03-11 22:01:00,476 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:01:00,477 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-11 22:01:00,477 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:01:00,478 INFO  L85        PathProgramCache]: Analyzing trace with hash 1552075070, now seen corresponding path program 1 times
[2024-03-11 22:01:00,478 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:01:00,478 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419687270]
[2024-03-11 22:01:00,478 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:01:00,479 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:01:00,523 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:01:00,838 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:01:00,839 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:01:00,839 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419687270]
[2024-03-11 22:01:00,839 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419687270] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:01:00,839 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198625990]
[2024-03-11 22:01:00,839 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:01:00,839 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:01:00,839 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:01:00,840 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:01:00,845 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-03-11 22:01:00,962 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:01:00,965 INFO  L263         TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 24 conjunts are in the unsatisfiable core
[2024-03-11 22:01:00,968 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:01:00,990 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2024-03-11 22:01:01,053 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-11 22:01:01,084 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-11 22:01:01,127 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:01:01,128 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2024-03-11 22:01:01,171 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:01:01,171 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2024-03-11 22:01:01,241 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:01:01,241 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:01:01,259 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:01:01,259 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:01:01,283 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_342 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_342) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_342 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_342) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)))) (forall ((v_ArrVal_342 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_342) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_342 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_342) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false
[2024-03-11 22:01:01,332 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_342 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_342) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_342 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_342) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_342 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_342) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_342 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_342) c_threadThread1of1ForFork0_~p~0.base) .cse1)))))) is different from false
[2024-03-11 22:01:01,356 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_342 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_342) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_342 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_342) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_342 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_342) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_342 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_342) c_threadThread1of1ForFork0_~p~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2024-03-11 22:01:01,496 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2024-03-11 22:01:01,496 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198625990] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:01:01,496 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:01:01,496 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24
[2024-03-11 22:01:01,497 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908468869]
[2024-03-11 22:01:01,497 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:01:01,497 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2024-03-11 22:01:01,497 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:01:01,497 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2024-03-11 22:01:01,498 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=418, Unknown=3, NotChecked=132, Total=650
[2024-03-11 22:01:01,580 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 197
[2024-03-11 22:01:01,582 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 236 transitions, 1543 flow. Second operand  has 26 states, 26 states have (on average 59.65384615384615) internal successors, (1551), 26 states have internal predecessors, (1551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:01,582 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:01:01,582 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 197
[2024-03-11 22:01:01,582 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:01:04,157 INFO  L130       PetriNetUnfolder]: 665/1545 cut-off events.
[2024-03-11 22:01:04,157 INFO  L131       PetriNetUnfolder]: For 2896/2898 co-relation queries the response was YES.
[2024-03-11 22:01:04,160 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6477 conditions, 1545 events. 665/1545 cut-off events. For 2896/2898 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 9495 event pairs, 116 based on Foata normal form. 2/1450 useless extension candidates. Maximal degree in co-relation 6240. Up to 961 conditions per place. 
[2024-03-11 22:01:04,165 INFO  L137   encePairwiseOnDemand]: 146/197 looper letters, 283 selfloop transitions, 159 changer transitions 32/476 dead transitions.
[2024-03-11 22:01:04,165 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 476 transitions, 3867 flow
[2024-03-11 22:01:04,166 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2024-03-11 22:01:04,167 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2024-03-11 22:01:04,169 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1393 transitions.
[2024-03-11 22:01:04,170 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3721613678867219
[2024-03-11 22:01:04,170 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1393 transitions.
[2024-03-11 22:01:04,170 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1393 transitions.
[2024-03-11 22:01:04,171 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:01:04,171 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1393 transitions.
[2024-03-11 22:01:04,173 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 73.3157894736842) internal successors, (1393), 19 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:04,177 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 197.0) internal successors, (3940), 20 states have internal predecessors, (3940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:04,177 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 197.0) internal successors, (3940), 20 states have internal predecessors, (3940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:04,177 INFO  L175             Difference]: Start difference. First operand has 99 places, 236 transitions, 1543 flow. Second operand 19 states and 1393 transitions.
[2024-03-11 22:01:04,177 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 476 transitions, 3867 flow
[2024-03-11 22:01:04,190 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 476 transitions, 3838 flow, removed 0 selfloop flow, removed 4 redundant places.
[2024-03-11 22:01:04,195 INFO  L231             Difference]: Finished difference. Result has 119 places, 298 transitions, 2590 flow
[2024-03-11 22:01:04,195 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=1531, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=2590, PETRI_PLACES=119, PETRI_TRANSITIONS=298}
[2024-03-11 22:01:04,195 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 60 predicate places.
[2024-03-11 22:01:04,195 INFO  L495      AbstractCegarLoop]: Abstraction has has 119 places, 298 transitions, 2590 flow
[2024-03-11 22:01:04,196 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 59.65384615384615) internal successors, (1551), 26 states have internal predecessors, (1551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:04,196 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:01:04,196 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:01:04,201 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-03-11 22:01:04,401 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:01:04,402 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-11 22:01:04,403 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:01:04,403 INFO  L85        PathProgramCache]: Analyzing trace with hash 870091243, now seen corresponding path program 1 times
[2024-03-11 22:01:04,403 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:01:04,403 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091235838]
[2024-03-11 22:01:04,404 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:01:04,404 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:01:04,432 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:01:04,499 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:01:04,499 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:01:04,499 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091235838]
[2024-03-11 22:01:04,499 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091235838] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:01:04,499 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590106665]
[2024-03-11 22:01:04,499 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:01:04,499 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:01:04,499 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:01:04,500 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:01:04,504 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-03-11 22:01:04,601 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:01:04,602 INFO  L263         TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 4 conjunts are in the unsatisfiable core
[2024-03-11 22:01:04,604 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:01:04,646 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:01:04,647 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:01:04,687 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:01:04,687 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [590106665] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:01:04,687 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:01:04,687 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2024-03-11 22:01:04,688 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350087388]
[2024-03-11 22:01:04,688 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:01:04,689 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-03-11 22:01:04,689 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:01:04,689 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-03-11 22:01:04,689 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-03-11 22:01:04,819 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 107 out of 197
[2024-03-11 22:01:04,820 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 298 transitions, 2590 flow. Second operand  has 9 states, 9 states have (on average 109.22222222222223) internal successors, (983), 9 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:04,820 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:01:04,820 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 197
[2024-03-11 22:01:04,820 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:01:04,979 INFO  L130       PetriNetUnfolder]: 256/808 cut-off events.
[2024-03-11 22:01:04,979 INFO  L131       PetriNetUnfolder]: For 2024/2047 co-relation queries the response was YES.
[2024-03-11 22:01:04,981 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3487 conditions, 808 events. 256/808 cut-off events. For 2024/2047 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4881 event pairs, 19 based on Foata normal form. 3/775 useless extension candidates. Maximal degree in co-relation 3289. Up to 244 conditions per place. 
[2024-03-11 22:01:04,985 INFO  L137   encePairwiseOnDemand]: 190/197 looper letters, 24 selfloop transitions, 12 changer transitions 12/228 dead transitions.
[2024-03-11 22:01:04,985 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 228 transitions, 1979 flow
[2024-03-11 22:01:04,985 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-03-11 22:01:04,985 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-03-11 22:01:04,987 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 774 transitions.
[2024-03-11 22:01:04,987 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5612762871646121
[2024-03-11 22:01:04,987 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 774 transitions.
[2024-03-11 22:01:04,987 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 774 transitions.
[2024-03-11 22:01:04,988 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:01:04,988 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 774 transitions.
[2024-03-11 22:01:04,989 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 110.57142857142857) internal successors, (774), 7 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:04,991 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:04,991 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:04,991 INFO  L175             Difference]: Start difference. First operand has 119 places, 298 transitions, 2590 flow. Second operand 7 states and 774 transitions.
[2024-03-11 22:01:04,991 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 228 transitions, 1979 flow
[2024-03-11 22:01:05,003 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 228 transitions, 1882 flow, removed 23 selfloop flow, removed 9 redundant places.
[2024-03-11 22:01:05,005 INFO  L231             Difference]: Finished difference. Result has 115 places, 211 transitions, 1758 flow
[2024-03-11 22:01:05,006 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=1769, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1758, PETRI_PLACES=115, PETRI_TRANSITIONS=211}
[2024-03-11 22:01:05,006 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 56 predicate places.
[2024-03-11 22:01:05,006 INFO  L495      AbstractCegarLoop]: Abstraction has has 115 places, 211 transitions, 1758 flow
[2024-03-11 22:01:05,007 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 109.22222222222223) internal successors, (983), 9 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:05,007 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:01:05,007 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:01:05,015 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2024-03-11 22:01:05,208 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:01:05,209 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-11 22:01:05,210 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:01:05,210 INFO  L85        PathProgramCache]: Analyzing trace with hash 1044038821, now seen corresponding path program 1 times
[2024-03-11 22:01:05,210 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:01:05,211 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865052829]
[2024-03-11 22:01:05,211 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:01:05,211 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:01:05,233 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:01:05,534 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:01:05,534 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:01:05,534 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865052829]
[2024-03-11 22:01:05,534 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865052829] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:01:05,534 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646180307]
[2024-03-11 22:01:05,535 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:01:05,535 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:01:05,535 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:01:05,536 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:01:05,538 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-03-11 22:01:05,655 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:01:05,656 INFO  L263         TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 24 conjunts are in the unsatisfiable core
[2024-03-11 22:01:05,659 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:01:05,677 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2024-03-11 22:01:05,733 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-11 22:01:05,753 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-11 22:01:05,793 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:01:05,794 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2024-03-11 22:01:05,858 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:01:05,858 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2024-03-11 22:01:05,897 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:01:05,898 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:01:05,906 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:01:05,907 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:01:05,928 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_559 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_559) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_559 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_559) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_559 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_559) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_559 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_559) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false
[2024-03-11 22:01:05,946 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_559 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_559) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_559 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_559) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_559 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_559) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_559 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_559) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2024-03-11 22:01:05,994 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_559 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_559) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_559 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_559) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_559 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_559) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset))) (forall ((v_ArrVal_559 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_559) c_threadThread1of1ForFork0_~p~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2024-03-11 22:01:06,114 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-03-11 22:01:06,115 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646180307] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:01:06,115 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:01:06,115 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24
[2024-03-11 22:01:06,115 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296364482]
[2024-03-11 22:01:06,115 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:01:06,116 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2024-03-11 22:01:06,116 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:01:06,116 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2024-03-11 22:01:06,117 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=418, Unknown=3, NotChecked=132, Total=650
[2024-03-11 22:01:06,243 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 54 out of 197
[2024-03-11 22:01:06,244 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 211 transitions, 1758 flow. Second operand  has 26 states, 26 states have (on average 56.76923076923077) internal successors, (1476), 26 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:06,244 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:01:06,245 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 197
[2024-03-11 22:01:06,245 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:01:08,733 INFO  L130       PetriNetUnfolder]: 513/1226 cut-off events.
[2024-03-11 22:01:08,733 INFO  L131       PetriNetUnfolder]: For 3644/3644 co-relation queries the response was YES.
[2024-03-11 22:01:08,736 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6150 conditions, 1226 events. 513/1226 cut-off events. For 3644/3644 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 7292 event pairs, 27 based on Foata normal form. 43/1250 useless extension candidates. Maximal degree in co-relation 5928. Up to 637 conditions per place. 
[2024-03-11 22:01:08,742 INFO  L137   encePairwiseOnDemand]: 159/197 looper letters, 246 selfloop transitions, 190 changer transitions 0/438 dead transitions.
[2024-03-11 22:01:08,742 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 438 transitions, 4114 flow
[2024-03-11 22:01:08,743 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2024-03-11 22:01:08,743 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20 states.
[2024-03-11 22:01:08,745 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1346 transitions.
[2024-03-11 22:01:08,746 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3416243654822335
[2024-03-11 22:01:08,746 INFO  L72            ComplementDD]: Start complementDD. Operand 20 states and 1346 transitions.
[2024-03-11 22:01:08,746 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 20 states and 1346 transitions.
[2024-03-11 22:01:08,747 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:01:08,747 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1346 transitions.
[2024-03-11 22:01:08,749 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 21 states, 20 states have (on average 67.3) internal successors, (1346), 20 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:08,752 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 21 states, 21 states have (on average 197.0) internal successors, (4137), 21 states have internal predecessors, (4137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:08,753 INFO  L81            ComplementDD]: Finished complementDD. Result  has 21 states, 21 states have (on average 197.0) internal successors, (4137), 21 states have internal predecessors, (4137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:08,753 INFO  L175             Difference]: Start difference. First operand has 115 places, 211 transitions, 1758 flow. Second operand 20 states and 1346 transitions.
[2024-03-11 22:01:08,753 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 438 transitions, 4114 flow
[2024-03-11 22:01:08,770 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 438 transitions, 4058 flow, removed 15 selfloop flow, removed 5 redundant places.
[2024-03-11 22:01:08,774 INFO  L231             Difference]: Finished difference. Result has 124 places, 313 transitions, 3324 flow
[2024-03-11 22:01:08,775 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=1718, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3324, PETRI_PLACES=124, PETRI_TRANSITIONS=313}
[2024-03-11 22:01:08,775 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 65 predicate places.
[2024-03-11 22:01:08,775 INFO  L495      AbstractCegarLoop]: Abstraction has has 124 places, 313 transitions, 3324 flow
[2024-03-11 22:01:08,776 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 56.76923076923077) internal successors, (1476), 26 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:08,776 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:01:08,776 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:01:08,781 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-03-11 22:01:08,981 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:01:08,982 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-11 22:01:08,982 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:01:08,983 INFO  L85        PathProgramCache]: Analyzing trace with hash -1089447964, now seen corresponding path program 1 times
[2024-03-11 22:01:08,983 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:01:08,983 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102879609]
[2024-03-11 22:01:08,983 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:01:08,984 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:01:09,004 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:01:09,318 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:01:09,318 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:01:09,319 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102879609]
[2024-03-11 22:01:09,319 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102879609] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:01:09,319 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815641075]
[2024-03-11 22:01:09,319 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:01:09,319 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:01:09,319 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:01:09,320 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:01:09,322 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-03-11 22:01:09,483 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:01:09,485 INFO  L263         TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 26 conjunts are in the unsatisfiable core
[2024-03-11 22:01:09,487 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:01:09,515 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2024-03-11 22:01:09,628 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-11 22:01:09,653 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:01:09,654 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-11 22:01:09,708 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:01:09,709 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:01:09,710 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-03-11 22:01:09,751 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:01:09,753 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:01:09,754 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:01:09,754 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-03-11 22:01:09,848 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:01:09,849 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:01:09,897 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:01:09,897 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:01:09,917 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_672 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_672) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_672 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_672) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_672 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_672) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_672 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_672) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))) is different from false
[2024-03-11 22:01:10,187 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0)))) (and (forall ((v_threadThread1of1ForFork0_~p~0.base_41 Int)) (or (forall ((v_ArrVal_672 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of1ForFork0_~p~0.base_41 v_ArrVal_672) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~p~0.base_41))) (forall ((v_threadThread1of1ForFork0_~p~0.base_41 Int)) (or (forall ((v_ArrVal_672 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of1ForFork0_~p~0.base_41 v_ArrVal_672) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~p~0.base_41))) (forall ((v_threadThread1of1ForFork0_~p~0.base_41 Int)) (or (forall ((v_ArrVal_672 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of1ForFork0_~p~0.base_41 v_ArrVal_672) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~p~0.base_41))) (forall ((v_threadThread1of1ForFork0_~p~0.base_41 Int)) (or (forall ((v_ArrVal_672 (Array Int Int))) (= 0 (select (select (store .cse0 v_threadThread1of1ForFork0_~p~0.base_41 v_ArrVal_672) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~p~0.base_41)))))) is different from false
[2024-03-11 22:01:10,219 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_threadThread1of1ForFork0_~p~0.base_41 Int)) (or (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~p~0.base_41) (forall ((v_ArrVal_672 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of1ForFork0_~p~0.base_41 v_ArrVal_672) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)))) (forall ((v_threadThread1of1ForFork0_~p~0.base_41 Int)) (or (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~p~0.base_41) (forall ((v_ArrVal_672 (Array Int Int))) (= 0 (select (select (store .cse0 v_threadThread1of1ForFork0_~p~0.base_41 v_ArrVal_672) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))))) (forall ((v_threadThread1of1ForFork0_~p~0.base_41 Int)) (or (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~p~0.base_41) (forall ((v_ArrVal_672 (Array Int Int))) (= 0 (select (select (store .cse0 v_threadThread1of1ForFork0_~p~0.base_41 v_ArrVal_672) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1))))) (forall ((v_threadThread1of1ForFork0_~p~0.base_41 Int)) (or (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~p~0.base_41) (forall ((v_ArrVal_672 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of1ForFork0_~p~0.base_41 v_ArrVal_672) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0))))))) is different from false
[2024-03-11 22:01:10,402 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:01:10,403 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 49
[2024-03-11 22:01:10,409 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:01:10,410 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 34
[2024-03-11 22:01:10,413 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3
[2024-03-11 22:01:10,480 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:01:10,480 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [815641075] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:01:10,481 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:01:10,481 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27
[2024-03-11 22:01:10,481 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699770957]
[2024-03-11 22:01:10,481 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:01:10,481 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2024-03-11 22:01:10,482 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:01:10,482 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2024-03-11 22:01:10,482 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=522, Unknown=14, NotChecked=150, Total=812
[2024-03-11 22:01:10,570 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 56 out of 197
[2024-03-11 22:01:10,572 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 313 transitions, 3324 flow. Second operand  has 29 states, 29 states have (on average 58.55172413793103) internal successors, (1698), 29 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:10,572 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:01:10,572 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 197
[2024-03-11 22:01:10,572 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:01:11,413 INFO  L130       PetriNetUnfolder]: 487/1169 cut-off events.
[2024-03-11 22:01:11,413 INFO  L131       PetriNetUnfolder]: For 7268/7272 co-relation queries the response was YES.
[2024-03-11 22:01:11,416 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7371 conditions, 1169 events. 487/1169 cut-off events. For 7268/7272 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 6782 event pairs, 45 based on Foata normal form. 29/1179 useless extension candidates. Maximal degree in co-relation 7117. Up to 1076 conditions per place. 
[2024-03-11 22:01:11,422 INFO  L137   encePairwiseOnDemand]: 187/197 looper letters, 321 selfloop transitions, 15 changer transitions 0/338 dead transitions.
[2024-03-11 22:01:11,422 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 338 transitions, 4150 flow
[2024-03-11 22:01:11,422 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-03-11 22:01:11,422 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-03-11 22:01:11,424 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 703 transitions.
[2024-03-11 22:01:11,424 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3244116289801569
[2024-03-11 22:01:11,424 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 703 transitions.
[2024-03-11 22:01:11,425 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 703 transitions.
[2024-03-11 22:01:11,425 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:01:11,425 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 703 transitions.
[2024-03-11 22:01:11,426 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 63.90909090909091) internal successors, (703), 11 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:11,428 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 197.0) internal successors, (2364), 12 states have internal predecessors, (2364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:11,429 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 197.0) internal successors, (2364), 12 states have internal predecessors, (2364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:11,429 INFO  L175             Difference]: Start difference. First operand has 124 places, 313 transitions, 3324 flow. Second operand 11 states and 703 transitions.
[2024-03-11 22:01:11,429 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 338 transitions, 4150 flow
[2024-03-11 22:01:11,453 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 338 transitions, 4009 flow, removed 41 selfloop flow, removed 12 redundant places.
[2024-03-11 22:01:11,457 INFO  L231             Difference]: Finished difference. Result has 121 places, 305 transitions, 3125 flow
[2024-03-11 22:01:11,458 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=3081, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3125, PETRI_PLACES=121, PETRI_TRANSITIONS=305}
[2024-03-11 22:01:11,458 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 62 predicate places.
[2024-03-11 22:01:11,458 INFO  L495      AbstractCegarLoop]: Abstraction has has 121 places, 305 transitions, 3125 flow
[2024-03-11 22:01:11,459 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 29 states, 29 states have (on average 58.55172413793103) internal successors, (1698), 29 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:11,459 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:01:11,459 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:01:11,465 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-03-11 22:01:11,660 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:01:11,661 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-11 22:01:11,661 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:01:11,662 INFO  L85        PathProgramCache]: Analyzing trace with hash -928747222, now seen corresponding path program 1 times
[2024-03-11 22:01:11,662 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:01:11,662 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460550935]
[2024-03-11 22:01:11,662 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:01:11,663 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:01:11,686 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:01:11,861 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-11 22:01:11,861 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:01:11,862 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460550935]
[2024-03-11 22:01:11,862 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460550935] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:01:11,862 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:01:11,862 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 22:01:11,863 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496013979]
[2024-03-11 22:01:11,863 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:01:11,863 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 22:01:11,863 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:01:11,864 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 22:01:11,864 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 22:01:12,145 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 102 out of 197
[2024-03-11 22:01:12,146 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 305 transitions, 3125 flow. Second operand  has 6 states, 6 states have (on average 104.16666666666667) internal successors, (625), 6 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:12,146 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:01:12,146 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 197
[2024-03-11 22:01:12,146 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:01:12,370 INFO  L130       PetriNetUnfolder]: 418/1101 cut-off events.
[2024-03-11 22:01:12,370 INFO  L131       PetriNetUnfolder]: For 6606/6642 co-relation queries the response was YES.
[2024-03-11 22:01:12,373 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6375 conditions, 1101 events. 418/1101 cut-off events. For 6606/6642 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 6773 event pairs, 23 based on Foata normal form. 13/1099 useless extension candidates. Maximal degree in co-relation 6146. Up to 580 conditions per place. 
[2024-03-11 22:01:12,377 INFO  L137   encePairwiseOnDemand]: 186/197 looper letters, 152 selfloop transitions, 49 changer transitions 17/350 dead transitions.
[2024-03-11 22:01:12,378 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 350 transitions, 4041 flow
[2024-03-11 22:01:12,378 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:01:12,378 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:01:12,379 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 665 transitions.
[2024-03-11 22:01:12,379 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.562605752961083
[2024-03-11 22:01:12,379 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 665 transitions.
[2024-03-11 22:01:12,380 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 665 transitions.
[2024-03-11 22:01:12,380 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:01:12,380 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 665 transitions.
[2024-03-11 22:01:12,381 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 110.83333333333333) internal successors, (665), 6 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:12,382 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:12,383 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:12,383 INFO  L175             Difference]: Start difference. First operand has 121 places, 305 transitions, 3125 flow. Second operand 6 states and 665 transitions.
[2024-03-11 22:01:12,383 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 350 transitions, 4041 flow
[2024-03-11 22:01:12,406 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 350 transitions, 4025 flow, removed 0 selfloop flow, removed 6 redundant places.
[2024-03-11 22:01:12,410 INFO  L231             Difference]: Finished difference. Result has 125 places, 329 transitions, 3643 flow
[2024-03-11 22:01:12,410 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=3113, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3643, PETRI_PLACES=125, PETRI_TRANSITIONS=329}
[2024-03-11 22:01:12,411 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 66 predicate places.
[2024-03-11 22:01:12,411 INFO  L495      AbstractCegarLoop]: Abstraction has has 125 places, 329 transitions, 3643 flow
[2024-03-11 22:01:12,411 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 104.16666666666667) internal successors, (625), 6 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:12,411 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:01:12,411 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:01:12,411 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-03-11 22:01:12,412 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-11 22:01:12,412 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:01:12,412 INFO  L85        PathProgramCache]: Analyzing trace with hash -1948420342, now seen corresponding path program 2 times
[2024-03-11 22:01:12,413 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:01:12,413 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409184479]
[2024-03-11 22:01:12,413 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:01:12,413 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:01:12,429 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:01:12,844 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:01:12,844 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:01:12,844 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409184479]
[2024-03-11 22:01:12,845 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409184479] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:01:12,845 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38678762]
[2024-03-11 22:01:12,845 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-11 22:01:12,845 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:01:12,845 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:01:12,846 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:01:12,850 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-03-11 22:01:13,015 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-11 22:01:13,015 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-11 22:01:13,017 INFO  L263         TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 51 conjunts are in the unsatisfiable core
[2024-03-11 22:01:13,020 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:01:13,035 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32
[2024-03-11 22:01:13,073 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7
[2024-03-11 22:01:13,087 INFO  L321             Elim1Store]: treesize reduction 3, result has 75.0 percent of original size
[2024-03-11 22:01:13,087 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 25
[2024-03-11 22:01:13,225 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-11 22:01:13,250 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:01:13,250 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-11 22:01:13,289 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:01:13,290 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:01:13,291 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-03-11 22:01:13,339 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:01:13,340 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:01:13,341 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:01:13,343 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-03-11 22:01:13,383 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:01:13,410 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:01:13,448 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:01:13,470 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:01:13,532 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:01:13,569 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:01:13,569 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:01:13,588 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_860 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_860) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset))) (forall ((v_ArrVal_860 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_860) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_860 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_860) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_860 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_860) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false
[2024-03-11 22:01:13,630 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_859 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_860) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_859 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_860) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_859 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_860) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)))) (forall ((v_ArrVal_859 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_860) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false
[2024-03-11 22:01:13,682 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_859 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_860) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_859 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_860) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_859 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_860) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_859 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_860) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2024-03-11 22:01:13,702 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_859 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_860) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_859 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_860) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_859 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_860) c_threadThread1of1ForFork0_~p~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_859 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_860) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2024-03-11 22:01:13,807 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked.
[2024-03-11 22:01:13,807 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [38678762] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:01:13,807 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:01:13,808 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 25
[2024-03-11 22:01:13,808 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566139750]
[2024-03-11 22:01:13,808 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:01:13,808 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2024-03-11 22:01:13,808 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:01:13,809 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2024-03-11 22:01:13,809 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=416, Unknown=4, NotChecked=180, Total=702
[2024-03-11 22:01:13,933 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 49 out of 197
[2024-03-11 22:01:13,934 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 329 transitions, 3643 flow. Second operand  has 27 states, 27 states have (on average 52.074074074074076) internal successors, (1406), 27 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:13,934 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:01:13,934 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 197
[2024-03-11 22:01:13,934 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:01:17,643 INFO  L130       PetriNetUnfolder]: 521/1218 cut-off events.
[2024-03-11 22:01:17,643 INFO  L131       PetriNetUnfolder]: For 7290/7292 co-relation queries the response was YES.
[2024-03-11 22:01:17,646 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7832 conditions, 1218 events. 521/1218 cut-off events. For 7290/7292 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 7359 event pairs, 10 based on Foata normal form. 26/1244 useless extension candidates. Maximal degree in co-relation 7676. Up to 420 conditions per place. 
[2024-03-11 22:01:17,652 INFO  L137   encePairwiseOnDemand]: 162/197 looper letters, 263 selfloop transitions, 259 changer transitions 6/530 dead transitions.
[2024-03-11 22:01:17,652 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 530 transitions, 6484 flow
[2024-03-11 22:01:17,652 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2024-03-11 22:01:17,653 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20 states.
[2024-03-11 22:01:17,655 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1238 transitions.
[2024-03-11 22:01:17,655 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.31421319796954317
[2024-03-11 22:01:17,655 INFO  L72            ComplementDD]: Start complementDD. Operand 20 states and 1238 transitions.
[2024-03-11 22:01:17,655 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 20 states and 1238 transitions.
[2024-03-11 22:01:17,656 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:01:17,656 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1238 transitions.
[2024-03-11 22:01:17,658 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 21 states, 20 states have (on average 61.9) internal successors, (1238), 20 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:17,661 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 21 states, 21 states have (on average 197.0) internal successors, (4137), 21 states have internal predecessors, (4137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:17,662 INFO  L81            ComplementDD]: Finished complementDD. Result  has 21 states, 21 states have (on average 197.0) internal successors, (4137), 21 states have internal predecessors, (4137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:17,662 INFO  L175             Difference]: Start difference. First operand has 125 places, 329 transitions, 3643 flow. Second operand 20 states and 1238 transitions.
[2024-03-11 22:01:17,662 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 530 transitions, 6484 flow
[2024-03-11 22:01:17,694 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 530 transitions, 6333 flow, removed 67 selfloop flow, removed 1 redundant places.
[2024-03-11 22:01:17,700 INFO  L231             Difference]: Finished difference. Result has 145 places, 385 transitions, 4963 flow
[2024-03-11 22:01:17,700 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=3520, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=206, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=4963, PETRI_PLACES=145, PETRI_TRANSITIONS=385}
[2024-03-11 22:01:17,701 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 86 predicate places.
[2024-03-11 22:01:17,701 INFO  L495      AbstractCegarLoop]: Abstraction has has 145 places, 385 transitions, 4963 flow
[2024-03-11 22:01:17,701 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 27 states, 27 states have (on average 52.074074074074076) internal successors, (1406), 27 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:17,702 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:01:17,702 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2024-03-11 22:01:17,709 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2024-03-11 22:01:17,902 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:01:17,903 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-11 22:01:17,903 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:01:17,903 INFO  L85        PathProgramCache]: Analyzing trace with hash 1060525551, now seen corresponding path program 1 times
[2024-03-11 22:01:17,904 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:01:17,904 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591312579]
[2024-03-11 22:01:17,904 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:01:17,905 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:01:17,942 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 22:01:17,942 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-11 22:01:17,954 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 22:01:17,972 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-11 22:01:17,972 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-11 22:01:17,973 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining)
[2024-03-11 22:01:17,974 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining)
[2024-03-11 22:01:17,975 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining)
[2024-03-11 22:01:17,975 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining)
[2024-03-11 22:01:17,975 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining)
[2024-03-11 22:01:17,975 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining)
[2024-03-11 22:01:17,975 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining)
[2024-03-11 22:01:17,975 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining)
[2024-03-11 22:01:17,975 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining)
[2024-03-11 22:01:17,975 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-03-11 22:01:17,975 INFO  L445         BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:01:17,977 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-11 22:01:17,977 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-11 22:01:17,991 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-03-11 22:01:17,992 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 139 places, 139 transitions, 296 flow
[2024-03-11 22:01:18,012 INFO  L130       PetriNetUnfolder]: 11/329 cut-off events.
[2024-03-11 22:01:18,012 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2024-03-11 22:01:18,013 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 343 conditions, 329 events. 11/329 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 726 event pairs, 0 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 188. Up to 8 conditions per place. 
[2024-03-11 22:01:18,013 INFO  L82        GeneralOperation]: Start removeDead. Operand has 139 places, 139 transitions, 296 flow
[2024-03-11 22:01:18,014 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 139 places, 139 transitions, 296 flow
[2024-03-11 22:01:18,014 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-11 22:01:18,014 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 139 transitions, 296 flow
[2024-03-11 22:01:18,014 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 139 transitions, 296 flow
[2024-03-11 22:01:18,014 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 139 places, 139 transitions, 296 flow
[2024-03-11 22:01:18,032 INFO  L130       PetriNetUnfolder]: 11/329 cut-off events.
[2024-03-11 22:01:18,032 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2024-03-11 22:01:18,033 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 343 conditions, 329 events. 11/329 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 726 event pairs, 0 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 188. Up to 8 conditions per place. 
[2024-03-11 22:01:18,036 INFO  L119        LiptonReduction]: Number of co-enabled transitions 5160
[2024-03-11 22:01:20,844 INFO  L134        LiptonReduction]: Checked pairs total: 24244
[2024-03-11 22:01:20,844 INFO  L136        LiptonReduction]: Total number of compositions: 76
[2024-03-11 22:01:20,845 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-11 22:01:20,845 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1fc14a02, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-11 22:01:20,845 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 10 error locations.
[2024-03-11 22:01:20,847 INFO  L130       PetriNetUnfolder]: 0/15 cut-off events.
[2024-03-11 22:01:20,847 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 22:01:20,847 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:01:20,847 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:01:20,847 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:01:20,847 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:01:20,847 INFO  L85        PathProgramCache]: Analyzing trace with hash 210590363, now seen corresponding path program 1 times
[2024-03-11 22:01:20,847 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:01:20,847 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407224727]
[2024-03-11 22:01:20,847 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:01:20,848 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:01:20,856 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:01:20,953 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:01:20,954 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:01:20,954 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407224727]
[2024-03-11 22:01:20,954 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407224727] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:01:20,954 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:01:20,954 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 22:01:20,954 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801797558]
[2024-03-11 22:01:20,954 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:01:20,954 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 22:01:20,954 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:01:20,955 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 22:01:20,955 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 22:01:21,175 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 109 out of 215
[2024-03-11 22:01:21,176 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 68 transitions, 154 flow. Second operand  has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:21,176 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:01:21,176 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 215
[2024-03-11 22:01:21,176 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:01:21,760 INFO  L130       PetriNetUnfolder]: 2976/6074 cut-off events.
[2024-03-11 22:01:21,761 INFO  L131       PetriNetUnfolder]: For 191/349 co-relation queries the response was YES.
[2024-03-11 22:01:21,765 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11160 conditions, 6074 events. 2976/6074 cut-off events. For 191/349 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 42004 event pairs, 888 based on Foata normal form. 0/5675 useless extension candidates. Maximal degree in co-relation 5347. Up to 3609 conditions per place. 
[2024-03-11 22:01:21,778 INFO  L137   encePairwiseOnDemand]: 195/215 looper letters, 71 selfloop transitions, 42 changer transitions 0/143 dead transitions.
[2024-03-11 22:01:21,779 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 143 transitions, 538 flow
[2024-03-11 22:01:21,779 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:01:21,779 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:01:21,780 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 769 transitions.
[2024-03-11 22:01:21,780 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5961240310077519
[2024-03-11 22:01:21,780 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 769 transitions.
[2024-03-11 22:01:21,780 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 769 transitions.
[2024-03-11 22:01:21,781 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:01:21,781 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 769 transitions.
[2024-03-11 22:01:21,782 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 128.16666666666666) internal successors, (769), 6 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:21,783 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:21,783 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:21,784 INFO  L175             Difference]: Start difference. First operand has 71 places, 68 transitions, 154 flow. Second operand 6 states and 769 transitions.
[2024-03-11 22:01:21,784 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 143 transitions, 538 flow
[2024-03-11 22:01:21,785 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 143 transitions, 538 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 22:01:21,786 INFO  L231             Difference]: Finished difference. Result has 81 places, 110 transitions, 446 flow
[2024-03-11 22:01:21,786 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=446, PETRI_PLACES=81, PETRI_TRANSITIONS=110}
[2024-03-11 22:01:21,786 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 10 predicate places.
[2024-03-11 22:01:21,787 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 110 transitions, 446 flow
[2024-03-11 22:01:21,787 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:21,787 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:01:21,787 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:01:21,787 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-03-11 22:01:21,787 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:01:21,787 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:01:21,787 INFO  L85        PathProgramCache]: Analyzing trace with hash -1935852613, now seen corresponding path program 1 times
[2024-03-11 22:01:21,788 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:01:21,788 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208572161]
[2024-03-11 22:01:21,788 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:01:21,788 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:01:21,795 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:01:21,816 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:01:21,817 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:01:21,817 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208572161]
[2024-03-11 22:01:21,817 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208572161] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:01:21,817 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:01:21,817 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-11 22:01:21,817 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563848007]
[2024-03-11 22:01:21,817 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:01:21,818 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-11 22:01:21,818 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:01:21,818 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-11 22:01:21,818 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-03-11 22:01:21,862 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 126 out of 215
[2024-03-11 22:01:21,863 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 110 transitions, 446 flow. Second operand  has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:21,863 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:01:21,863 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 215
[2024-03-11 22:01:21,863 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:01:22,199 INFO  L130       PetriNetUnfolder]: 1538/4155 cut-off events.
[2024-03-11 22:01:22,199 INFO  L131       PetriNetUnfolder]: For 1258/1352 co-relation queries the response was YES.
[2024-03-11 22:01:22,205 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8830 conditions, 4155 events. 1538/4155 cut-off events. For 1258/1352 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 32457 event pairs, 547 based on Foata normal form. 0/3828 useless extension candidates. Maximal degree in co-relation 3873. Up to 1451 conditions per place. 
[2024-03-11 22:01:22,215 INFO  L137   encePairwiseOnDemand]: 211/215 looper letters, 33 selfloop transitions, 3 changer transitions 3/122 dead transitions.
[2024-03-11 22:01:22,215 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 122 transitions, 558 flow
[2024-03-11 22:01:22,215 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-11 22:01:22,216 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-11 22:01:22,216 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 538 transitions.
[2024-03-11 22:01:22,216 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6255813953488372
[2024-03-11 22:01:22,216 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 538 transitions.
[2024-03-11 22:01:22,216 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 538 transitions.
[2024-03-11 22:01:22,216 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:01:22,216 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 538 transitions.
[2024-03-11 22:01:22,217 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 134.5) internal successors, (538), 4 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:22,218 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:22,218 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:22,218 INFO  L175             Difference]: Start difference. First operand has 81 places, 110 transitions, 446 flow. Second operand 4 states and 538 transitions.
[2024-03-11 22:01:22,218 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 122 transitions, 558 flow
[2024-03-11 22:01:22,222 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 122 transitions, 558 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 22:01:22,223 INFO  L231             Difference]: Finished difference. Result has 86 places, 112 transitions, 466 flow
[2024-03-11 22:01:22,223 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=466, PETRI_PLACES=86, PETRI_TRANSITIONS=112}
[2024-03-11 22:01:22,224 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 15 predicate places.
[2024-03-11 22:01:22,224 INFO  L495      AbstractCegarLoop]: Abstraction has has 86 places, 112 transitions, 466 flow
[2024-03-11 22:01:22,224 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:22,224 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:01:22,224 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:01:22,225 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-03-11 22:01:22,225 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:01:22,225 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:01:22,225 INFO  L85        PathProgramCache]: Analyzing trace with hash -1300331653, now seen corresponding path program 1 times
[2024-03-11 22:01:22,225 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:01:22,225 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437127604]
[2024-03-11 22:01:22,225 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:01:22,225 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:01:22,233 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:01:22,318 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:01:22,318 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:01:22,318 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437127604]
[2024-03-11 22:01:22,319 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437127604] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:01:22,319 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:01:22,319 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 22:01:22,319 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211653487]
[2024-03-11 22:01:22,319 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:01:22,319 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 22:01:22,319 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:01:22,320 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 22:01:22,320 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 22:01:22,573 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 215
[2024-03-11 22:01:22,574 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 112 transitions, 466 flow. Second operand  has 6 states, 6 states have (on average 104.33333333333333) internal successors, (626), 6 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:22,574 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:01:22,574 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 215
[2024-03-11 22:01:22,575 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:01:23,596 INFO  L130       PetriNetUnfolder]: 6417/12066 cut-off events.
[2024-03-11 22:01:23,597 INFO  L131       PetriNetUnfolder]: For 6139/6296 co-relation queries the response was YES.
[2024-03-11 22:01:23,610 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30858 conditions, 12066 events. 6417/12066 cut-off events. For 6139/6296 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 88039 event pairs, 1317 based on Foata normal form. 19/11725 useless extension candidates. Maximal degree in co-relation 30728. Up to 7055 conditions per place. 
[2024-03-11 22:01:23,639 INFO  L137   encePairwiseOnDemand]: 188/215 looper letters, 118 selfloop transitions, 104 changer transitions 1/254 dead transitions.
[2024-03-11 22:01:23,639 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 254 transitions, 1510 flow
[2024-03-11 22:01:23,640 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:01:23,640 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:01:23,640 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 751 transitions.
[2024-03-11 22:01:23,641 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5821705426356589
[2024-03-11 22:01:23,641 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 751 transitions.
[2024-03-11 22:01:23,641 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 751 transitions.
[2024-03-11 22:01:23,641 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:01:23,641 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 751 transitions.
[2024-03-11 22:01:23,643 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 125.16666666666667) internal successors, (751), 6 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:23,644 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:23,644 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:23,644 INFO  L175             Difference]: Start difference. First operand has 86 places, 112 transitions, 466 flow. Second operand 6 states and 751 transitions.
[2024-03-11 22:01:23,644 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 254 transitions, 1510 flow
[2024-03-11 22:01:23,651 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 254 transitions, 1507 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-11 22:01:23,653 INFO  L231             Difference]: Finished difference. Result has 95 places, 215 transitions, 1492 flow
[2024-03-11 22:01:23,654 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1492, PETRI_PLACES=95, PETRI_TRANSITIONS=215}
[2024-03-11 22:01:23,654 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 24 predicate places.
[2024-03-11 22:01:23,654 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 215 transitions, 1492 flow
[2024-03-11 22:01:23,654 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 104.33333333333333) internal successors, (626), 6 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:23,654 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:01:23,654 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:01:23,654 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-03-11 22:01:23,655 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:01:23,655 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:01:23,655 INFO  L85        PathProgramCache]: Analyzing trace with hash 920624824, now seen corresponding path program 1 times
[2024-03-11 22:01:23,655 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:01:23,655 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054921724]
[2024-03-11 22:01:23,655 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:01:23,655 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:01:23,666 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:01:23,799 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:01:23,800 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:01:23,800 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054921724]
[2024-03-11 22:01:23,800 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054921724] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:01:23,800 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:01:23,800 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 22:01:23,800 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955987730]
[2024-03-11 22:01:23,800 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:01:23,800 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 22:01:23,800 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:01:23,801 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 22:01:23,801 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 22:01:23,926 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 95 out of 215
[2024-03-11 22:01:23,927 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 215 transitions, 1492 flow. Second operand  has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:23,927 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:01:23,927 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 215
[2024-03-11 22:01:23,927 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:01:26,086 INFO  L130       PetriNetUnfolder]: 11069/19135 cut-off events.
[2024-03-11 22:01:26,087 INFO  L131       PetriNetUnfolder]: For 23652/23873 co-relation queries the response was YES.
[2024-03-11 22:01:26,118 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 64791 conditions, 19135 events. 11069/19135 cut-off events. For 23652/23873 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 135055 event pairs, 3510 based on Foata normal form. 0/18292 useless extension candidates. Maximal degree in co-relation 46355. Up to 15473 conditions per place. 
[2024-03-11 22:01:26,178 INFO  L137   encePairwiseOnDemand]: 181/215 looper letters, 246 selfloop transitions, 178 changer transitions 0/441 dead transitions.
[2024-03-11 22:01:26,178 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 441 transitions, 3416 flow
[2024-03-11 22:01:26,179 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:01:26,179 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:01:26,179 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 800 transitions.
[2024-03-11 22:01:26,180 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6201550387596899
[2024-03-11 22:01:26,180 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 800 transitions.
[2024-03-11 22:01:26,180 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 800 transitions.
[2024-03-11 22:01:26,180 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:01:26,180 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 800 transitions.
[2024-03-11 22:01:26,181 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 133.33333333333334) internal successors, (800), 6 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:26,182 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:26,183 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:26,183 INFO  L175             Difference]: Start difference. First operand has 95 places, 215 transitions, 1492 flow. Second operand 6 states and 800 transitions.
[2024-03-11 22:01:26,183 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 441 transitions, 3416 flow
[2024-03-11 22:01:26,204 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 441 transitions, 3406 flow, removed 5 selfloop flow, removed 1 redundant places.
[2024-03-11 22:01:26,208 INFO  L231             Difference]: Finished difference. Result has 102 places, 377 transitions, 2975 flow
[2024-03-11 22:01:26,209 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=1490, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2975, PETRI_PLACES=102, PETRI_TRANSITIONS=377}
[2024-03-11 22:01:26,209 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 31 predicate places.
[2024-03-11 22:01:26,209 INFO  L495      AbstractCegarLoop]: Abstraction has has 102 places, 377 transitions, 2975 flow
[2024-03-11 22:01:26,209 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:26,209 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:01:26,210 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:01:26,210 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-03-11 22:01:26,210 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:01:26,210 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:01:26,210 INFO  L85        PathProgramCache]: Analyzing trace with hash -68422601, now seen corresponding path program 1 times
[2024-03-11 22:01:26,210 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:01:26,211 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250392720]
[2024-03-11 22:01:26,211 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:01:26,211 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:01:26,228 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:01:26,569 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:01:26,569 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:01:26,569 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250392720]
[2024-03-11 22:01:26,570 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250392720] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:01:26,570 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666837239]
[2024-03-11 22:01:26,570 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:01:26,570 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:01:26,570 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:01:26,571 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:01:26,572 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-03-11 22:01:26,731 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:01:26,733 INFO  L263         TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 24 conjunts are in the unsatisfiable core
[2024-03-11 22:01:26,737 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:01:26,760 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2024-03-11 22:01:26,833 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-11 22:01:26,856 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-11 22:01:26,892 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:01:26,892 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2024-03-11 22:01:26,932 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:01:26,933 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2024-03-11 22:01:26,980 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:01:26,981 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:01:26,992 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:01:26,992 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:01:27,012 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1147 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1147) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1147 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1147) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1147 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1147) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1147 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1147) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2024-03-11 22:01:27,033 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1147 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1147) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1147 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1147) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1147 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1147) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1147 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1147) c_threadThread1of2ForFork0_~p~0.base) .cse1)))))) is different from false
[2024-03-11 22:01:27,058 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1147 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1147) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1147 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1147) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1147 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1147) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1147 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1147) c_threadThread1of2ForFork0_~p~0.base) .cse2)))))) is different from false
[2024-03-11 22:01:27,168 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-03-11 22:01:27,168 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666837239] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:01:27,168 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:01:27,169 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24
[2024-03-11 22:01:27,169 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857302608]
[2024-03-11 22:01:27,169 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:01:27,169 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2024-03-11 22:01:27,169 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:01:27,170 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2024-03-11 22:01:27,170 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=418, Unknown=3, NotChecked=132, Total=650
[2024-03-11 22:01:27,213 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 65 out of 215
[2024-03-11 22:01:27,214 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 377 transitions, 2975 flow. Second operand  has 26 states, 26 states have (on average 67.76923076923077) internal successors, (1762), 26 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:27,215 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:01:27,215 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 215
[2024-03-11 22:01:27,215 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:01:34,264 INFO  L130       PetriNetUnfolder]: 18221/29760 cut-off events.
[2024-03-11 22:01:34,264 INFO  L131       PetriNetUnfolder]: For 58936/58936 co-relation queries the response was YES.
[2024-03-11 22:01:34,336 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 121444 conditions, 29760 events. 18221/29760 cut-off events. For 58936/58936 co-relation queries the response was YES. Maximal size of possible extension queue 780. Compared 210388 event pairs, 2334 based on Foata normal form. 0/27092 useless extension candidates. Maximal degree in co-relation 101495. Up to 20221 conditions per place. 
[2024-03-11 22:01:34,449 INFO  L137   encePairwiseOnDemand]: 151/215 looper letters, 551 selfloop transitions, 578 changer transitions 1/1133 dead transitions.
[2024-03-11 22:01:34,449 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 1133 transitions, 10097 flow
[2024-03-11 22:01:34,450 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2024-03-11 22:01:34,450 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2024-03-11 22:01:34,452 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1927 transitions.
[2024-03-11 22:01:34,452 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4267995570321152
[2024-03-11 22:01:34,453 INFO  L72            ComplementDD]: Start complementDD. Operand 21 states and 1927 transitions.
[2024-03-11 22:01:34,453 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 21 states and 1927 transitions.
[2024-03-11 22:01:34,453 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:01:34,453 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1927 transitions.
[2024-03-11 22:01:34,455 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 22 states, 21 states have (on average 91.76190476190476) internal successors, (1927), 21 states have internal predecessors, (1927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:34,459 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 22 states, 22 states have (on average 215.0) internal successors, (4730), 22 states have internal predecessors, (4730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:34,460 INFO  L81            ComplementDD]: Finished complementDD. Result  has 22 states, 22 states have (on average 215.0) internal successors, (4730), 22 states have internal predecessors, (4730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:34,460 INFO  L175             Difference]: Start difference. First operand has 102 places, 377 transitions, 2975 flow. Second operand 21 states and 1927 transitions.
[2024-03-11 22:01:34,460 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 1133 transitions, 10097 flow
[2024-03-11 22:01:35,494 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 1133 transitions, 9887 flow, removed 105 selfloop flow, removed 0 redundant places.
[2024-03-11 22:01:35,504 INFO  L231             Difference]: Finished difference. Result has 133 places, 866 transitions, 9097 flow
[2024-03-11 22:01:35,505 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=2855, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=187, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=9097, PETRI_PLACES=133, PETRI_TRANSITIONS=866}
[2024-03-11 22:01:35,505 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 62 predicate places.
[2024-03-11 22:01:35,505 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 866 transitions, 9097 flow
[2024-03-11 22:01:35,506 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 67.76923076923077) internal successors, (1762), 26 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:35,506 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:01:35,506 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:01:35,513 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2024-03-11 22:01:35,706 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2024-03-11 22:01:35,707 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:01:35,707 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:01:35,708 INFO  L85        PathProgramCache]: Analyzing trace with hash 1920249954, now seen corresponding path program 1 times
[2024-03-11 22:01:35,708 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:01:35,708 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325274733]
[2024-03-11 22:01:35,709 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:01:35,709 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:01:35,734 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:01:36,075 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:01:36,075 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:01:36,075 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325274733]
[2024-03-11 22:01:36,076 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325274733] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:01:36,076 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605828692]
[2024-03-11 22:01:36,076 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:01:36,076 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:01:36,076 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:01:36,077 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:01:36,079 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2024-03-11 22:01:36,237 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:01:36,239 INFO  L263         TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 26 conjunts are in the unsatisfiable core
[2024-03-11 22:01:36,242 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:01:36,265 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2024-03-11 22:01:36,345 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-11 22:01:36,369 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:01:36,370 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-11 22:01:36,410 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:01:36,411 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:01:36,411 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-03-11 22:01:36,442 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:01:36,443 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:01:36,443 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:01:36,444 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-03-11 22:01:36,522 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:01:36,523 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:01:36,562 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:01:36,562 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:01:36,578 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1260 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1260) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)) (forall ((v_ArrVal_1260 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1260) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1260 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1260) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1260 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1260) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3)) 0))) is different from false
[2024-03-11 22:01:37,116 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1 0) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3) 0)))) (and (forall ((v_threadThread1of2ForFork0_~p~0.base_33 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_33) (forall ((v_ArrVal_1260 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_33 v_ArrVal_1260) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_33 Int)) (or (forall ((v_ArrVal_1260 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_33 v_ArrVal_1260) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_33))) (forall ((v_threadThread1of2ForFork0_~p~0.base_33 Int)) (or (forall ((v_ArrVal_1260 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_33 v_ArrVal_1260) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_33)))))) is different from false
[2024-03-11 22:01:37,148 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) (.cse1 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse2 0) .cse1 0) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3) 0)))) (and (forall ((v_threadThread1of2ForFork0_~p~0.base_33 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_33) (forall ((v_ArrVal_1260 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_33 v_ArrVal_1260) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_33 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_33) (forall ((v_ArrVal_1260 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_33 v_ArrVal_1260) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_33 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_33) (forall ((v_ArrVal_1260 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_33 v_ArrVal_1260) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse2) 0))))))) is different from false
[2024-03-11 22:01:37,174 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:01:37,175 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 51
[2024-03-11 22:01:37,182 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:01:37,182 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 36
[2024-03-11 22:01:37,191 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-03-11 22:01:37,221 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:01:37,221 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2024-03-11 22:01:37,228 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:01:37,228 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 1
[2024-03-11 22:01:37,311 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2024-03-11 22:01:37,311 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605828692] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:01:37,311 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:01:37,311 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27
[2024-03-11 22:01:37,312 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676124972]
[2024-03-11 22:01:37,312 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:01:37,312 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2024-03-11 22:01:37,312 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:01:37,313 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2024-03-11 22:01:37,313 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=523, Unknown=12, NotChecked=150, Total=812
[2024-03-11 22:01:37,506 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 67 out of 215
[2024-03-11 22:01:37,507 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 866 transitions, 9097 flow. Second operand  has 29 states, 29 states have (on average 69.55172413793103) internal successors, (2017), 29 states have internal predecessors, (2017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:37,507 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:01:37,507 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 215
[2024-03-11 22:01:37,507 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:01:45,341 INFO  L130       PetriNetUnfolder]: 20396/33826 cut-off events.
[2024-03-11 22:01:45,341 INFO  L131       PetriNetUnfolder]: For 147224/147232 co-relation queries the response was YES.
[2024-03-11 22:01:45,474 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 193023 conditions, 33826 events. 20396/33826 cut-off events. For 147224/147232 co-relation queries the response was YES. Maximal size of possible extension queue 869. Compared 244707 event pairs, 2691 based on Foata normal form. 170/32180 useless extension candidates. Maximal degree in co-relation 176576. Up to 19393 conditions per place. 
[2024-03-11 22:01:45,616 INFO  L137   encePairwiseOnDemand]: 189/215 looper letters, 1008 selfloop transitions, 462 changer transitions 0/1473 dead transitions.
[2024-03-11 22:01:45,616 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 1473 transitions, 17811 flow
[2024-03-11 22:01:45,617 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2024-03-11 22:01:45,617 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2024-03-11 22:01:45,617 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1261 transitions.
[2024-03-11 22:01:45,618 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3910077519379845
[2024-03-11 22:01:45,618 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 1261 transitions.
[2024-03-11 22:01:45,618 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 1261 transitions.
[2024-03-11 22:01:45,618 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:01:45,618 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1261 transitions.
[2024-03-11 22:01:45,620 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 16 states, 15 states have (on average 84.06666666666666) internal successors, (1261), 15 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:45,622 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 16 states, 16 states have (on average 215.0) internal successors, (3440), 16 states have internal predecessors, (3440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:45,622 INFO  L81            ComplementDD]: Finished complementDD. Result  has 16 states, 16 states have (on average 215.0) internal successors, (3440), 16 states have internal predecessors, (3440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:45,622 INFO  L175             Difference]: Start difference. First operand has 133 places, 866 transitions, 9097 flow. Second operand 15 states and 1261 transitions.
[2024-03-11 22:01:45,622 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 1473 transitions, 17811 flow
[2024-03-11 22:01:48,271 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 1473 transitions, 17468 flow, removed 170 selfloop flow, removed 1 redundant places.
[2024-03-11 22:01:48,287 INFO  L231             Difference]: Finished difference. Result has 153 places, 1049 transitions, 13049 flow
[2024-03-11 22:01:48,287 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=8867, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=866, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=279, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=450, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=13049, PETRI_PLACES=153, PETRI_TRANSITIONS=1049}
[2024-03-11 22:01:48,288 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 82 predicate places.
[2024-03-11 22:01:48,288 INFO  L495      AbstractCegarLoop]: Abstraction has has 153 places, 1049 transitions, 13049 flow
[2024-03-11 22:01:48,288 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 29 states, 29 states have (on average 69.55172413793103) internal successors, (2017), 29 states have internal predecessors, (2017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:48,288 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:01:48,288 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:01:48,293 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2024-03-11 22:01:48,493 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2024-03-11 22:01:48,494 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:01:48,494 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:01:48,494 INFO  L85        PathProgramCache]: Analyzing trace with hash -1856484391, now seen corresponding path program 1 times
[2024-03-11 22:01:48,495 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:01:48,495 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276738022]
[2024-03-11 22:01:48,495 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:01:48,495 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:01:48,512 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:01:48,749 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:01:48,749 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:01:48,749 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276738022]
[2024-03-11 22:01:48,749 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276738022] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:01:48,749 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493602858]
[2024-03-11 22:01:48,749 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:01:48,750 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:01:48,750 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:01:48,751 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:01:48,753 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2024-03-11 22:01:48,870 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:01:48,871 INFO  L263         TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 24 conjunts are in the unsatisfiable core
[2024-03-11 22:01:48,875 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:01:48,895 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2024-03-11 22:01:48,952 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-11 22:01:48,987 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-11 22:01:49,030 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:01:49,030 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2024-03-11 22:01:49,074 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:01:49,074 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2024-03-11 22:01:49,116 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:01:49,116 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:01:49,125 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:01:49,126 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:01:49,146 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1373 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1373) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1373 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1373) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1373 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1373) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1373 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1373) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) is different from false
[2024-03-11 22:01:49,253 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1373 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1373) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1373 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1373) c_threadThread1of2ForFork0_~p~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1373 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1373) c_threadThread1of2ForFork0_~p~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1373 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1373) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2024-03-11 22:01:49,368 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:01:49,368 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [493602858] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:01:49,368 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:01:49,368 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24
[2024-03-11 22:01:49,368 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327758110]
[2024-03-11 22:01:49,368 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:01:49,369 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2024-03-11 22:01:49,369 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:01:49,369 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2024-03-11 22:01:49,369 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=450, Unknown=8, NotChecked=90, Total=650
[2024-03-11 22:01:49,533 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 62 out of 215
[2024-03-11 22:01:49,534 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 1049 transitions, 13049 flow. Second operand  has 26 states, 26 states have (on average 64.73076923076923) internal successors, (1683), 26 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:01:49,534 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:01:49,534 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 215
[2024-03-11 22:01:49,534 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:02:00,464 INFO  L130       PetriNetUnfolder]: 23866/39315 cut-off events.
[2024-03-11 22:02:00,464 INFO  L131       PetriNetUnfolder]: For 220242/220242 co-relation queries the response was YES.
[2024-03-11 22:02:00,655 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 234886 conditions, 39315 events. 23866/39315 cut-off events. For 220242/220242 co-relation queries the response was YES. Maximal size of possible extension queue 1023. Compared 290825 event pairs, 3071 based on Foata normal form. 802/38082 useless extension candidates. Maximal degree in co-relation 219396. Up to 25583 conditions per place. 
[2024-03-11 22:02:00,819 INFO  L137   encePairwiseOnDemand]: 151/215 looper letters, 1047 selfloop transitions, 761 changer transitions 1/1812 dead transitions.
[2024-03-11 22:02:00,819 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 1812 transitions, 24503 flow
[2024-03-11 22:02:00,820 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2024-03-11 22:02:00,820 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2024-03-11 22:02:00,821 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1627 transitions.
[2024-03-11 22:02:00,821 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.39828641370869033
[2024-03-11 22:02:00,821 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1627 transitions.
[2024-03-11 22:02:00,822 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1627 transitions.
[2024-03-11 22:02:00,822 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:02:00,822 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1627 transitions.
[2024-03-11 22:02:00,825 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 85.63157894736842) internal successors, (1627), 19 states have internal predecessors, (1627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:02:00,827 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 215.0) internal successors, (4300), 20 states have internal predecessors, (4300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:02:00,828 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 215.0) internal successors, (4300), 20 states have internal predecessors, (4300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:02:00,828 INFO  L175             Difference]: Start difference. First operand has 153 places, 1049 transitions, 13049 flow. Second operand 19 states and 1627 transitions.
[2024-03-11 22:02:00,828 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 1812 transitions, 24503 flow
[2024-03-11 22:02:04,128 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 1812 transitions, 24440 flow, removed 0 selfloop flow, removed 4 redundant places.
[2024-03-11 22:02:04,149 INFO  L231             Difference]: Finished difference. Result has 172 places, 1501 transitions, 21055 flow
[2024-03-11 22:02:04,149 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=13002, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1049, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=405, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=21055, PETRI_PLACES=172, PETRI_TRANSITIONS=1501}
[2024-03-11 22:02:04,151 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 101 predicate places.
[2024-03-11 22:02:04,151 INFO  L495      AbstractCegarLoop]: Abstraction has has 172 places, 1501 transitions, 21055 flow
[2024-03-11 22:02:04,152 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 64.73076923076923) internal successors, (1683), 26 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:02:04,152 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:02:04,152 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:02:04,159 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2024-03-11 22:02:04,353 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:02:04,354 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:02:04,354 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:02:04,355 INFO  L85        PathProgramCache]: Analyzing trace with hash 9526478, now seen corresponding path program 1 times
[2024-03-11 22:02:04,355 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:02:04,356 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861442910]
[2024-03-11 22:02:04,356 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:02:04,356 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:02:04,375 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:02:04,622 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:02:04,622 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:02:04,622 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861442910]
[2024-03-11 22:02:04,623 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861442910] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:02:04,623 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186063380]
[2024-03-11 22:02:04,623 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:02:04,623 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:02:04,623 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:02:04,624 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:02:04,630 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2024-03-11 22:02:04,755 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:02:04,757 INFO  L263         TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 26 conjunts are in the unsatisfiable core
[2024-03-11 22:02:04,759 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:02:04,785 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2024-03-11 22:02:04,868 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-11 22:02:04,895 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:02:04,896 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-11 22:02:04,926 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:02:04,927 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:02:04,928 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-03-11 22:02:04,965 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:02:04,966 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:02:04,967 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:02:04,968 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-03-11 22:02:05,058 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:02:05,058 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:02:05,085 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:02:05,085 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:02:05,104 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1486 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1486) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_1486 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1486) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_1486 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1486) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1486 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1486) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))) is different from false
[2024-03-11 22:02:05,345 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0)))) (and (forall ((v_threadThread1of2ForFork0_~p~0.base_37 Int)) (or (forall ((v_ArrVal_1486 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_37 v_ArrVal_1486) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_37))) (forall ((v_threadThread1of2ForFork0_~p~0.base_37 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_37) (forall ((v_ArrVal_1486 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_37 v_ArrVal_1486) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_37 Int)) (or (forall ((v_ArrVal_1486 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_37 v_ArrVal_1486) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_37))) (forall ((v_threadThread1of2ForFork0_~p~0.base_37 Int)) (or (forall ((v_ArrVal_1486 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_37 v_ArrVal_1486) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_37)))))) is different from false
[2024-03-11 22:02:05,389 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_threadThread1of2ForFork0_~p~0.base_37 Int)) (or (forall ((v_ArrVal_1486 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_37 v_ArrVal_1486) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_37))) (forall ((v_threadThread1of2ForFork0_~p~0.base_37 Int)) (or (forall ((v_ArrVal_1486 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_37 v_ArrVal_1486) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_37))) (forall ((v_threadThread1of2ForFork0_~p~0.base_37 Int)) (or (forall ((v_ArrVal_1486 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_37 v_ArrVal_1486) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_37))) (forall ((v_threadThread1of2ForFork0_~p~0.base_37 Int)) (or (forall ((v_ArrVal_1486 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_37 v_ArrVal_1486) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_37)))))) is different from false
[2024-03-11 22:02:05,423 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) (.cse2 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) .cse2 0) .cse3 0)))) (and (forall ((v_threadThread1of2ForFork0_~p~0.base_37 Int)) (or (forall ((v_ArrVal_1486 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_37 v_ArrVal_1486) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_37))) (forall ((v_threadThread1of2ForFork0_~p~0.base_37 Int)) (or (forall ((v_ArrVal_1486 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_37 v_ArrVal_1486) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_37))) (forall ((v_threadThread1of2ForFork0_~p~0.base_37 Int)) (or (forall ((v_ArrVal_1486 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_37 v_ArrVal_1486) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_37))) (forall ((v_threadThread1of2ForFork0_~p~0.base_37 Int)) (or (forall ((v_ArrVal_1486 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_37 v_ArrVal_1486) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse3) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_37)))))) is different from false
[2024-03-11 22:02:05,446 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:02:05,446 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 51
[2024-03-11 22:02:05,450 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:02:05,450 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 36
[2024-03-11 22:02:05,453 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-03-11 22:02:05,460 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:02:05,461 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 1
[2024-03-11 22:02:05,466 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:02:05,466 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2024-03-11 22:02:05,472 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:02:05,472 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2024-03-11 22:02:05,541 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:02:05,542 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186063380] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:02:05,542 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:02:05,542 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27
[2024-03-11 22:02:05,542 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770640386]
[2024-03-11 22:02:05,543 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:02:05,543 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2024-03-11 22:02:05,543 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:02:05,544 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2024-03-11 22:02:05,545 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=484, Unknown=13, NotChecked=196, Total=812
[2024-03-11 22:02:05,753 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 64 out of 215
[2024-03-11 22:02:05,754 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 1501 transitions, 21055 flow. Second operand  has 29 states, 29 states have (on average 66.65517241379311) internal successors, (1933), 29 states have internal predecessors, (1933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:02:05,754 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:02:05,754 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 215
[2024-03-11 22:02:05,755 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:02:19,862 INFO  L130       PetriNetUnfolder]: 27746/46340 cut-off events.
[2024-03-11 22:02:19,863 INFO  L131       PetriNetUnfolder]: For 372782/372798 co-relation queries the response was YES.
[2024-03-11 22:02:20,101 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 324891 conditions, 46340 events. 27746/46340 cut-off events. For 372782/372798 co-relation queries the response was YES. Maximal size of possible extension queue 1193. Compared 354135 event pairs, 3135 based on Foata normal form. 313/44073 useless extension candidates. Maximal degree in co-relation 304119. Up to 23393 conditions per place. 
[2024-03-11 22:02:20,433 INFO  L137   encePairwiseOnDemand]: 182/215 looper letters, 1403 selfloop transitions, 965 changer transitions 0/2371 dead transitions.
[2024-03-11 22:02:20,433 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 2371 transitions, 36930 flow
[2024-03-11 22:02:20,434 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2024-03-11 22:02:20,434 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2024-03-11 22:02:20,435 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1222 transitions.
[2024-03-11 22:02:20,436 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3789147286821705
[2024-03-11 22:02:20,436 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 1222 transitions.
[2024-03-11 22:02:20,436 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 1222 transitions.
[2024-03-11 22:02:20,437 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:02:20,437 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1222 transitions.
[2024-03-11 22:02:20,438 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 16 states, 15 states have (on average 81.46666666666667) internal successors, (1222), 15 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:02:20,440 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 16 states, 16 states have (on average 215.0) internal successors, (3440), 16 states have internal predecessors, (3440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:02:20,441 INFO  L81            ComplementDD]: Finished complementDD. Result  has 16 states, 16 states have (on average 215.0) internal successors, (3440), 16 states have internal predecessors, (3440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:02:20,441 INFO  L175             Difference]: Start difference. First operand has 172 places, 1501 transitions, 21055 flow. Second operand 15 states and 1222 transitions.
[2024-03-11 22:02:20,441 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 2371 transitions, 36930 flow
[2024-03-11 22:02:26,391 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 2371 transitions, 36491 flow, removed 165 selfloop flow, removed 9 redundant places.
[2024-03-11 22:02:26,422 INFO  L231             Difference]: Finished difference. Result has 184 places, 1904 transitions, 31212 flow
[2024-03-11 22:02:26,423 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=20774, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=562, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=674, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=31212, PETRI_PLACES=184, PETRI_TRANSITIONS=1904}
[2024-03-11 22:02:26,424 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 113 predicate places.
[2024-03-11 22:02:26,424 INFO  L495      AbstractCegarLoop]: Abstraction has has 184 places, 1904 transitions, 31212 flow
[2024-03-11 22:02:26,424 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 29 states, 29 states have (on average 66.65517241379311) internal successors, (1933), 29 states have internal predecessors, (1933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:02:26,424 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:02:26,424 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:02:26,431 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0
[2024-03-11 22:02:26,626 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:02:26,626 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:02:26,627 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:02:26,627 INFO  L85        PathProgramCache]: Analyzing trace with hash 260399055, now seen corresponding path program 1 times
[2024-03-11 22:02:26,627 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:02:26,627 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399384906]
[2024-03-11 22:02:26,628 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:02:26,628 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:02:26,648 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:02:26,787 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-11 22:02:26,787 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:02:26,787 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399384906]
[2024-03-11 22:02:26,787 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399384906] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:02:26,788 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:02:26,788 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 22:02:26,788 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497590317]
[2024-03-11 22:02:26,788 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:02:26,788 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 22:02:26,789 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:02:26,789 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 22:02:26,789 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 22:02:27,126 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 113 out of 215
[2024-03-11 22:02:27,127 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 1904 transitions, 31212 flow. Second operand  has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:02:27,127 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:02:27,127 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 215
[2024-03-11 22:02:27,127 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:02:38,404 INFO  L130       PetriNetUnfolder]: 23980/42509 cut-off events.
[2024-03-11 22:02:38,404 INFO  L131       PetriNetUnfolder]: For 484443/491773 co-relation queries the response was YES.
[2024-03-11 22:02:38,823 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 308328 conditions, 42509 events. 23980/42509 cut-off events. For 484443/491773 co-relation queries the response was YES. Maximal size of possible extension queue 1266. Compared 353052 event pairs, 4005 based on Foata normal form. 1047/42393 useless extension candidates. Maximal degree in co-relation 293030. Up to 27334 conditions per place. 
[2024-03-11 22:02:39,013 INFO  L137   encePairwiseOnDemand]: 200/215 looper letters, 1484 selfloop transitions, 207 changer transitions 0/2119 dead transitions.
[2024-03-11 22:02:39,013 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 2119 transitions, 38113 flow
[2024-03-11 22:02:39,014 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:02:39,014 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:02:39,014 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 769 transitions.
[2024-03-11 22:02:39,015 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5961240310077519
[2024-03-11 22:02:39,015 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 769 transitions.
[2024-03-11 22:02:39,015 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 769 transitions.
[2024-03-11 22:02:39,015 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:02:39,015 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 769 transitions.
[2024-03-11 22:02:39,016 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 128.16666666666666) internal successors, (769), 6 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:02:39,017 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:02:39,017 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:02:39,018 INFO  L175             Difference]: Start difference. First operand has 184 places, 1904 transitions, 31212 flow. Second operand 6 states and 769 transitions.
[2024-03-11 22:02:39,018 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 2119 transitions, 38113 flow
[2024-03-11 22:02:44,871 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 2119 transitions, 38003 flow, removed 0 selfloop flow, removed 7 redundant places.
[2024-03-11 22:02:44,903 INFO  L231             Difference]: Finished difference. Result has 187 places, 2092 transitions, 35302 flow
[2024-03-11 22:02:44,904 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=31102, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1904, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1811, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=35302, PETRI_PLACES=187, PETRI_TRANSITIONS=2092}
[2024-03-11 22:02:44,905 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 116 predicate places.
[2024-03-11 22:02:44,905 INFO  L495      AbstractCegarLoop]: Abstraction has has 187 places, 2092 transitions, 35302 flow
[2024-03-11 22:02:44,905 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:02:44,905 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:02:44,906 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:02:44,906 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-03-11 22:02:44,906 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:02:44,906 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:02:44,906 INFO  L85        PathProgramCache]: Analyzing trace with hash -1937325985, now seen corresponding path program 2 times
[2024-03-11 22:02:44,906 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:02:44,907 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464162046]
[2024-03-11 22:02:44,907 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:02:44,907 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:02:44,927 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:02:45,304 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:02:45,304 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:02:45,304 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464162046]
[2024-03-11 22:02:45,305 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464162046] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:02:45,305 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730142329]
[2024-03-11 22:02:45,305 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-11 22:02:45,305 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:02:45,305 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:02:45,306 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:02:45,308 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2024-03-11 22:02:45,498 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-11 22:02:45,498 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-11 22:02:45,500 INFO  L263         TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 57 conjunts are in the unsatisfiable core
[2024-03-11 22:02:45,505 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:02:45,528 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:02:45,530 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:02:45,532 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32
[2024-03-11 22:02:45,582 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-11 22:02:45,583 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 22
[2024-03-11 22:02:45,596 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7
[2024-03-11 22:02:45,882 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-11 22:02:45,939 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:02:45,940 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-11 22:02:46,007 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:02:46,008 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:02:46,009 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-03-11 22:02:46,073 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:02:46,074 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:02:46,075 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:02:46,075 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-03-11 22:02:46,146 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:02:46,147 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:02:46,181 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:02:46,181 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:02:46,208 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:02:46,209 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:02:46,243 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:02:46,245 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:02:46,246 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:02:46,248 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:02:46,248 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56
[2024-03-11 22:02:46,452 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:02:46,453 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:02:46,454 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:02:46,455 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:02:46,456 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:02:46,457 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 15 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 94
[2024-03-11 22:02:46,511 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:02:46,511 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:02:46,828 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:02:46,828 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 154 treesize of output 134
[2024-03-11 22:02:46,898 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3)) (.cse1 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) (.cse3 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1))) (and (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse0) 0)) (not (= (select v_arrayElimArr_13 .cse1) 0)) (forall ((v_prenex_1 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_arrayElimArr_13))) (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset| v_prenex_1))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (not (= (select v_arrayElimArr_13 .cse3) 0)) (not (= (select v_arrayElimArr_13 |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)))) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse0) 0)) (not (= (select v_arrayElimArr_13 .cse1) 0)) (forall ((v_prenex_3 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_arrayElimArr_13))) (store .cse4 |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset| v_prenex_3))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (not (= (select v_arrayElimArr_13 .cse3) 0)) (not (= (select v_arrayElimArr_13 |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)))) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse0) 0)) (not (= (select v_arrayElimArr_13 .cse1) 0)) (not (= (select v_arrayElimArr_13 .cse3) 0)) (not (= (select v_arrayElimArr_13 |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)) (forall ((v_ArrVal_1676 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_arrayElimArr_13))) (store .cse5 |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset| v_ArrVal_1676))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)))) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse0) 0)) (not (= (select v_arrayElimArr_13 .cse1) 0)) (forall ((v_prenex_2 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_arrayElimArr_13))) (store .cse6 |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset| v_prenex_2))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (not (= (select v_arrayElimArr_13 .cse3) 0)) (not (= (select v_arrayElimArr_13 |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)))))) is different from false
[2024-03-11 22:02:47,063 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse7 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse3 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse7 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse0 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3)) (.cse1 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) (.cse4 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1))) (and (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse0) 0)) (not (= (select v_arrayElimArr_13 .cse1) 0)) (forall ((v_prenex_1 Int)) (= (select (select (let ((.cse2 (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_arrayElimArr_13))) (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset| v_prenex_1))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (not (= (select v_arrayElimArr_13 .cse4) 0)) (not (= (select v_arrayElimArr_13 |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)))) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse0) 0)) (forall ((v_prenex_2 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_arrayElimArr_13))) (store .cse5 |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset| v_prenex_2))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (not (= (select v_arrayElimArr_13 .cse1) 0)) (not (= (select v_arrayElimArr_13 .cse4) 0)) (not (= (select v_arrayElimArr_13 |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)))) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse0) 0)) (not (= (select v_arrayElimArr_13 .cse1) 0)) (forall ((v_ArrVal_1676 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_arrayElimArr_13))) (store .cse6 |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset| v_ArrVal_1676))) c_threadThread1of2ForFork0_~p~0.base) .cse7))) (not (= (select v_arrayElimArr_13 .cse4) 0)) (not (= (select v_arrayElimArr_13 |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)))) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (forall ((v_prenex_3 Int)) (= (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_arrayElimArr_13))) (store .cse8 |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset| v_prenex_3))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (not (= (select v_arrayElimArr_13 .cse0) 0)) (not (= (select v_arrayElimArr_13 .cse1) 0)) (not (= (select v_arrayElimArr_13 .cse4) 0)) (not (= (select v_arrayElimArr_13 |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0))))))) is different from false
[2024-03-11 22:02:47,135 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse8 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse6 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3)) (.cse1 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse8 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse4 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1))) (and (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse0) 0)) (not (= (select v_arrayElimArr_13 .cse1) 0)) (forall ((v_prenex_2 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_arrayElimArr_13))) (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset| v_prenex_2))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (not (= (select v_arrayElimArr_13 .cse4) 0)) (not (= (select v_arrayElimArr_13 |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)))) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse0) 0)) (not (= (select v_arrayElimArr_13 .cse1) 0)) (forall ((v_ArrVal_1676 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_arrayElimArr_13))) (store .cse5 |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset| v_ArrVal_1676))) c_threadThread1of2ForFork0_~p~0.base) .cse6))) (not (= (select v_arrayElimArr_13 .cse4) 0)) (not (= (select v_arrayElimArr_13 |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)))) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse0) 0)) (not (= (select v_arrayElimArr_13 .cse1) 0)) (forall ((v_prenex_3 Int)) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_arrayElimArr_13))) (store .cse7 |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset| v_prenex_3))) c_threadThread1of2ForFork0_~p~0.base) .cse8) |c_threadThread1of2ForFork0_#t~nondet4|)) (not (= (select v_arrayElimArr_13 .cse4) 0)) (not (= (select v_arrayElimArr_13 |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)))) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse0) 0)) (not (= (select v_arrayElimArr_13 .cse1) 0)) (forall ((v_prenex_1 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse9 (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_arrayElimArr_13))) (store .cse9 |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset| v_prenex_1))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (not (= (select v_arrayElimArr_13 .cse4) 0)) (not (= (select v_arrayElimArr_13 |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0))))))) is different from false
[2024-03-11 22:02:47,227 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse5 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse7 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3)) (.cse1 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) (.cse4 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse9 |c_threadThread1of2ForFork0_#t~nondet4|) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse7 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse2 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1))) (and (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse0) 0)) (not (= (select v_arrayElimArr_13 .cse1) 0)) (not (= (select v_arrayElimArr_13 .cse2) 0)) (not (= (select v_arrayElimArr_13 |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)) (forall ((v_prenex_3 Int)) (= (select (select (let ((.cse3 (store .cse4 |c_ULTIMATE.start_main_~#datas~0#1.base| v_arrayElimArr_13))) (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset| v_prenex_3))) c_threadThread1of2ForFork0_~p~0.base) .cse5) |c_threadThread1of2ForFork0_#t~nondet4|)))) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse0) 0)) (not (= (select v_arrayElimArr_13 .cse1) 0)) (forall ((v_ArrVal_1676 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store .cse4 |c_ULTIMATE.start_main_~#datas~0#1.base| v_arrayElimArr_13))) (store .cse6 |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset| v_ArrVal_1676))) c_threadThread1of2ForFork0_~p~0.base) .cse7))) (not (= (select v_arrayElimArr_13 .cse2) 0)) (not (= (select v_arrayElimArr_13 |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)))) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse0) 0)) (not (= (select v_arrayElimArr_13 .cse1) 0)) (forall ((v_prenex_1 Int)) (= (select (select (let ((.cse8 (store .cse4 |c_ULTIMATE.start_main_~#datas~0#1.base| v_arrayElimArr_13))) (store .cse8 |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset| v_prenex_1))) c_threadThread1of2ForFork0_~p~0.base) .cse9) |c_threadThread1of2ForFork0_#t~nondet4|)) (not (= (select v_arrayElimArr_13 .cse2) 0)) (not (= (select v_arrayElimArr_13 |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)))) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse0) 0)) (not (= (select v_arrayElimArr_13 .cse1) 0)) (forall ((v_prenex_2 Int)) (= (select (select (let ((.cse10 (store .cse4 |c_ULTIMATE.start_main_~#datas~0#1.base| v_arrayElimArr_13))) (store .cse10 |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset| v_prenex_2))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (not (= (select v_arrayElimArr_13 .cse2) 0)) (not (= (select v_arrayElimArr_13 |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0))))))) is different from false
[2024-03-11 22:02:47,348 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:02:47,349 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 69 treesize of output 62
[2024-03-11 22:02:47,366 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:02:47,366 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 208 treesize of output 188
[2024-03-11 22:02:47,396 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:02:47,396 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 203 treesize of output 211
[2024-03-11 22:02:47,416 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 87
[2024-03-11 22:02:47,753 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:02:47,754 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 408 treesize of output 322
[2024-03-11 22:02:47,841 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:02:47,841 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 67 treesize of output 60
[2024-03-11 22:02:47,847 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-11 22:02:47,861 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-11 22:02:47,861 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 82
[2024-03-11 22:02:47,893 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:02:47,893 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 61 treesize of output 83
[2024-03-11 22:02:47,909 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 58
[2024-03-11 22:02:47,963 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:02:47,963 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 69 treesize of output 62
[2024-03-11 22:02:47,970 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-11 22:02:47,980 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-11 22:02:47,980 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 118
[2024-03-11 22:02:48,004 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:02:48,005 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 88 treesize of output 108
[2024-03-11 22:02:48,021 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 88
[2024-03-11 22:02:48,109 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:02:48,109 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 69 treesize of output 62
[2024-03-11 22:02:48,113 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-11 22:02:48,123 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-11 22:02:48,124 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 118
[2024-03-11 22:02:48,152 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:02:48,152 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 88 treesize of output 108
[2024-03-11 22:02:48,163 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 88
[2024-03-11 22:02:48,752 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked.
[2024-03-11 22:02:48,752 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [730142329] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:02:48,752 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:02:48,753 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 33
[2024-03-11 22:02:48,753 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570612107]
[2024-03-11 22:02:48,753 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:02:48,753 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 35 states
[2024-03-11 22:02:48,753 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:02:48,754 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants.
[2024-03-11 22:02:48,754 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=785, Unknown=4, NotChecked=244, Total=1190
[2024-03-11 22:02:49,000 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 215
[2024-03-11 22:02:49,002 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 2092 transitions, 35302 flow. Second operand  has 35 states, 35 states have (on average 59.628571428571426) internal successors, (2087), 35 states have internal predecessors, (2087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:02:49,002 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:02:49,002 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 215
[2024-03-11 22:02:49,003 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:03:18,386 INFO  L130       PetriNetUnfolder]: 32001/53449 cut-off events.
[2024-03-11 22:03:18,387 INFO  L131       PetriNetUnfolder]: For 596180/596200 co-relation queries the response was YES.
[2024-03-11 22:03:18,743 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 412815 conditions, 53449 events. 32001/53449 cut-off events. For 596180/596200 co-relation queries the response was YES. Maximal size of possible extension queue 1431. Compared 417070 event pairs, 3394 based on Foata normal form. 698/51576 useless extension candidates. Maximal degree in co-relation 394529. Up to 27151 conditions per place. 
[2024-03-11 22:03:19,061 INFO  L137   encePairwiseOnDemand]: 151/215 looper letters, 1334 selfloop transitions, 1973 changer transitions 7/3318 dead transitions.
[2024-03-11 22:03:19,061 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 3318 transitions, 58290 flow
[2024-03-11 22:03:19,062 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 
[2024-03-11 22:03:19,063 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 24 states.
[2024-03-11 22:03:19,064 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1980 transitions.
[2024-03-11 22:03:19,065 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.38372093023255816
[2024-03-11 22:03:19,065 INFO  L72            ComplementDD]: Start complementDD. Operand 24 states and 1980 transitions.
[2024-03-11 22:03:19,065 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 24 states and 1980 transitions.
[2024-03-11 22:03:19,066 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:03:19,066 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 1980 transitions.
[2024-03-11 22:03:19,068 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 25 states, 24 states have (on average 82.5) internal successors, (1980), 24 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:03:19,071 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 25 states, 25 states have (on average 215.0) internal successors, (5375), 25 states have internal predecessors, (5375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:03:19,072 INFO  L81            ComplementDD]: Finished complementDD. Result  has 25 states, 25 states have (on average 215.0) internal successors, (5375), 25 states have internal predecessors, (5375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:03:19,072 INFO  L175             Difference]: Start difference. First operand has 187 places, 2092 transitions, 35302 flow. Second operand 24 states and 1980 transitions.
[2024-03-11 22:03:19,072 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 3318 transitions, 58290 flow
[2024-03-11 22:03:29,418 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 3318 transitions, 57996 flow, removed 147 selfloop flow, removed 0 redundant places.
[2024-03-11 22:03:29,464 INFO  L231             Difference]: Finished difference. Result has 221 places, 2791 transitions, 53158 flow
[2024-03-11 22:03:29,466 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=35014, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2092, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1340, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=537, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=53158, PETRI_PLACES=221, PETRI_TRANSITIONS=2791}
[2024-03-11 22:03:29,466 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 150 predicate places.
[2024-03-11 22:03:29,466 INFO  L495      AbstractCegarLoop]: Abstraction has has 221 places, 2791 transitions, 53158 flow
[2024-03-11 22:03:29,467 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 35 states, 35 states have (on average 59.628571428571426) internal successors, (2087), 35 states have internal predecessors, (2087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:03:29,467 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:03:29,467 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:03:29,475 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0
[2024-03-11 22:03:29,667 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,12 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:03:29,668 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:03:29,669 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:03:29,669 INFO  L85        PathProgramCache]: Analyzing trace with hash 1319801594, now seen corresponding path program 1 times
[2024-03-11 22:03:29,670 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:03:29,670 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734853138]
[2024-03-11 22:03:29,670 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:03:29,670 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:03:29,704 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:03:30,247 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:03:30,248 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:03:30,248 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734853138]
[2024-03-11 22:03:30,248 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734853138] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:03:30,248 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903831976]
[2024-03-11 22:03:30,248 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:03:30,248 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:03:30,248 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:03:30,249 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:03:30,252 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2024-03-11 22:03:30,433 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:03:30,435 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 47 conjunts are in the unsatisfiable core
[2024-03-11 22:03:30,438 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:03:30,445 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:03:30,446 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:03:30,450 INFO  L321             Elim1Store]: treesize reduction 15, result has 6.3 percent of original size
[2024-03-11 22:03:30,450 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 44
[2024-03-11 22:03:30,705 INFO  L321             Elim1Store]: treesize reduction 32, result has 31.9 percent of original size
[2024-03-11 22:03:30,706 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 58
[2024-03-11 22:03:30,719 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18
[2024-03-11 22:03:30,866 INFO  L321             Elim1Store]: treesize reduction 32, result has 31.9 percent of original size
[2024-03-11 22:03:30,866 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 68
[2024-03-11 22:03:30,960 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-11 22:03:31,054 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-11 22:03:31,200 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:03:31,200 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 50
[2024-03-11 22:03:31,264 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:03:31,265 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2024-03-11 22:03:31,315 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:03:31,316 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2024-03-11 22:03:31,369 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:03:31,369 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:03:31,387 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:03:31,388 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:03:31,402 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:03:31,403 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:03:31,420 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:03:31,421 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:03:31,449 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:03:31,457 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:03:31,457 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:03:31,604 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1816 (Array Int Int)) (v_ArrVal_1815 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1815) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1816) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1816 (Array Int Int)) (v_ArrVal_1815 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1815) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1816) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1816 (Array Int Int)) (v_ArrVal_1815 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1815) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1816) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1816 (Array Int Int)) (v_ArrVal_1815 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1815) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1816) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) is different from false
[2024-03-11 22:03:31,880 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1816 (Array Int Int)) (v_ArrVal_1815 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1815) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1816) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1816 (Array Int Int)) (v_ArrVal_1815 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1815) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1816) c_threadThread1of2ForFork0_~p~0.base) .cse2))) (forall ((v_ArrVal_1816 (Array Int Int)) (v_ArrVal_1815 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1815) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1816) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1816 (Array Int Int)) (v_ArrVal_1815 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1815) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1816) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false
[2024-03-11 22:03:31,907 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_1816 (Array Int Int)) (v_ArrVal_1815 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1815) .cse1 v_ArrVal_1816) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1816 (Array Int Int)) (v_ArrVal_1815 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1815) .cse1 v_ArrVal_1816) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1816 (Array Int Int)) (v_ArrVal_1815 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1815) .cse1 v_ArrVal_1816) c_threadThread1of2ForFork0_~p~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1816 (Array Int Int)) (v_ArrVal_1815 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1815) .cse1 v_ArrVal_1816) c_threadThread1of2ForFork0_~p~0.base) .cse3)))))) is different from false
[2024-03-11 22:03:32,179 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:03:32,179 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 56
[2024-03-11 22:03:32,184 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:03:32,184 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 232 treesize of output 142
[2024-03-11 22:03:32,188 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 106
[2024-03-11 22:03:32,192 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 102
[2024-03-11 22:03:32,222 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:03:32,223 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2024-03-11 22:03:32,230 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:03:32,231 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2024-03-11 22:03:32,240 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:03:32,240 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2024-03-11 22:03:32,368 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-03-11 22:03:32,369 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903831976] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:03:32,369 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:03:32,369 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 33
[2024-03-11 22:03:32,369 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155003437]
[2024-03-11 22:03:32,370 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:03:32,370 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 35 states
[2024-03-11 22:03:32,370 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:03:32,371 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants.
[2024-03-11 22:03:32,371 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=831, Unknown=43, NotChecked=186, Total=1190
[2024-03-11 22:03:32,704 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 59 out of 215
[2024-03-11 22:03:32,706 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 2791 transitions, 53158 flow. Second operand  has 35 states, 35 states have (on average 61.57142857142857) internal successors, (2155), 35 states have internal predecessors, (2155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:03:32,706 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:03:32,706 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 215
[2024-03-11 22:03:32,707 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:04:04,267 INFO  L130       PetriNetUnfolder]: 32951/54922 cut-off events.
[2024-03-11 22:04:04,267 INFO  L131       PetriNetUnfolder]: For 903757/903757 co-relation queries the response was YES.
[2024-03-11 22:04:04,750 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 506803 conditions, 54922 events. 32951/54922 cut-off events. For 903757/903757 co-relation queries the response was YES. Maximal size of possible extension queue 1454. Compared 425959 event pairs, 5948 based on Foata normal form. 16/52312 useless extension candidates. Maximal degree in co-relation 480115. Up to 52315 conditions per place. 
[2024-03-11 22:04:05,075 INFO  L137   encePairwiseOnDemand]: 188/215 looper letters, 3304 selfloop transitions, 173 changer transitions 145/3623 dead transitions.
[2024-03-11 22:04:05,075 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 3623 transitions, 72281 flow
[2024-03-11 22:04:05,077 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2024-03-11 22:04:05,077 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 17 states.
[2024-03-11 22:04:05,078 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1309 transitions.
[2024-03-11 22:04:05,078 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3581395348837209
[2024-03-11 22:04:05,078 INFO  L72            ComplementDD]: Start complementDD. Operand 17 states and 1309 transitions.
[2024-03-11 22:04:05,078 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 17 states and 1309 transitions.
[2024-03-11 22:04:05,079 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:04:05,079 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1309 transitions.
[2024-03-11 22:04:05,080 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 18 states, 17 states have (on average 77.0) internal successors, (1309), 17 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:04:05,082 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 18 states, 18 states have (on average 215.0) internal successors, (3870), 18 states have internal predecessors, (3870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:04:05,083 INFO  L81            ComplementDD]: Finished complementDD. Result  has 18 states, 18 states have (on average 215.0) internal successors, (3870), 18 states have internal predecessors, (3870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:04:05,083 INFO  L175             Difference]: Start difference. First operand has 221 places, 2791 transitions, 53158 flow. Second operand 17 states and 1309 transitions.
[2024-03-11 22:04:05,083 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 3623 transitions, 72281 flow
[2024-03-11 22:04:26,586 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 3623 transitions, 71083 flow, removed 485 selfloop flow, removed 12 redundant places.
[2024-03-11 22:04:26,639 INFO  L231             Difference]: Finished difference. Result has 233 places, 2949 transitions, 55804 flow
[2024-03-11 22:04:26,641 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=52260, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2791, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2623, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=55804, PETRI_PLACES=233, PETRI_TRANSITIONS=2949}
[2024-03-11 22:04:26,641 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 162 predicate places.
[2024-03-11 22:04:26,641 INFO  L495      AbstractCegarLoop]: Abstraction has has 233 places, 2949 transitions, 55804 flow
[2024-03-11 22:04:26,641 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 35 states, 35 states have (on average 61.57142857142857) internal successors, (2155), 35 states have internal predecessors, (2155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:04:26,641 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:04:26,641 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:04:26,649 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0
[2024-03-11 22:04:26,842 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22
[2024-03-11 22:04:26,842 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:04:26,843 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:04:26,843 INFO  L85        PathProgramCache]: Analyzing trace with hash 1386912264, now seen corresponding path program 2 times
[2024-03-11 22:04:26,843 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:04:26,843 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614212103]
[2024-03-11 22:04:26,843 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:04:26,844 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:04:26,866 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:04:27,426 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:04:27,427 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:04:27,427 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614212103]
[2024-03-11 22:04:27,427 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614212103] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:04:27,427 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077831217]
[2024-03-11 22:04:27,427 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-11 22:04:27,427 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:04:27,427 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:04:27,428 INFO  L229       MonitoredProcess]: Starting monitored process 14 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:04:27,429 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process
[2024-03-11 22:04:27,622 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-11 22:04:27,622 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-11 22:04:27,624 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 64 conjunts are in the unsatisfiable core
[2024-03-11 22:04:27,628 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:04:27,649 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:04:27,656 INFO  L321             Elim1Store]: treesize reduction 15, result has 6.3 percent of original size
[2024-03-11 22:04:27,656 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 76
[2024-03-11 22:04:28,135 INFO  L321             Elim1Store]: treesize reduction 32, result has 31.9 percent of original size
[2024-03-11 22:04:28,136 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 65
[2024-03-11 22:04:28,155 INFO  L321             Elim1Store]: treesize reduction 23, result has 36.1 percent of original size
[2024-03-11 22:04:28,155 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 43
[2024-03-11 22:04:28,166 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-11 22:04:28,192 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21
[2024-03-11 22:04:28,651 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:04:28,652 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 65
[2024-03-11 22:04:28,666 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:04:28,666 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 56
[2024-03-11 22:04:28,802 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-11 22:04:28,852 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:04:28,853 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-11 22:04:28,915 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:04:28,916 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:04:28,917 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-03-11 22:04:28,975 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:04:28,976 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:04:28,977 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:04:28,978 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-03-11 22:04:29,032 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:04:29,033 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:04:29,034 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:04:29,034 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54
[2024-03-11 22:04:29,074 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:04:29,074 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:04:30,591 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse2 (forall ((v_ArrVal_1942 (Array Int Int))) (not (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1942) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))))) (and (or (forall ((v_ArrVal_1941 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1941) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| .cse1 3)))) .cse2) (or (forall ((v_ArrVal_1941 (Array Int Int))) (not (= (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| .cse1) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1941) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) .cse2) (or .cse2 (forall ((v_ArrVal_1941 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1941) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| .cse1 1))))) (or (forall ((v_ArrVal_1941 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1941) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| .cse1 2)))) .cse2)))) is different from false
[2024-03-11 22:04:30,911 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:04:30,912 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077831217] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:04:30,912 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:04:30,912 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 40
[2024-03-11 22:04:30,912 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757607144]
[2024-03-11 22:04:30,912 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:04:30,913 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 42 states
[2024-03-11 22:04:30,913 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:04:30,913 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants.
[2024-03-11 22:04:30,914 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1434, Unknown=4, NotChecked=78, Total=1722
[2024-03-11 22:04:31,962 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 49 out of 215
[2024-03-11 22:04:31,964 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 2949 transitions, 55804 flow. Second operand  has 42 states, 42 states have (on average 51.26190476190476) internal successors, (2153), 42 states have internal predecessors, (2153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:04:31,964 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:04:31,964 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 215
[2024-03-11 22:04:31,964 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:04:57,599 WARN  L233               SmtUtils]: Spent 6.54s on a formula simplification. DAG size of input: 123 DAG size of output: 114 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2024-03-11 22:05:30,722 INFO  L130       PetriNetUnfolder]: 33726/56629 cut-off events.
[2024-03-11 22:05:30,722 INFO  L131       PetriNetUnfolder]: For 985822/985822 co-relation queries the response was YES.
[2024-03-11 22:05:31,206 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 528940 conditions, 56629 events. 33726/56629 cut-off events. For 985822/985822 co-relation queries the response was YES. Maximal size of possible extension queue 1453. Compared 441610 event pairs, 5967 based on Foata normal form. 16/54313 useless extension candidates. Maximal degree in co-relation 500521. Up to 52402 conditions per place. 
[2024-03-11 22:05:31,507 INFO  L137   encePairwiseOnDemand]: 191/215 looper letters, 3920 selfloop transitions, 196 changer transitions 172/4289 dead transitions.
[2024-03-11 22:05:31,507 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 4289 transitions, 85204 flow
[2024-03-11 22:05:31,508 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2024-03-11 22:05:31,508 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 26 states.
[2024-03-11 22:05:31,510 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1612 transitions.
[2024-03-11 22:05:31,510 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.28837209302325584
[2024-03-11 22:05:31,510 INFO  L72            ComplementDD]: Start complementDD. Operand 26 states and 1612 transitions.
[2024-03-11 22:05:31,510 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 26 states and 1612 transitions.
[2024-03-11 22:05:31,511 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:05:31,511 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1612 transitions.
[2024-03-11 22:05:31,512 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 27 states, 26 states have (on average 62.0) internal successors, (1612), 26 states have internal predecessors, (1612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:05:31,516 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 27 states, 27 states have (on average 215.0) internal successors, (5805), 27 states have internal predecessors, (5805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:05:31,516 INFO  L81            ComplementDD]: Finished complementDD. Result  has 27 states, 27 states have (on average 215.0) internal successors, (5805), 27 states have internal predecessors, (5805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:05:31,517 INFO  L175             Difference]: Start difference. First operand has 233 places, 2949 transitions, 55804 flow. Second operand 26 states and 1612 transitions.
[2024-03-11 22:05:31,517 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 4289 transitions, 85204 flow
[2024-03-11 22:05:59,091 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 4289 transitions, 85038 flow, removed 71 selfloop flow, removed 8 redundant places.
[2024-03-11 22:05:59,151 INFO  L231             Difference]: Finished difference. Result has 262 places, 3086 transitions, 58718 flow
[2024-03-11 22:05:59,153 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=55696, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2949, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2784, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=58718, PETRI_PLACES=262, PETRI_TRANSITIONS=3086}
[2024-03-11 22:05:59,153 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 191 predicate places.
[2024-03-11 22:05:59,153 INFO  L495      AbstractCegarLoop]: Abstraction has has 262 places, 3086 transitions, 58718 flow
[2024-03-11 22:05:59,154 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 42 states, 42 states have (on average 51.26190476190476) internal successors, (2153), 42 states have internal predecessors, (2153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:05:59,154 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:05:59,154 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:05:59,158 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0
[2024-03-11 22:05:59,355 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23
[2024-03-11 22:05:59,355 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:05:59,356 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:05:59,356 INFO  L85        PathProgramCache]: Analyzing trace with hash -1148327920, now seen corresponding path program 3 times
[2024-03-11 22:05:59,356 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:05:59,357 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480919259]
[2024-03-11 22:05:59,357 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:05:59,357 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:05:59,384 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:05:59,957 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:05:59,957 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:05:59,957 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480919259]
[2024-03-11 22:05:59,957 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480919259] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:05:59,957 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14379950]
[2024-03-11 22:05:59,958 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-03-11 22:05:59,958 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:05:59,958 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:05:59,959 INFO  L229       MonitoredProcess]: Starting monitored process 15 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:05:59,961 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process
[2024-03-11 22:06:00,179 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-03-11 22:06:00,180 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-11 22:06:00,182 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 78 conjunts are in the unsatisfiable core
[2024-03-11 22:06:00,188 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:06:00,223 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:06:00,226 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:06:00,228 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16
[2024-03-11 22:06:00,915 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-03-11 22:06:00,915 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 70
[2024-03-11 22:06:00,925 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:06:00,926 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:06:00,928 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:06:00,929 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35
[2024-03-11 22:06:01,191 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-03-11 22:06:01,191 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 57
[2024-03-11 22:06:01,200 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:06:01,202 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:06:01,203 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:06:01,204 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31
[2024-03-11 22:06:01,319 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-11 22:06:01,570 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:06:01,571 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13
[2024-03-11 22:06:01,594 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-11 22:06:01,594 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 35
[2024-03-11 22:06:01,707 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:06:01,708 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2024-03-11 22:06:01,747 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:06:01,748 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-11 22:06:01,841 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:06:01,842 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23
[2024-03-11 22:06:01,867 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:06:01,867 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23
[2024-03-11 22:06:01,919 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:06:01,920 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23
[2024-03-11 22:06:01,974 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:06:01,975 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:06:01,976 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-03-11 22:06:02,080 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:06:02,082 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:06:02,083 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:06:02,084 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-03-11 22:06:02,392 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:06:02,394 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:06:02,395 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:06:02,396 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:06:02,397 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:06:02,398 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 84
[2024-03-11 22:06:02,485 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:06:02,485 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:06:04,083 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (let ((.cse3 (+ |c_ULTIMATE.start_main_#t~mem14#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse1 (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) (.cse5 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse7 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse8 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse9 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_2088 (Array Int Int))) (let ((.cse2 (let ((.cse6 (store .cse9 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2088))) (store .cse6 c_threadThread1of2ForFork0_~p~0.base (store (store (select .cse6 c_threadThread1of2ForFork0_~p~0.base) .cse7 |c_threadThread1of2ForFork0_#t~nondet4|) .cse8 |c_threadThread1of2ForFork0_#t~nondet4|))))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base|))) (or (not (= (select .cse0 .cse1) 0)) (forall ((v_ArrVal_2094 Int)) (= (select (select (store .cse2 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse3 v_ArrVal_2094)) c_threadThread1of2ForFork0_~p~0.base) .cse4) |c_threadThread1of2ForFork0_#t~nondet4|)) (not (= (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (not (= (select .cse0 .cse5) 0)))))) (forall ((v_ArrVal_2088 (Array Int Int))) (let ((.cse10 (let ((.cse12 (store .cse9 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2088))) (store .cse12 c_threadThread1of2ForFork0_~p~0.base (store (store (select .cse12 c_threadThread1of2ForFork0_~p~0.base) .cse7 |c_threadThread1of2ForFork0_#t~nondet4|) .cse8 |c_threadThread1of2ForFork0_#t~nondet4|))))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#tids~0#1.base|))) (or (forall ((v_ArrVal_2094 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse10 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse10 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse3 v_ArrVal_2094)) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (not (= (select .cse11 .cse1) 0)) (not (= (select .cse11 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (not (= (select .cse11 .cse5) 0)))))) (forall ((v_ArrVal_2088 (Array Int Int))) (let ((.cse14 (let ((.cse15 (store .cse9 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2088))) (store .cse15 c_threadThread1of2ForFork0_~p~0.base (store (store (select .cse15 c_threadThread1of2ForFork0_~p~0.base) .cse7 |c_threadThread1of2ForFork0_#t~nondet4|) .cse8 |c_threadThread1of2ForFork0_#t~nondet4|))))) (let ((.cse13 (select .cse14 |c_ULTIMATE.start_main_~#tids~0#1.base|))) (or (not (= (select .cse13 .cse1) 0)) (not (= (select .cse13 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (not (= (select .cse13 .cse5) 0)) (forall ((v_ArrVal_2094 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse14 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse14 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse3 v_ArrVal_2094)) c_threadThread1of2ForFork0_~p~0.base) .cse8))))))) (forall ((v_ArrVal_2088 (Array Int Int))) (let ((.cse16 (let ((.cse18 (store .cse9 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2088))) (store .cse18 c_threadThread1of2ForFork0_~p~0.base (store (store (select .cse18 c_threadThread1of2ForFork0_~p~0.base) .cse7 |c_threadThread1of2ForFork0_#t~nondet4|) .cse8 |c_threadThread1of2ForFork0_#t~nondet4|))))) (let ((.cse17 (select .cse16 |c_ULTIMATE.start_main_~#tids~0#1.base|))) (or (forall ((v_ArrVal_2094 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse16 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse16 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse3 v_ArrVal_2094)) c_threadThread1of2ForFork0_~p~0.base) .cse7))) (not (= (select .cse17 .cse1) 0)) (not (= (select .cse17 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (not (= (select .cse17 .cse5) 0))))))))) is different from false
[2024-03-11 22:06:10,080 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:06:10,080 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 481 treesize of output 329
[2024-03-11 22:06:10,164 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:06:10,165 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 98932 treesize of output 89122
[2024-03-11 22:06:10,593 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:06:10,594 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 94610 treesize of output 93154
[2024-03-11 22:06:10,949 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:06:10,950 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 93521 treesize of output 90015
Killed by 15
