./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-init.i --full-output --architecture 32bit


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


Checking for data races
Using default analysis
Version 0e0057cc
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-init.i -s /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux --witnessprinter.witness.filename witness --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 5eada723a39865b57f214314c8375dd1968473302a42084b76575a29cb3c57af
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-0e0057c
[2024-03-09 04:53:11,021 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-03-09 04:53:11,057 INFO  L114        SettingsManager]: Loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-03-09 04:53:11,060 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-03-09 04:53:11,061 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-03-09 04:53:11,075 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-09 04:53:11,075 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-09 04:53:11,075 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-09 04:53:11,076 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-09 04:53:11,076 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-09 04:53:11,077 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-09 04:53:11,077 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-09 04:53:11,077 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-03-09 04:53:11,077 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-09 04:53:11,078 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-09 04:53:11,078 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-03-09 04:53:11,078 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-09 04:53:11,078 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-03-09 04:53:11,079 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-09 04:53:11,079 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-09 04:53:11,079 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-09 04:53:11,079 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-09 04:53:11,080 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-09 04:53:11,080 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-03-09 04:53:11,080 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-03-09 04:53:11,080 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-09 04:53:11,081 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-03-09 04:53:11,081 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-09 04:53:11,081 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-09 04:53:11,081 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-09 04:53:11,081 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-09 04:53:11,082 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-09 04:53:11,082 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-09 04:53:11,082 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-03-09 04:53:11,082 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-09 04:53:11,082 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-09 04:53:11,082 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-03-09 04:53:11,083 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-09 04:53:11,083 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-09 04:53:11,083 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-09 04:53:11,083 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-09 04:53:11,083 INFO  L153        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-pldi24/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-pldi24/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
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 -> 5eada723a39865b57f214314c8375dd1968473302a42084b76575a29cb3c57af
[2024-03-09 04:53:11,258 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-09 04:53:11,286 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-09 04:53:11,289 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-09 04:53:11,290 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-03-09 04:53:11,291 INFO  L274        PluginConnector]: CDTParser initialized
[2024-03-09 04:53:11,292 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-init.i
[2024-03-09 04:53:12,392 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-03-09 04:53:12,635 INFO  L384              CDTParser]: Found 1 translation units.
[2024-03-09 04:53:12,635 INFO  L180              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-init.i
[2024-03-09 04:53:12,652 INFO  L427              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/ccac28df2/1044d32cc7f849e298e524c6ba2f985e/FLAGb8114384d
[2024-03-09 04:53:12,663 INFO  L435              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/ccac28df2/1044d32cc7f849e298e524c6ba2f985e
[2024-03-09 04:53:12,665 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-09 04:53:12,666 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-09 04:53:12,667 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-09 04:53:12,667 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-09 04:53:12,671 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-09 04:53:12,671 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 04:53:12" (1/1) ...
[2024-03-09 04:53:12,672 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27633eec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:53:12, skipping insertion in model container
[2024-03-09 04:53:12,672 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 04:53:12" (1/1) ...
[2024-03-09 04:53:12,710 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-03-09 04:53:12,976 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-09 04:53:12,983 INFO  L202         MainTranslator]: Completed pre-run
[2024-03-09 04:53:13,013 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-09 04:53:13,049 INFO  L206         MainTranslator]: Completed translation
[2024-03-09 04:53:13,049 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:53:13 WrapperNode
[2024-03-09 04:53:13,049 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-09 04:53:13,050 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-09 04:53:13,050 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-09 04:53:13,050 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-09 04:53:13,055 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:53:13" (1/1) ...
[2024-03-09 04:53:13,068 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:53:13" (1/1) ...
[2024-03-09 04:53:13,089 INFO  L138                Inliner]: procedures = 265, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 114
[2024-03-09 04:53:13,089 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-09 04:53:13,090 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-09 04:53:13,090 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-09 04:53:13,090 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-03-09 04:53:13,097 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:53:13" (1/1) ...
[2024-03-09 04:53:13,097 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:53:13" (1/1) ...
[2024-03-09 04:53:13,100 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:53:13" (1/1) ...
[2024-03-09 04:53:13,100 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:53:13" (1/1) ...
[2024-03-09 04:53:13,108 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:53:13" (1/1) ...
[2024-03-09 04:53:13,111 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:53:13" (1/1) ...
[2024-03-09 04:53:13,112 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:53:13" (1/1) ...
[2024-03-09 04:53:13,113 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:53:13" (1/1) ...
[2024-03-09 04:53:13,116 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-09 04:53:13,116 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-09 04:53:13,116 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-03-09 04:53:13,116 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-03-09 04:53:13,117 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:53:13" (1/1) ...
[2024-03-09 04:53:13,121 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-09 04:53:13,128 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 04:53:13,140 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-03-09 04:53:13,161 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-03-09 04:53:13,195 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-03-09 04:53:13,196 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-03-09 04:53:13,196 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-09 04:53:13,196 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-03-09 04:53:13,196 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-09 04:53:13,196 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-09 04:53:13,196 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-03-09 04:53:13,196 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-09 04:53:13,197 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-09 04:53:13,197 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-09 04:53:13,197 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-09 04:53:13,198 WARN  L213             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-03-09 04:53:13,350 INFO  L241             CfgBuilder]: Building ICFG
[2024-03-09 04:53:13,352 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-09 04:53:13,551 INFO  L282             CfgBuilder]: Performing block encoding
[2024-03-09 04:53:13,560 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-09 04:53:13,560 INFO  L309             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-09 04:53:13,561 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 04:53:13 BoogieIcfgContainer
[2024-03-09 04:53:13,561 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-09 04:53:13,563 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-09 04:53:13,563 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-03-09 04:53:13,565 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-03-09 04:53:13,566 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 04:53:12" (1/3) ...
[2024-03-09 04:53:13,566 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e71997 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 04:53:13, skipping insertion in model container
[2024-03-09 04:53:13,566 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:53:13" (2/3) ...
[2024-03-09 04:53:13,567 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e71997 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 04:53:13, skipping insertion in model container
[2024-03-09 04:53:13,567 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 04:53:13" (3/3) ...
[2024-03-09 04:53:13,567 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-array-init.i
[2024-03-09 04:53:13,573 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-09 04:53:13,580 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-09 04:53:13,581 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations.
[2024-03-09 04:53:13,581 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-09 04:53:13,625 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-09 04:53:13,651 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 135 places, 136 transitions, 279 flow
[2024-03-09 04:53:13,709 INFO  L124   PetriNetUnfolderBase]: 6/219 cut-off events.
[2024-03-09 04:53:13,709 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2024-03-09 04:53:13,714 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 224 conditions, 219 events. 6/219 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 372 event pairs, 0 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 108. Up to 4 conditions per place. 
[2024-03-09 04:53:13,714 INFO  L82        GeneralOperation]: Start removeDead. Operand has 135 places, 136 transitions, 279 flow
[2024-03-09 04:53:13,718 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 135 places, 136 transitions, 279 flow
[2024-03-09 04:53:13,726 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 04:53:13,731 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=LoopHeads, 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;@62d10937, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-09 04:53:13,732 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 11 error locations.
[2024-03-09 04:53:13,740 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-09 04:53:13,740 INFO  L124   PetriNetUnfolderBase]: 3/42 cut-off events.
[2024-03-09 04:53:13,740 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-09 04:53:13,740 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 04:53:13,741 INFO  L208   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-09 04:53:13,742 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 04:53:13,745 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 04:53:13,746 INFO  L85        PathProgramCache]: Analyzing trace with hash 1173728229, now seen corresponding path program 1 times
[2024-03-09 04:53:13,752 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 04:53:13,752 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896174096]
[2024-03-09 04:53:13,752 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 04:53:13,753 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 04:53:13,849 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 04:53:14,235 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-09 04:53:14,235 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 04:53:14,236 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896174096]
[2024-03-09 04:53:14,236 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896174096] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 04:53:14,236 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 04:53:14,236 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 04:53:14,237 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378192185]
[2024-03-09 04:53:14,238 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 04:53:14,244 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 04:53:14,249 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 04:53:14,267 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 04:53:14,268 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 04:53:14,721 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 105 out of 136
[2024-03-09 04:53:14,725 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 136 transitions, 279 flow. Second operand  has 6 states, 6 states have (on average 106.16666666666667) internal successors, (637), 6 states have internal predecessors, (637), 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-09 04:53:14,725 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 04:53:14,725 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 136
[2024-03-09 04:53:14,726 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 04:53:14,796 INFO  L124   PetriNetUnfolderBase]: 1/239 cut-off events.
[2024-03-09 04:53:14,796 INFO  L125   PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2024-03-09 04:53:14,796 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 295 conditions, 239 events. 1/239 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 379 event pairs, 0 based on Foata normal form. 6/225 useless extension candidates. Maximal degree in co-relation 40. Up to 24 conditions per place. 
[2024-03-09 04:53:14,798 INFO  L140   encePairwiseOnDemand]: 116/136 looper letters, 19 selfloop transitions, 10 changer transitions 5/138 dead transitions.
[2024-03-09 04:53:14,798 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 138 transitions, 349 flow
[2024-03-09 04:53:14,799 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 04:53:14,801 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 04:53:14,807 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 671 transitions.
[2024-03-09 04:53:14,810 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8223039215686274
[2024-03-09 04:53:14,810 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 671 transitions.
[2024-03-09 04:53:14,811 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 671 transitions.
[2024-03-09 04:53:14,813 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 04:53:14,814 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 671 transitions.
[2024-03-09 04:53:14,819 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 111.83333333333333) internal successors, (671), 6 states have internal predecessors, (671), 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-09 04:53:14,824 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 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-09 04:53:14,824 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 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-09 04:53:14,826 INFO  L175             Difference]: Start difference. First operand has 135 places, 136 transitions, 279 flow. Second operand 6 states and 671 transitions.
[2024-03-09 04:53:14,826 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 138 transitions, 349 flow
[2024-03-09 04:53:14,829 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 138 transitions, 349 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 04:53:14,831 INFO  L231             Difference]: Finished difference. Result has 141 places, 133 transitions, 325 flow
[2024-03-09 04:53:14,833 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=325, PETRI_PLACES=141, PETRI_TRANSITIONS=133}
[2024-03-09 04:53:14,836 INFO  L281   CegarLoopForPetriNet]: 135 programPoint places, 6 predicate places.
[2024-03-09 04:53:14,836 INFO  L495      AbstractCegarLoop]: Abstraction has has 141 places, 133 transitions, 325 flow
[2024-03-09 04:53:14,837 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 106.16666666666667) internal successors, (637), 6 states have internal predecessors, (637), 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-09 04:53:14,837 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 04:53:14,837 INFO  L208   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, 1]
[2024-03-09 04:53:14,837 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-09 04:53:14,837 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 04:53:14,838 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 04:53:14,838 INFO  L85        PathProgramCache]: Analyzing trace with hash -468651564, now seen corresponding path program 1 times
[2024-03-09 04:53:14,838 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 04:53:14,838 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441877692]
[2024-03-09 04:53:14,838 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 04:53:14,838 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 04:53:14,855 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 04:53:14,902 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-09 04:53:14,902 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 04:53:14,902 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441877692]
[2024-03-09 04:53:14,902 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441877692] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 04:53:14,902 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 04:53:14,903 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 04:53:14,903 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677484994]
[2024-03-09 04:53:14,903 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 04:53:14,904 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-09 04:53:14,904 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 04:53:14,904 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-09 04:53:14,904 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-09 04:53:14,974 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 120 out of 136
[2024-03-09 04:53:14,975 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 133 transitions, 325 flow. Second operand  has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 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-09 04:53:14,975 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 04:53:14,975 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 136
[2024-03-09 04:53:14,976 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 04:53:15,010 INFO  L124   PetriNetUnfolderBase]: 0/219 cut-off events.
[2024-03-09 04:53:15,010 INFO  L125   PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES.
[2024-03-09 04:53:15,011 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 289 conditions, 219 events. 0/219 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 283 event pairs, 0 based on Foata normal form. 1/208 useless extension candidates. Maximal degree in co-relation 0. Up to 15 conditions per place. 
[2024-03-09 04:53:15,011 INFO  L140   encePairwiseOnDemand]: 129/136 looper letters, 11 selfloop transitions, 6 changer transitions 0/137 dead transitions.
[2024-03-09 04:53:15,011 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 137 transitions, 367 flow
[2024-03-09 04:53:15,011 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 04:53:15,012 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 04:53:15,013 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 738 transitions.
[2024-03-09 04:53:15,013 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9044117647058824
[2024-03-09 04:53:15,013 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 738 transitions.
[2024-03-09 04:53:15,014 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 738 transitions.
[2024-03-09 04:53:15,014 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 04:53:15,014 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 738 transitions.
[2024-03-09 04:53:15,016 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 123.0) internal successors, (738), 6 states have internal predecessors, (738), 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-09 04:53:15,017 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 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-09 04:53:15,018 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 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-09 04:53:15,018 INFO  L175             Difference]: Start difference. First operand has 141 places, 133 transitions, 325 flow. Second operand 6 states and 738 transitions.
[2024-03-09 04:53:15,018 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 137 transitions, 367 flow
[2024-03-09 04:53:15,020 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 137 transitions, 357 flow, removed 3 selfloop flow, removed 1 redundant places.
[2024-03-09 04:53:15,021 INFO  L231             Difference]: Finished difference. Result has 148 places, 137 transitions, 355 flow
[2024-03-09 04:53:15,022 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=355, PETRI_PLACES=148, PETRI_TRANSITIONS=137}
[2024-03-09 04:53:15,022 INFO  L281   CegarLoopForPetriNet]: 135 programPoint places, 13 predicate places.
[2024-03-09 04:53:15,022 INFO  L495      AbstractCegarLoop]: Abstraction has has 148 places, 137 transitions, 355 flow
[2024-03-09 04:53:15,023 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 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-09 04:53:15,023 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 04:53:15,023 INFO  L208   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, 1, 1]
[2024-03-09 04:53:15,023 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-09 04:53:15,023 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 04:53:15,024 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 04:53:15,024 INFO  L85        PathProgramCache]: Analyzing trace with hash -410745350, now seen corresponding path program 1 times
[2024-03-09 04:53:15,024 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 04:53:15,024 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429184997]
[2024-03-09 04:53:15,024 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 04:53:15,024 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 04:53:15,038 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 04:53:15,225 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-09 04:53:15,226 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 04:53:15,226 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429184997]
[2024-03-09 04:53:15,226 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429184997] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 04:53:15,226 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 04:53:15,226 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 04:53:15,226 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006380078]
[2024-03-09 04:53:15,226 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 04:53:15,227 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 04:53:15,227 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 04:53:15,227 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 04:53:15,227 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 04:53:15,607 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 105 out of 136
[2024-03-09 04:53:15,608 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 137 transitions, 355 flow. Second operand  has 6 states, 6 states have (on average 106.16666666666667) internal successors, (637), 6 states have internal predecessors, (637), 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-09 04:53:15,608 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 04:53:15,608 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 136
[2024-03-09 04:53:15,608 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 04:53:15,662 INFO  L124   PetriNetUnfolderBase]: 0/212 cut-off events.
[2024-03-09 04:53:15,662 INFO  L125   PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES.
[2024-03-09 04:53:15,663 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 327 conditions, 212 events. 0/212 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 255 event pairs, 0 based on Foata normal form. 0/207 useless extension candidates. Maximal degree in co-relation 0. Up to 28 conditions per place. 
[2024-03-09 04:53:15,663 INFO  L140   encePairwiseOnDemand]: 123/136 looper letters, 20 selfloop transitions, 6 changer transitions 8/139 dead transitions.
[2024-03-09 04:53:15,663 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 139 transitions, 421 flow
[2024-03-09 04:53:15,664 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 04:53:15,664 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 04:53:15,665 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 663 transitions.
[2024-03-09 04:53:15,665 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8125
[2024-03-09 04:53:15,665 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 663 transitions.
[2024-03-09 04:53:15,665 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 663 transitions.
[2024-03-09 04:53:15,666 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 04:53:15,666 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 663 transitions.
[2024-03-09 04:53:15,667 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 110.5) internal successors, (663), 6 states have internal predecessors, (663), 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-09 04:53:15,668 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 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-09 04:53:15,669 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 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-09 04:53:15,669 INFO  L175             Difference]: Start difference. First operand has 148 places, 137 transitions, 355 flow. Second operand 6 states and 663 transitions.
[2024-03-09 04:53:15,669 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 139 transitions, 421 flow
[2024-03-09 04:53:15,670 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 139 transitions, 419 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-09 04:53:15,672 INFO  L231             Difference]: Finished difference. Result has 154 places, 131 transitions, 361 flow
[2024-03-09 04:53:15,672 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=361, PETRI_PLACES=154, PETRI_TRANSITIONS=131}
[2024-03-09 04:53:15,673 INFO  L281   CegarLoopForPetriNet]: 135 programPoint places, 19 predicate places.
[2024-03-09 04:53:15,673 INFO  L495      AbstractCegarLoop]: Abstraction has has 154 places, 131 transitions, 361 flow
[2024-03-09 04:53:15,674 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 106.16666666666667) internal successors, (637), 6 states have internal predecessors, (637), 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-09 04:53:15,674 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 04:53:15,674 INFO  L208   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, 1, 1, 1, 1, 1]
[2024-03-09 04:53:15,674 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-09 04:53:15,674 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 04:53:15,675 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 04:53:15,675 INFO  L85        PathProgramCache]: Analyzing trace with hash -2019086822, now seen corresponding path program 1 times
[2024-03-09 04:53:15,675 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 04:53:15,675 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754731219]
[2024-03-09 04:53:15,675 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 04:53:15,675 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 04:53:15,701 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 04:53:15,902 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-09 04:53:15,902 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 04:53:15,902 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754731219]
[2024-03-09 04:53:15,903 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754731219] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 04:53:15,903 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 04:53:15,903 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 04:53:15,903 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492895301]
[2024-03-09 04:53:15,903 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 04:53:15,903 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 04:53:15,904 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 04:53:15,904 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 04:53:15,904 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 04:53:16,102 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 84 out of 136
[2024-03-09 04:53:16,103 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 131 transitions, 361 flow. Second operand  has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 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-09 04:53:16,103 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 04:53:16,103 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 136
[2024-03-09 04:53:16,103 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 04:53:16,288 INFO  L124   PetriNetUnfolderBase]: 178/730 cut-off events.
[2024-03-09 04:53:16,288 INFO  L125   PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES.
[2024-03-09 04:53:16,291 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1396 conditions, 730 events. 178/730 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3759 event pairs, 140 based on Foata normal form. 0/707 useless extension candidates. Maximal degree in co-relation 1194. Up to 415 conditions per place. 
[2024-03-09 04:53:16,293 INFO  L140   encePairwiseOnDemand]: 125/136 looper letters, 52 selfloop transitions, 23 changer transitions 0/152 dead transitions.
[2024-03-09 04:53:16,293 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 152 transitions, 553 flow
[2024-03-09 04:53:16,293 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 04:53:16,293 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 04:53:16,294 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 575 transitions.
[2024-03-09 04:53:16,295 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7046568627450981
[2024-03-09 04:53:16,295 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 575 transitions.
[2024-03-09 04:53:16,295 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 575 transitions.
[2024-03-09 04:53:16,295 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 04:53:16,295 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 575 transitions.
[2024-03-09 04:53:16,296 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 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-09 04:53:16,298 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 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-09 04:53:16,298 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 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-09 04:53:16,298 INFO  L175             Difference]: Start difference. First operand has 154 places, 131 transitions, 361 flow. Second operand 6 states and 575 transitions.
[2024-03-09 04:53:16,298 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 152 transitions, 553 flow
[2024-03-09 04:53:16,301 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 152 transitions, 518 flow, removed 9 selfloop flow, removed 11 redundant places.
[2024-03-09 04:53:16,303 INFO  L231             Difference]: Finished difference. Result has 150 places, 152 transitions, 480 flow
[2024-03-09 04:53:16,303 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=480, PETRI_PLACES=150, PETRI_TRANSITIONS=152}
[2024-03-09 04:53:16,304 INFO  L281   CegarLoopForPetriNet]: 135 programPoint places, 15 predicate places.
[2024-03-09 04:53:16,304 INFO  L495      AbstractCegarLoop]: Abstraction has has 150 places, 152 transitions, 480 flow
[2024-03-09 04:53:16,304 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 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-09 04:53:16,304 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 04:53:16,304 INFO  L208   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, 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-09 04:53:16,304 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-09 04:53:16,305 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 04:53:16,305 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 04:53:16,305 INFO  L85        PathProgramCache]: Analyzing trace with hash 1386262423, now seen corresponding path program 1 times
[2024-03-09 04:53:16,305 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 04:53:16,305 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144200825]
[2024-03-09 04:53:16,305 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 04:53:16,306 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 04:53:16,329 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 04:53:16,582 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-09 04:53:16,582 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 04:53:16,582 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144200825]
[2024-03-09 04:53:16,582 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144200825] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 04:53:16,582 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 04:53:16,582 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 04:53:16,582 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966162726]
[2024-03-09 04:53:16,582 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 04:53:16,583 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 04:53:16,583 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 04:53:16,583 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 04:53:16,583 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 04:53:16,945 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 120 out of 136
[2024-03-09 04:53:16,946 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 152 transitions, 480 flow. Second operand  has 6 states, 6 states have (on average 121.83333333333333) internal successors, (731), 6 states have internal predecessors, (731), 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-09 04:53:16,946 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 04:53:16,946 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 136
[2024-03-09 04:53:16,946 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 04:53:17,049 INFO  L124   PetriNetUnfolderBase]: 72/504 cut-off events.
[2024-03-09 04:53:17,049 INFO  L125   PetriNetUnfolderBase]: For 225/261 co-relation queries the response was YES.
[2024-03-09 04:53:17,051 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1029 conditions, 504 events. 72/504 cut-off events. For 225/261 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2226 event pairs, 7 based on Foata normal form. 4/492 useless extension candidates. Maximal degree in co-relation 868. Up to 116 conditions per place. 
[2024-03-09 04:53:17,052 INFO  L140   encePairwiseOnDemand]: 126/136 looper letters, 28 selfloop transitions, 31 changer transitions 26/178 dead transitions.
[2024-03-09 04:53:17,052 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 178 transitions, 740 flow
[2024-03-09 04:53:17,058 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 04:53:17,058 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 04:53:17,059 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 754 transitions.
[2024-03-09 04:53:17,060 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9240196078431373
[2024-03-09 04:53:17,060 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 754 transitions.
[2024-03-09 04:53:17,060 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 754 transitions.
[2024-03-09 04:53:17,061 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 04:53:17,062 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 754 transitions.
[2024-03-09 04:53:17,064 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 125.66666666666667) internal successors, (754), 6 states have internal predecessors, (754), 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-09 04:53:17,066 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 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-09 04:53:17,067 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 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-09 04:53:17,067 INFO  L175             Difference]: Start difference. First operand has 150 places, 152 transitions, 480 flow. Second operand 6 states and 754 transitions.
[2024-03-09 04:53:17,067 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 178 transitions, 740 flow
[2024-03-09 04:53:17,070 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 178 transitions, 733 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-09 04:53:17,073 INFO  L231             Difference]: Finished difference. Result has 159 places, 152 transitions, 713 flow
[2024-03-09 04:53:17,073 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=713, PETRI_PLACES=159, PETRI_TRANSITIONS=152}
[2024-03-09 04:53:17,074 INFO  L281   CegarLoopForPetriNet]: 135 programPoint places, 24 predicate places.
[2024-03-09 04:53:17,074 INFO  L495      AbstractCegarLoop]: Abstraction has has 159 places, 152 transitions, 713 flow
[2024-03-09 04:53:17,074 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 121.83333333333333) internal successors, (731), 6 states have internal predecessors, (731), 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-09 04:53:17,074 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 04:53:17,074 INFO  L208   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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 04:53:17,075 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-03-09 04:53:17,075 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 04:53:17,075 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 04:53:17,075 INFO  L85        PathProgramCache]: Analyzing trace with hash 789811840, now seen corresponding path program 1 times
[2024-03-09 04:53:17,075 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 04:53:17,076 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578868165]
[2024-03-09 04:53:17,076 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 04:53:17,076 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 04:53:17,104 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 04:53:17,394 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-09 04:53:17,394 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 04:53:17,394 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578868165]
[2024-03-09 04:53:17,394 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578868165] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 04:53:17,394 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 04:53:17,394 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 04:53:17,394 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959095999]
[2024-03-09 04:53:17,395 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 04:53:17,395 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 04:53:17,395 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 04:53:17,395 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 04:53:17,396 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 04:53:17,759 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 114 out of 136
[2024-03-09 04:53:17,759 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 152 transitions, 713 flow. Second operand  has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 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-09 04:53:17,759 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 04:53:17,759 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 136
[2024-03-09 04:53:17,759 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 04:53:17,821 INFO  L124   PetriNetUnfolderBase]: 65/435 cut-off events.
[2024-03-09 04:53:17,821 INFO  L125   PetriNetUnfolderBase]: For 445/470 co-relation queries the response was YES.
[2024-03-09 04:53:17,822 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1060 conditions, 435 events. 65/435 cut-off events. For 445/470 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1907 event pairs, 3 based on Foata normal form. 0/434 useless extension candidates. Maximal degree in co-relation 912. Up to 74 conditions per place. 
[2024-03-09 04:53:17,823 INFO  L140   encePairwiseOnDemand]: 130/136 looper letters, 29 selfloop transitions, 0 changer transitions 22/151 dead transitions.
[2024-03-09 04:53:17,823 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 151 transitions, 789 flow
[2024-03-09 04:53:17,824 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 04:53:17,824 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 04:53:17,825 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 701 transitions.
[2024-03-09 04:53:17,825 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8590686274509803
[2024-03-09 04:53:17,825 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 701 transitions.
[2024-03-09 04:53:17,825 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 701 transitions.
[2024-03-09 04:53:17,826 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 04:53:17,826 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 701 transitions.
[2024-03-09 04:53:17,834 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 116.83333333333333) internal successors, (701), 6 states have internal predecessors, (701), 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-09 04:53:17,835 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 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-09 04:53:17,835 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 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-09 04:53:17,835 INFO  L175             Difference]: Start difference. First operand has 159 places, 152 transitions, 713 flow. Second operand 6 states and 701 transitions.
[2024-03-09 04:53:17,836 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 151 transitions, 789 flow
[2024-03-09 04:53:17,838 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 151 transitions, 771 flow, removed 9 selfloop flow, removed 0 redundant places.
[2024-03-09 04:53:17,840 INFO  L231             Difference]: Finished difference. Result has 137 places, 129 transitions, 644 flow
[2024-03-09 04:53:17,840 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=644, PETRI_PLACES=137, PETRI_TRANSITIONS=129}
[2024-03-09 04:53:17,841 INFO  L281   CegarLoopForPetriNet]: 135 programPoint places, 2 predicate places.
[2024-03-09 04:53:17,841 INFO  L495      AbstractCegarLoop]: Abstraction has has 137 places, 129 transitions, 644 flow
[2024-03-09 04:53:17,841 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 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-09 04:53:17,841 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 04:53:17,841 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 04:53:17,841 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-03-09 04:53:17,842 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 04:53:17,842 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 04:53:17,842 INFO  L85        PathProgramCache]: Analyzing trace with hash -1689538737, now seen corresponding path program 1 times
[2024-03-09 04:53:17,842 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 04:53:17,842 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469174613]
[2024-03-09 04:53:17,842 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 04:53:17,842 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 04:53:17,888 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 04:53:19,201 INFO  L134       CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 04:53:19,201 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 04:53:19,202 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469174613]
[2024-03-09 04:53:19,202 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469174613] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 04:53:19,202 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760743443]
[2024-03-09 04:53:19,202 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 04:53:19,202 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 04:53:19,202 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 04:53:19,205 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 04:53:19,215 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-03-09 04:53:19,360 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 04:53:19,377 INFO  L262         TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 48 conjunts are in the unsatisfiable core
[2024-03-09 04:53:19,390 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 04:53:19,432 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5
[2024-03-09 04:53:19,467 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-09 04:53:19,467 INFO  L378             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 15 treesize of output 15
[2024-03-09 04:53:19,697 INFO  L349             Elim1Store]: treesize reduction 36, result has 29.4 percent of original size
[2024-03-09 04:53:19,698 INFO  L378             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 33 treesize of output 33
[2024-03-09 04:53:19,715 INFO  L378             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 13 treesize of output 9
[2024-03-09 04:53:20,278 INFO  L349             Elim1Store]: treesize reduction 56, result has 36.4 percent of original size
[2024-03-09 04:53:20,278 INFO  L378             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 6 case distinctions, treesize of input 63 treesize of output 74
[2024-03-09 04:53:20,289 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:53:20,289 INFO  L378             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 16 treesize of output 11
[2024-03-09 04:53:20,410 INFO  L378             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-09 04:53:20,641 INFO  L378             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 21 treesize of output 13
[2024-03-09 04:53:20,649 INFO  L378             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-09 04:53:20,722 INFO  L378             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 15 treesize of output 11
[2024-03-09 04:53:20,778 INFO  L378             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 28 treesize of output 27
[2024-03-09 04:53:20,852 INFO  L378             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 40 treesize of output 42
[2024-03-09 04:53:20,927 INFO  L378             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 52 treesize of output 57
[2024-03-09 04:53:21,236 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:53:21,237 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:53:21,239 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:53:21,240 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:53:21,246 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:53:21,247 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 60
[2024-03-09 04:53:21,262 INFO  L134       CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 04:53:21,262 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 04:53:26,517 INFO  L378             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 28 treesize of output 24
[2024-03-09 04:53:30,947 WARN  L854   $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_14| Int)) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |v_ULTIMATE.start_main_#t~mem8#1.base_14|) (forall ((v_ArrVal_360 (Array Int Int)) (v_ArrVal_361 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_14| v_ArrVal_360))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse0 .cse1 v_ArrVal_361) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (not (= .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|)))))))) is different from false
[2024-03-09 04:53:31,293 INFO  L378             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 20 treesize of output 18
[2024-03-09 04:53:31,448 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:53:31,449 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 101
[2024-03-09 04:53:31,492 INFO  L378             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 48 treesize of output 42
[2024-03-09 04:53:31,712 INFO  L134       CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2024-03-09 04:53:31,713 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760743443] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 04:53:31,713 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 04:53:31,713 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 63
[2024-03-09 04:53:31,713 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210011233]
[2024-03-09 04:53:31,714 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 04:53:31,714 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 64 states
[2024-03-09 04:53:31,716 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 04:53:31,716 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants.
[2024-03-09 04:53:31,719 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=3616, Unknown=34, NotChecked=122, Total=4032
[2024-03-09 04:53:33,471 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 36 out of 136
[2024-03-09 04:53:33,473 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 129 transitions, 644 flow. Second operand  has 64 states, 64 states have (on average 38.859375) internal successors, (2487), 64 states have internal predecessors, (2487), 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-09 04:53:33,473 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 04:53:33,473 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 136
[2024-03-09 04:53:33,473 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 04:53:38,481 INFO  L124   PetriNetUnfolderBase]: 420/1094 cut-off events.
[2024-03-09 04:53:38,481 INFO  L125   PetriNetUnfolderBase]: For 1272/1272 co-relation queries the response was YES.
[2024-03-09 04:53:38,483 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3372 conditions, 1094 events. 420/1094 cut-off events. For 1272/1272 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 4854 event pairs, 9 based on Foata normal form. 5/1099 useless extension candidates. Maximal degree in co-relation 3352. Up to 336 conditions per place. 
[2024-03-09 04:53:38,486 INFO  L140   encePairwiseOnDemand]: 104/136 looper letters, 182 selfloop transitions, 62 changer transitions 0/264 dead transitions.
[2024-03-09 04:53:38,487 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 264 transitions, 1782 flow
[2024-03-09 04:53:38,487 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. 
[2024-03-09 04:53:38,487 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 30 states.
[2024-03-09 04:53:38,490 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 1285 transitions.
[2024-03-09 04:53:38,491 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.31495098039215685
[2024-03-09 04:53:38,491 INFO  L72            ComplementDD]: Start complementDD. Operand 30 states and 1285 transitions.
[2024-03-09 04:53:38,491 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 30 states and 1285 transitions.
[2024-03-09 04:53:38,491 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 04:53:38,492 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 1285 transitions.
[2024-03-09 04:53:38,494 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 31 states, 30 states have (on average 42.833333333333336) internal successors, (1285), 30 states have internal predecessors, (1285), 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-09 04:53:38,498 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 31 states, 31 states have (on average 136.0) internal successors, (4216), 31 states have internal predecessors, (4216), 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-09 04:53:38,498 INFO  L81            ComplementDD]: Finished complementDD. Result  has 31 states, 31 states have (on average 136.0) internal successors, (4216), 31 states have internal predecessors, (4216), 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-09 04:53:38,498 INFO  L175             Difference]: Start difference. First operand has 137 places, 129 transitions, 644 flow. Second operand 30 states and 1285 transitions.
[2024-03-09 04:53:38,498 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 264 transitions, 1782 flow
[2024-03-09 04:53:38,503 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 264 transitions, 1780 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-09 04:53:38,506 INFO  L231             Difference]: Finished difference. Result has 150 places, 149 transitions, 982 flow
[2024-03-09 04:53:38,506 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=982, PETRI_PLACES=150, PETRI_TRANSITIONS=149}
[2024-03-09 04:53:38,506 INFO  L281   CegarLoopForPetriNet]: 135 programPoint places, 15 predicate places.
[2024-03-09 04:53:38,506 INFO  L495      AbstractCegarLoop]: Abstraction has has 150 places, 149 transitions, 982 flow
[2024-03-09 04:53:38,507 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 64 states, 64 states have (on average 38.859375) internal successors, (2487), 64 states have internal predecessors, (2487), 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-09 04:53:38,507 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 04:53:38,508 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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-09 04:53:38,517 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-03-09 04:53:38,709 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 04:53:38,709 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 04:53:38,710 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 04:53:38,710 INFO  L85        PathProgramCache]: Analyzing trace with hash 1047924032, now seen corresponding path program 1 times
[2024-03-09 04:53:38,710 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 04:53:38,711 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932535973]
[2024-03-09 04:53:38,711 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 04:53:38,711 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 04:53:38,755 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 04:53:40,845 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 04:53:40,846 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 04:53:40,846 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932535973]
[2024-03-09 04:53:40,846 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932535973] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 04:53:40,846 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472397356]
[2024-03-09 04:53:40,846 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 04:53:40,846 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 04:53:40,846 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 04:53:40,847 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 04:53:40,854 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-03-09 04:53:40,985 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 04:53:40,987 INFO  L262         TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 54 conjunts are in the unsatisfiable core
[2024-03-09 04:53:40,993 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 04:53:41,008 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5
[2024-03-09 04:53:41,029 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-09 04:53:41,030 INFO  L378             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 15 treesize of output 15
[2024-03-09 04:53:41,313 INFO  L349             Elim1Store]: treesize reduction 44, result has 20.0 percent of original size
[2024-03-09 04:53:41,314 INFO  L378             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 43 treesize of output 45
[2024-03-09 04:53:41,708 INFO  L349             Elim1Store]: treesize reduction 40, result has 27.3 percent of original size
[2024-03-09 04:53:41,709 INFO  L378             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 66 treesize of output 66
[2024-03-09 04:53:41,716 INFO  L378             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 20 treesize of output 11
[2024-03-09 04:53:41,720 INFO  L378             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 12 treesize of output 8
[2024-03-09 04:53:41,965 INFO  L378             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-09 04:53:42,025 INFO  L378             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-09 04:53:42,108 INFO  L378             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-09 04:53:42,195 INFO  L378             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-09 04:53:42,578 INFO  L378             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 21 treesize of output 13
[2024-03-09 04:53:42,584 INFO  L378             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 24 treesize of output 12
[2024-03-09 04:53:42,678 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:53:42,678 INFO  L378             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 43 treesize of output 32
[2024-03-09 04:53:42,700 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:53:42,701 INFO  L378             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 43 treesize of output 32
[2024-03-09 04:53:42,720 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:53:42,720 INFO  L378             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 43 treesize of output 32
[2024-03-09 04:53:42,748 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:53:42,749 INFO  L378             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 43 treesize of output 32
[2024-03-09 04:53:42,851 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:53:42,852 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:53:42,853 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:53:42,854 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:53:42,857 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:53:42,857 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 47
[2024-03-09 04:53:42,866 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 04:53:42,866 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 04:53:43,067 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) is different from false
[2024-03-09 04:53:43,147 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse2) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse3))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse3) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse4 .cse1 (store (select .cse4 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse2) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse2) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse3))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse3) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse2) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)))))) is different from false
[2024-03-09 04:53:47,308 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_21| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse0) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse3))) (forall ((|v_ULTIMATE.start_main_~i~1#1_21| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_21| .cse3) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse0))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_21| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_21| .cse3) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse0))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_21| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_21| .cse3) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse0))))))) is different from false
[2024-03-09 04:53:47,387 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_21| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse1) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0))) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse4 .cse3 (store (select .cse4 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse1))) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse5 .cse3 (store (select .cse5 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse1))) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse6 .cse3 (store (select .cse6 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse1))))) is different from false
[2024-03-09 04:53:47,623 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse4 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse7 0))) (.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_21| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse1) (= (select (select (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0))) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (= (select (select (let ((.cse5 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse5 .cse3 (store (select .cse5 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse1))) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (= (select (select (let ((.cse6 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse6 .cse3 (store (select .cse6 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse1))) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (= (select (select (let ((.cse8 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse8 .cse3 (store (select .cse8 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse1)))))) is different from false
[2024-03-09 04:53:47,692 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse4 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse8 0) .cse6 0)))) (and (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_21| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse1) (= (select (select (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0))) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (= (select (select (let ((.cse5 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse5 .cse3 (store (select .cse5 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse1))) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (= (select (select (let ((.cse7 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse7 .cse3 (store (select .cse7 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse1))) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_21| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse1) (= (select (select (let ((.cse9 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse9 .cse3 (store (select .cse9 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))) is different from false
[2024-03-09 04:53:47,842 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse3 0) .cse7 0) .cse9 0))) (.cse4 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse4) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse5))) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_21| .cse4) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse5) (= (select (select (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0))) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (= (select (select (let ((.cse8 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse8 .cse1 (store (select .cse8 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse4) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse5))) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (= (select (select (let ((.cse10 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse10 .cse1 (store (select .cse10 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse4) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse5)))))) is different from false
[2024-03-09 04:53:47,882 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:53:47,883 INFO  L378             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 79 treesize of output 72
[2024-03-09 04:53:47,894 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:53:47,895 INFO  L378             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 232 treesize of output 220
[2024-03-09 04:53:47,906 INFO  L378             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 177 treesize of output 169
[2024-03-09 04:53:47,931 INFO  L378             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 31 treesize of output 17
[2024-03-09 04:53:47,945 INFO  L378             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 140 treesize of output 122
[2024-03-09 04:53:48,069 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:53:48,069 INFO  L378             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 81 treesize of output 74
[2024-03-09 04:53:48,073 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-09 04:53:48,087 INFO  L349             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2024-03-09 04:53:48,088 INFO  L378             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 144 treesize of output 130
[2024-03-09 04:53:48,102 INFO  L378             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 48 treesize of output 44
[2024-03-09 04:53:48,114 INFO  L378             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 80 treesize of output 62
[2024-03-09 04:53:48,179 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 04:53:48,179 INFO  L378             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 81 treesize of output 1
[2024-03-09 04:53:48,191 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 04:53:48,192 INFO  L378             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 81 treesize of output 1
[2024-03-09 04:53:48,835 INFO  L378             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 70 treesize of output 62
[2024-03-09 04:53:48,994 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_524 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_524) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_524 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_524))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|)) (forall ((v_ArrVal_525 (Array Int Int))) (not (= (select (select (store .cse1 .cse0 v_ArrVal_525) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))))))))) is different from false
[2024-03-09 04:53:49,053 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_524 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_524) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|))) (forall ((v_ArrVal_524 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_524))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#is~0#1.base| .cse1)) (forall ((v_ArrVal_525 (Array Int Int))) (not (= (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse2 .cse1 v_ArrVal_525) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))))) is different from false
[2024-03-09 04:53:49,775 INFO  L349             Elim1Store]: treesize reduction 4, result has 63.6 percent of original size
[2024-03-09 04:53:49,776 INFO  L378             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 322 treesize of output 205
[2024-03-09 04:53:49,793 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:53:49,794 INFO  L378             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 85 treesize of output 85
[2024-03-09 04:53:49,831 INFO  L378             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 58 treesize of output 54
[2024-03-09 04:53:49,971 INFO  L378             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 10 treesize of output 8
[2024-03-09 04:53:50,046 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked.
[2024-03-09 04:53:50,047 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [472397356] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 04:53:50,047 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 04:53:50,047 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 23, 24] total 66
[2024-03-09 04:53:50,047 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055930530]
[2024-03-09 04:53:50,047 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 04:53:50,048 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 67 states
[2024-03-09 04:53:50,049 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 04:53:50,050 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants.
[2024-03-09 04:53:50,051 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=3095, Unknown=13, NotChecked=1080, Total=4422
[2024-03-09 04:53:50,346 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136
[2024-03-09 04:53:50,349 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 149 transitions, 982 flow. Second operand  has 67 states, 67 states have (on average 40.56716417910448) internal successors, (2718), 67 states have internal predecessors, (2718), 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-09 04:53:50,349 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 04:53:50,349 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136
[2024-03-09 04:53:50,349 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 04:54:00,418 INFO  L124   PetriNetUnfolderBase]: 437/1318 cut-off events.
[2024-03-09 04:54:00,418 INFO  L125   PetriNetUnfolderBase]: For 2020/2020 co-relation queries the response was YES.
[2024-03-09 04:54:00,422 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4312 conditions, 1318 events. 437/1318 cut-off events. For 2020/2020 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 7022 event pairs, 87 based on Foata normal form. 19/1337 useless extension candidates. Maximal degree in co-relation 4282. Up to 728 conditions per place. 
[2024-03-09 04:54:00,429 INFO  L140   encePairwiseOnDemand]: 105/136 looper letters, 197 selfloop transitions, 57 changer transitions 0/276 dead transitions.
[2024-03-09 04:54:00,429 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 276 transitions, 2135 flow
[2024-03-09 04:54:00,430 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. 
[2024-03-09 04:54:00,430 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 35 states.
[2024-03-09 04:54:00,433 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 1520 transitions.
[2024-03-09 04:54:00,433 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.31932773109243695
[2024-03-09 04:54:00,433 INFO  L72            ComplementDD]: Start complementDD. Operand 35 states and 1520 transitions.
[2024-03-09 04:54:00,434 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 35 states and 1520 transitions.
[2024-03-09 04:54:00,434 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 04:54:00,434 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 1520 transitions.
[2024-03-09 04:54:00,437 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 36 states, 35 states have (on average 43.42857142857143) internal successors, (1520), 35 states have internal predecessors, (1520), 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-09 04:54:00,441 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 36 states, 36 states have (on average 136.0) internal successors, (4896), 36 states have internal predecessors, (4896), 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-09 04:54:00,441 INFO  L81            ComplementDD]: Finished complementDD. Result  has 36 states, 36 states have (on average 136.0) internal successors, (4896), 36 states have internal predecessors, (4896), 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-09 04:54:00,441 INFO  L175             Difference]: Start difference. First operand has 150 places, 149 transitions, 982 flow. Second operand 35 states and 1520 transitions.
[2024-03-09 04:54:00,441 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 276 transitions, 2135 flow
[2024-03-09 04:54:00,449 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 276 transitions, 2071 flow, removed 0 selfloop flow, removed 13 redundant places.
[2024-03-09 04:54:00,455 INFO  L231             Difference]: Finished difference. Result has 178 places, 189 transitions, 1391 flow
[2024-03-09 04:54:00,455 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=958, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=1391, PETRI_PLACES=178, PETRI_TRANSITIONS=189}
[2024-03-09 04:54:00,455 INFO  L281   CegarLoopForPetriNet]: 135 programPoint places, 43 predicate places.
[2024-03-09 04:54:00,455 INFO  L495      AbstractCegarLoop]: Abstraction has has 178 places, 189 transitions, 1391 flow
[2024-03-09 04:54:00,456 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 67 states, 67 states have (on average 40.56716417910448) internal successors, (2718), 67 states have internal predecessors, (2718), 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-09 04:54:00,456 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 04:54:00,457 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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-09 04:54:00,463 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-03-09 04:54:00,657 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7
[2024-03-09 04:54:00,658 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 04:54:00,658 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 04:54:00,659 INFO  L85        PathProgramCache]: Analyzing trace with hash 1510621680, now seen corresponding path program 2 times
[2024-03-09 04:54:00,659 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 04:54:00,659 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993982689]
[2024-03-09 04:54:00,659 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 04:54:00,659 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 04:54:00,690 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 04:54:02,324 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 04:54:02,324 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 04:54:02,324 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993982689]
[2024-03-09 04:54:02,324 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993982689] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 04:54:02,324 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713444711]
[2024-03-09 04:54:02,325 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-09 04:54:02,325 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 04:54:02,325 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 04:54:02,326 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 04:54:02,327 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-03-09 04:54:02,466 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-09 04:54:02,466 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 04:54:02,468 INFO  L262         TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 50 conjunts are in the unsatisfiable core
[2024-03-09 04:54:02,474 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 04:54:02,815 INFO  L349             Elim1Store]: treesize reduction 40, result has 21.6 percent of original size
[2024-03-09 04:54:02,816 INFO  L378             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 52 treesize of output 44
[2024-03-09 04:54:03,298 INFO  L349             Elim1Store]: treesize reduction 44, result has 20.0 percent of original size
[2024-03-09 04:54:03,298 INFO  L378             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-09 04:54:03,305 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:54:03,306 INFO  L378             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 24 treesize of output 11
[2024-03-09 04:54:03,956 INFO  L378             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-09 04:54:04,054 INFO  L378             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-09 04:54:04,194 INFO  L378             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-09 04:54:04,598 INFO  L378             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 21 treesize of output 13
[2024-03-09 04:54:04,611 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:54:04,612 INFO  L378             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 51 treesize of output 39
[2024-03-09 04:54:04,722 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:54:04,723 INFO  L378             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 34 treesize of output 25
[2024-03-09 04:54:04,740 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:54:04,741 INFO  L378             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 34 treesize of output 25
[2024-03-09 04:54:04,764 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:54:04,765 INFO  L378             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 34 treesize of output 25
[2024-03-09 04:54:04,783 INFO  L378             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-09 04:54:04,895 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:54:04,896 INFO  L378             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 43 treesize of output 32
[2024-03-09 04:54:05,035 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:54:05,037 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:54:05,039 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:54:05,042 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:54:05,047 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:54:05,047 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 47
[2024-03-09 04:54:05,055 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 04:54:05,056 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 04:54:15,913 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_701) c_threadThread1of1ForFork0_~p~0.base) .cse2 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse3 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_701) c_threadThread1of1ForFork0_~p~0.base) .cse2 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_701) c_threadThread1of1ForFork0_~p~0.base) .cse2 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) .cse2) 0)) (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_701) c_threadThread1of1ForFork0_~p~0.base) .cse2 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse5 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) is different from false
[2024-03-09 04:54:16,113 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse1 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_701) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse3) v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_701) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse3) v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse6 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_701) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse3) v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse7 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_701) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse3) v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0))))) is different from false
[2024-03-09 04:54:20,314 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse4 (+ |c_ULTIMATE.start_main_#t~post7#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse1 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_701) c_threadThread1of1ForFork0_~p~0.base) .cse3 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse4))) (forall ((|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_701) c_threadThread1of1ForFork0_~p~0.base) .cse3 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse4))) (forall ((|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= 0 (select (select (let ((.cse6 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_701) c_threadThread1of1ForFork0_~p~0.base) .cse3 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)))))) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse4))) (forall ((|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse7 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_701) c_threadThread1of1ForFork0_~p~0.base) .cse3 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse4))))) is different from false
[2024-03-09 04:54:24,432 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse7 0))) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse5 (+ |c_ULTIMATE.start_main_#t~post7#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse1 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_701) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse6 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_701) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse8 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_701) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse9 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_701) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse5)))))) is different from false
[2024-03-09 04:54:28,575 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse9 0) .cse5 0))) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse6 (+ |c_ULTIMATE.start_main_#t~post7#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse1 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_701) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse6))) (forall ((|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse7 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_701) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0))) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse6))) (forall ((|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse8 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_701) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse6))) (forall ((|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse10 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_701) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse10 .cse2 (store (select .cse10 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse6)))))) is different from false
[2024-03-09 04:54:28,683 INFO  L349             Elim1Store]: treesize reduction 31, result has 62.2 percent of original size
[2024-03-09 04:54:28,683 INFO  L378             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 4 case distinctions, treesize of input 1150 treesize of output 960
[2024-03-09 04:54:28,706 INFO  L378             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 244 treesize of output 228
[2024-03-09 04:54:28,745 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:54:28,745 INFO  L378             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 346 treesize of output 342
[2024-03-09 04:54:28,770 INFO  L378             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 109 treesize of output 105
[2024-03-09 04:54:29,007 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-09 04:54:29,022 INFO  L349             Elim1Store]: treesize reduction 81, result has 1.2 percent of original size
[2024-03-09 04:54:29,023 INFO  L378             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 3 new quantified variables, introduced 4 case distinctions, treesize of input 690 treesize of output 1
[2024-03-09 04:54:29,030 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-09 04:54:29,045 INFO  L349             Elim1Store]: treesize reduction 81, result has 1.2 percent of original size
[2024-03-09 04:54:29,045 INFO  L378             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 3 new quantified variables, introduced 4 case distinctions, treesize of input 658 treesize of output 1
[2024-03-09 04:54:29,057 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-09 04:54:29,095 INFO  L349             Elim1Store]: treesize reduction 54, result has 34.1 percent of original size
[2024-03-09 04:54:29,096 INFO  L378             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 3 new quantified variables, introduced 4 case distinctions, treesize of input 442 treesize of output 421
[2024-03-09 04:54:29,114 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-09 04:54:29,131 INFO  L349             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2024-03-09 04:54:29,132 INFO  L378             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 63 treesize of output 59
[2024-03-09 04:54:29,148 INFO  L378             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 48 treesize of output 44
[2024-03-09 04:54:30,267 INFO  L378             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 70 treesize of output 62
[2024-03-09 04:54:30,510 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_691 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_691))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_692 (Array Int Int))) (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse0 .cse1 v_ArrVal_692) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (not (= .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|)))))) (forall ((v_ArrVal_691 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_691) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|)))) is different from false
[2024-03-09 04:54:30,648 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_20| Int)) (or (forall ((v_ArrVal_691 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_20| v_ArrVal_691))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_692 (Array Int Int))) (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse0 .cse1 v_ArrVal_692) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| .cse1)))))) (< .cse2 |v_ULTIMATE.start_main_#t~mem8#1.base_20|))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_20| Int)) (or (forall ((v_ArrVal_691 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_20| v_ArrVal_691) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (< .cse2 |v_ULTIMATE.start_main_#t~mem8#1.base_20|))))) is different from false
[2024-03-09 04:54:31,334 INFO  L378             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 20 treesize of output 18
[2024-03-09 04:54:31,550 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:54:31,550 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 98
[2024-03-09 04:54:31,563 INFO  L378             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 33 treesize of output 27
[2024-03-09 04:54:31,807 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked.
[2024-03-09 04:54:31,807 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713444711] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 04:54:31,808 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 04:54:31,808 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 25] total 69
[2024-03-09 04:54:31,808 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693016034]
[2024-03-09 04:54:31,808 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 04:54:31,809 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 70 states
[2024-03-09 04:54:31,810 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 04:54:31,811 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants.
[2024-03-09 04:54:31,813 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=3651, Unknown=36, NotChecked=896, Total=4830
[2024-03-09 04:54:31,816 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136
[2024-03-09 04:54:31,819 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 189 transitions, 1391 flow. Second operand  has 70 states, 70 states have (on average 40.52857142857143) internal successors, (2837), 70 states have internal predecessors, (2837), 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-09 04:54:31,819 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 04:54:31,819 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136
[2024-03-09 04:54:31,819 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 04:54:50,586 INFO  L124   PetriNetUnfolderBase]: 593/1913 cut-off events.
[2024-03-09 04:54:50,586 INFO  L125   PetriNetUnfolderBase]: For 5195/5195 co-relation queries the response was YES.
[2024-03-09 04:54:50,593 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6868 conditions, 1913 events. 593/1913 cut-off events. For 5195/5195 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 12228 event pairs, 88 based on Foata normal form. 25/1938 useless extension candidates. Maximal degree in co-relation 6832. Up to 789 conditions per place. 
[2024-03-09 04:54:50,600 INFO  L140   encePairwiseOnDemand]: 104/136 looper letters, 269 selfloop transitions, 113 changer transitions 0/404 dead transitions.
[2024-03-09 04:54:50,600 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 404 transitions, 3565 flow
[2024-03-09 04:54:50,601 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. 
[2024-03-09 04:54:50,602 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 44 states.
[2024-03-09 04:54:50,608 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 1934 transitions.
[2024-03-09 04:54:50,609 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3231951871657754
[2024-03-09 04:54:50,609 INFO  L72            ComplementDD]: Start complementDD. Operand 44 states and 1934 transitions.
[2024-03-09 04:54:50,609 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 44 states and 1934 transitions.
[2024-03-09 04:54:50,611 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 04:54:50,611 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 1934 transitions.
[2024-03-09 04:54:50,616 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 45 states, 44 states have (on average 43.95454545454545) internal successors, (1934), 44 states have internal predecessors, (1934), 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-09 04:54:50,623 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 45 states, 45 states have (on average 136.0) internal successors, (6120), 45 states have internal predecessors, (6120), 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-09 04:54:50,624 INFO  L81            ComplementDD]: Finished complementDD. Result  has 45 states, 45 states have (on average 136.0) internal successors, (6120), 45 states have internal predecessors, (6120), 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-09 04:54:50,624 INFO  L175             Difference]: Start difference. First operand has 178 places, 189 transitions, 1391 flow. Second operand 44 states and 1934 transitions.
[2024-03-09 04:54:50,624 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 404 transitions, 3565 flow
[2024-03-09 04:54:50,640 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 404 transitions, 3491 flow, removed 19 selfloop flow, removed 14 redundant places.
[2024-03-09 04:54:50,645 INFO  L231             Difference]: Finished difference. Result has 225 places, 268 transitions, 2455 flow
[2024-03-09 04:54:50,645 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=1332, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=2455, PETRI_PLACES=225, PETRI_TRANSITIONS=268}
[2024-03-09 04:54:50,645 INFO  L281   CegarLoopForPetriNet]: 135 programPoint places, 90 predicate places.
[2024-03-09 04:54:50,646 INFO  L495      AbstractCegarLoop]: Abstraction has has 225 places, 268 transitions, 2455 flow
[2024-03-09 04:54:50,647 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 70 states, 70 states have (on average 40.52857142857143) internal successors, (2837), 70 states have internal predecessors, (2837), 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-09 04:54:50,647 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 04:54:50,647 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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-09 04:54:50,658 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2024-03-09 04:54:50,848 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 04:54:50,849 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 04:54:50,850 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 04:54:50,850 INFO  L85        PathProgramCache]: Analyzing trace with hash 1642786074, now seen corresponding path program 3 times
[2024-03-09 04:54:50,851 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 04:54:50,851 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095559185]
[2024-03-09 04:54:50,851 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 04:54:50,852 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 04:54:50,912 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 04:54:53,190 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 04:54:53,191 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 04:54:53,191 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095559185]
[2024-03-09 04:54:53,191 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095559185] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 04:54:53,192 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051020200]
[2024-03-09 04:54:53,192 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-03-09 04:54:53,192 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 04:54:53,192 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 04:54:53,193 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 04:54:53,195 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-03-09 04:54:53,360 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-03-09 04:54:53,360 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 04:54:53,362 INFO  L262         TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 65 conjunts are in the unsatisfiable core
[2024-03-09 04:54:53,369 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 04:54:54,279 INFO  L349             Elim1Store]: treesize reduction 40, result has 21.6 percent of original size
[2024-03-09 04:54:54,280 INFO  L378             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 52 treesize of output 44
[2024-03-09 04:54:54,296 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:54:54,297 INFO  L378             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 16 treesize of output 11
[2024-03-09 04:54:55,470 INFO  L349             Elim1Store]: treesize reduction 44, result has 20.0 percent of original size
[2024-03-09 04:54:55,471 INFO  L378             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-09 04:54:55,484 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:54:55,485 INFO  L378             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 24 treesize of output 11
[2024-03-09 04:54:56,465 INFO  L378             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-09 04:54:56,640 INFO  L378             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 19 treesize of output 18
[2024-03-09 04:54:56,867 INFO  L378             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 26 treesize of output 28
[2024-03-09 04:54:57,091 INFO  L378             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 33 treesize of output 38
[2024-03-09 04:54:57,704 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:54:57,704 INFO  L378             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 51 treesize of output 39
[2024-03-09 04:54:57,730 INFO  L378             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 7 treesize of output 3
[2024-03-09 04:54:57,878 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:54:57,879 INFO  L378             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 37 treesize of output 26
[2024-03-09 04:54:57,934 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:54:57,935 INFO  L378             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 37 treesize of output 26
[2024-03-09 04:54:57,966 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:54:57,966 INFO  L378             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 37 treesize of output 26
[2024-03-09 04:54:58,007 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:54:58,008 INFO  L378             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 37 treesize of output 26
[2024-03-09 04:54:58,237 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:54:58,240 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:54:58,242 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:54:58,244 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:54:58,247 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:54:58,247 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 41
[2024-03-09 04:54:58,362 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 04:54:58,362 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 04:55:04,326 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int)) (or (forall ((v_ArrVal_873 Int) (v_ArrVal_871 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse2) v_ArrVal_873))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse3))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int)) (or (forall ((v_ArrVal_873 Int) (v_ArrVal_871 (Array Int Int))) (= 0 (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse4 .cse1 (store (select .cse4 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse2) v_ArrVal_873))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)))) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse3))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse3) (forall ((v_ArrVal_873 Int) (v_ArrVal_871 (Array Int Int))) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse2) v_ArrVal_873))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int)) (or (forall ((v_ArrVal_873 Int) (v_ArrVal_871 (Array Int Int))) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse2) v_ArrVal_873))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse3))))) is different from false
[2024-03-09 04:55:08,520 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_#t~post7#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_25| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int)) (or (forall ((v_ArrVal_873 Int) (v_ArrVal_871 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_873))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse2))) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse3))) (forall ((|v_ULTIMATE.start_main_~i~1#1_25| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_25| .cse3) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int)) (or (forall ((v_ArrVal_873 Int) (v_ArrVal_871 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse4 .cse1 (store (select .cse4 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_873))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse2))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_25| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int)) (or (forall ((v_ArrVal_873 Int) (v_ArrVal_871 (Array Int Int))) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_873))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse2))) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse3))) (forall ((|v_ULTIMATE.start_main_~i~1#1_25| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse2) (forall ((v_ArrVal_873 Int) (v_ArrVal_871 (Array Int Int))) (= 0 (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_873))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset))))) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse3))))) is different from false
[2024-03-09 04:55:12,607 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse7 0))) (.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_25| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_25| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int)) (or (forall ((v_ArrVal_873 Int) (v_ArrVal_871 (Array Int Int))) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_873))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse4))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_25| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse4) (forall ((v_ArrVal_873 Int) (v_ArrVal_871 (Array Int Int))) (= (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_873))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse0))) (forall ((|v_ULTIMATE.start_main_~i~1#1_25| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int)) (or (forall ((v_ArrVal_873 Int) (v_ArrVal_871 (Array Int Int))) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_873))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse4))) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse0))) (forall ((|v_ULTIMATE.start_main_~i~1#1_25| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse4) (forall ((v_ArrVal_873 Int) (v_ArrVal_871 (Array Int Int))) (= (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_873))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse0)))))) is different from false
[2024-03-09 04:55:16,457 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse4 0) .cse9 0))) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_25| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_25| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int)) (or (forall ((v_ArrVal_873 Int) (v_ArrVal_871 (Array Int Int))) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_873))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse5))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_25| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int)) (or (forall ((v_ArrVal_873 Int) (v_ArrVal_871 (Array Int Int))) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_873))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse5))) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse0))) (forall ((|v_ULTIMATE.start_main_~i~1#1_25| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int)) (or (forall ((v_ArrVal_873 Int) (v_ArrVal_871 (Array Int Int))) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_873))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse5))) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse0))) (forall ((|v_ULTIMATE.start_main_~i~1#1_25| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int)) (or (forall ((v_ArrVal_873 Int) (v_ArrVal_871 (Array Int Int))) (= (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_873))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse5))) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse0)))))) is different from false
[2024-03-09 04:55:18,985 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse8 0) .cse10 0) .cse3 0))) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_main_#t~post7#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_25| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int)) (or (forall ((v_ArrVal_873 Int) (v_ArrVal_871 (Array Int Int))) (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_873))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse4))) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_25| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int)) (or (forall ((v_ArrVal_873 Int) (v_ArrVal_871 (Array Int Int))) (= (select (select (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_873))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse4))) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_25| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_25| .cse5) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse4) (forall ((v_ArrVal_873 Int) (v_ArrVal_871 (Array Int Int))) (= (select (select (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse7 .cse1 (store (select .cse7 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_873))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_25| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int)) (or (forall ((v_ArrVal_873 Int) (v_ArrVal_871 (Array Int Int))) (= (select (select (let ((.cse9 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse9 .cse1 (store (select .cse9 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_873))) c_threadThread1of1ForFork0_~p~0.base) .cse10) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse4))) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse5)))))) is different from false
[2024-03-09 04:55:19,049 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:55:19,049 INFO  L378             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 81 treesize of output 74
[2024-03-09 04:55:19,066 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:55:19,067 INFO  L378             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 444 treesize of output 416
[2024-03-09 04:55:19,116 INFO  L378             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 190 treesize of output 174
[2024-03-09 04:55:19,153 INFO  L378             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 31 treesize of output 17
[2024-03-09 04:55:19,170 INFO  L378             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 149 treesize of output 127
[2024-03-09 04:55:19,408 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:55:19,409 INFO  L378             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 81 treesize of output 74
[2024-03-09 04:55:19,415 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-09 04:55:19,440 INFO  L349             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2024-03-09 04:55:19,441 INFO  L378             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 144 treesize of output 130
[2024-03-09 04:55:19,460 INFO  L378             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 48 treesize of output 44
[2024-03-09 04:55:19,476 INFO  L378             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 80 treesize of output 62
[2024-03-09 04:55:19,515 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 04:55:19,515 INFO  L378             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 79 treesize of output 1
[2024-03-09 04:55:19,546 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:55:19,547 INFO  L378             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 81 treesize of output 74
[2024-03-09 04:55:19,556 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-09 04:55:19,576 INFO  L349             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2024-03-09 04:55:19,577 INFO  L378             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 144 treesize of output 130
[2024-03-09 04:55:19,593 INFO  L378             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 80 treesize of output 62
[2024-03-09 04:55:19,607 INFO  L378             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 48 treesize of output 44
[2024-03-09 04:55:21,035 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_858 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_858) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_858 (Array Int Int)) (v_ArrVal_859 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_858))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_861 (Array Int Int))) (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse0 .cse1 v_ArrVal_861) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_860 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_859))) (< (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse2 .cse1 v_ArrVal_860) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1))))))))) is different from false
[2024-03-09 04:55:21,157 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_23| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.base_23|) (forall ((v_ArrVal_858 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_23| v_ArrVal_858) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_23| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.base_23|) (forall ((v_ArrVal_858 (Array Int Int)) (v_ArrVal_859 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_23| v_ArrVal_858))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_860 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem8#1.base_23| v_ArrVal_859))) (< (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse1 .cse2 v_ArrVal_860) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))) (forall ((v_ArrVal_861 (Array Int Int))) (not (= (select (select (store .cse3 .cse2 v_ArrVal_861) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse3 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))))))) is different from false
[2024-03-09 04:55:21,281 INFO  L378             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 222 treesize of output 202
[2024-03-09 04:55:21,297 INFO  L378             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 25 treesize of output 23
[2024-03-09 04:55:21,307 INFO  L378             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 48 treesize of output 44
[2024-03-09 04:55:21,797 INFO  L378             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 20 treesize of output 18
[2024-03-09 04:55:21,997 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:55:21,998 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 98
[2024-03-09 04:55:22,023 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:55:22,024 INFO  L378             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 33 treesize of output 35
[2024-03-09 04:55:22,291 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked.
[2024-03-09 04:55:22,292 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051020200] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 04:55:22,292 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 04:55:22,292 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 24] total 70
[2024-03-09 04:55:22,293 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033756593]
[2024-03-09 04:55:22,293 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 04:55:22,294 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 71 states
[2024-03-09 04:55:22,295 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 04:55:22,295 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants.
[2024-03-09 04:55:22,297 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=3734, Unknown=43, NotChecked=910, Total=4970
[2024-03-09 04:55:23,144 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136
[2024-03-09 04:55:23,148 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 268 transitions, 2455 flow. Second operand  has 71 states, 71 states have (on average 40.50704225352113) internal successors, (2876), 71 states have internal predecessors, (2876), 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-09 04:55:23,148 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 04:55:23,148 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136
[2024-03-09 04:55:23,148 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 04:55:38,858 INFO  L124   PetriNetUnfolderBase]: 698/2326 cut-off events.
[2024-03-09 04:55:38,859 INFO  L125   PetriNetUnfolderBase]: For 11145/11145 co-relation queries the response was YES.
[2024-03-09 04:55:38,866 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9489 conditions, 2326 events. 698/2326 cut-off events. For 11145/11145 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 16087 event pairs, 121 based on Foata normal form. 19/2344 useless extension candidates. Maximal degree in co-relation 9435. Up to 913 conditions per place. 
[2024-03-09 04:55:38,875 INFO  L140   encePairwiseOnDemand]: 104/136 looper letters, 283 selfloop transitions, 139 changer transitions 0/444 dead transitions.
[2024-03-09 04:55:38,876 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 444 transitions, 4716 flow
[2024-03-09 04:55:38,877 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. 
[2024-03-09 04:55:38,877 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 44 states.
[2024-03-09 04:55:38,878 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 1917 transitions.
[2024-03-09 04:55:38,879 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3203542780748663
[2024-03-09 04:55:38,879 INFO  L72            ComplementDD]: Start complementDD. Operand 44 states and 1917 transitions.
[2024-03-09 04:55:38,879 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 44 states and 1917 transitions.
[2024-03-09 04:55:38,880 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 04:55:38,880 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 1917 transitions.
[2024-03-09 04:55:38,882 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 45 states, 44 states have (on average 43.56818181818182) internal successors, (1917), 44 states have internal predecessors, (1917), 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-09 04:55:38,887 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 45 states, 45 states have (on average 136.0) internal successors, (6120), 45 states have internal predecessors, (6120), 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-09 04:55:38,888 INFO  L81            ComplementDD]: Finished complementDD. Result  has 45 states, 45 states have (on average 136.0) internal successors, (6120), 45 states have internal predecessors, (6120), 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-09 04:55:38,888 INFO  L175             Difference]: Start difference. First operand has 225 places, 268 transitions, 2455 flow. Second operand 44 states and 1917 transitions.
[2024-03-09 04:55:38,888 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 444 transitions, 4716 flow
[2024-03-09 04:55:38,923 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 444 transitions, 4594 flow, removed 40 selfloop flow, removed 17 redundant places.
[2024-03-09 04:55:38,928 INFO  L231             Difference]: Finished difference. Result has 271 places, 323 transitions, 3538 flow
[2024-03-09 04:55:38,928 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=2357, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=3538, PETRI_PLACES=271, PETRI_TRANSITIONS=323}
[2024-03-09 04:55:38,929 INFO  L281   CegarLoopForPetriNet]: 135 programPoint places, 136 predicate places.
[2024-03-09 04:55:38,929 INFO  L495      AbstractCegarLoop]: Abstraction has has 271 places, 323 transitions, 3538 flow
[2024-03-09 04:55:38,930 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 71 states, 71 states have (on average 40.50704225352113) internal successors, (2876), 71 states have internal predecessors, (2876), 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-09 04:55:38,930 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 04:55:38,931 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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-09 04:55:38,942 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-03-09 04:55:39,131 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2024-03-09 04:55:39,132 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 04:55:39,132 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 04:55:39,133 INFO  L85        PathProgramCache]: Analyzing trace with hash -1694999606, now seen corresponding path program 4 times
[2024-03-09 04:55:39,133 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 04:55:39,133 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567176292]
[2024-03-09 04:55:39,134 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 04:55:39,134 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 04:55:39,165 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 04:55:41,025 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 04:55:41,025 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 04:55:41,025 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567176292]
[2024-03-09 04:55:41,026 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567176292] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 04:55:41,026 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71355351]
[2024-03-09 04:55:41,026 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-03-09 04:55:41,026 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 04:55:41,026 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 04:55:41,027 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 04:55:41,029 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-03-09 04:55:41,575 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-03-09 04:55:41,576 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 04:55:41,578 INFO  L262         TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 65 conjunts are in the unsatisfiable core
[2024-03-09 04:55:41,585 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 04:55:42,719 INFO  L349             Elim1Store]: treesize reduction 40, result has 21.6 percent of original size
[2024-03-09 04:55:42,720 INFO  L378             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 52 treesize of output 44
[2024-03-09 04:55:42,742 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:55:42,743 INFO  L378             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 16 treesize of output 11
[2024-03-09 04:55:44,024 INFO  L349             Elim1Store]: treesize reduction 40, result has 21.6 percent of original size
[2024-03-09 04:55:44,024 INFO  L378             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 59 treesize of output 49
[2024-03-09 04:55:44,042 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:55:44,043 INFO  L378             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 16 treesize of output 11
[2024-03-09 04:55:44,932 INFO  L378             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-09 04:55:45,178 INFO  L378             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 19 treesize of output 18
[2024-03-09 04:55:45,422 INFO  L378             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 26 treesize of output 28
[2024-03-09 04:55:46,043 INFO  L378             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 33 treesize of output 38
[2024-03-09 04:55:46,422 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:55:46,423 INFO  L378             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 51 treesize of output 35
[2024-03-09 04:55:46,451 INFO  L378             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 7 treesize of output 3
[2024-03-09 04:55:46,573 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:55:46,574 INFO  L378             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 37 treesize of output 26
[2024-03-09 04:55:46,621 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:55:46,622 INFO  L378             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 37 treesize of output 26
[2024-03-09 04:55:46,673 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:55:46,674 INFO  L378             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 37 treesize of output 26
[2024-03-09 04:55:46,718 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:55:46,719 INFO  L378             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 37 treesize of output 26
[2024-03-09 04:55:46,947 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:55:46,950 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:55:46,950 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 41
[2024-03-09 04:55:47,059 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 04:55:47,059 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 04:55:47,366 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_1040 Int) (v_ArrVal_1039 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1039))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1040))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_1040 Int) (v_ArrVal_1039 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1039))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1040))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (forall ((v_ArrVal_1040 Int) (v_ArrVal_1039 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1039))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1040))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_1040 Int) (v_ArrVal_1039 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1039))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1040))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) is different from false
[2024-03-09 04:55:57,953 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse5 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_27| Int) (v_ArrVal_1040 Int) (v_ArrVal_1039 (Array Int Int))) (or (= (select (select (let ((.cse0 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1039))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ .cse2 (* |v_ULTIMATE.start_main_~i~1#1_27| 4)) v_ArrVal_1040))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0) (< |v_ULTIMATE.start_main_~i~1#1_27| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_27| Int) (v_ArrVal_1040 Int) (v_ArrVal_1039 (Array Int Int))) (or (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1039))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ .cse2 (* |v_ULTIMATE.start_main_~i~1#1_27| 4)) v_ArrVal_1040))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_~i~1#1_27| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_27| Int) (v_ArrVal_1040 Int) (v_ArrVal_1039 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~1#1_27| .cse5) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1039))) (store .cse7 .cse1 (store (select .cse7 .cse1) (+ .cse2 (* |v_ULTIMATE.start_main_~i~1#1_27| 4)) v_ArrVal_1040))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0))) (forall ((|v_ULTIMATE.start_main_~i~1#1_27| Int) (v_ArrVal_1040 Int) (v_ArrVal_1039 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~1#1_27| .cse5) (= (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1039))) (store .cse8 .cse1 (store (select .cse8 .cse1) (+ .cse2 (* |v_ULTIMATE.start_main_~i~1#1_27| 4)) v_ArrVal_1040))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))))) is different from false
[2024-03-09 04:55:58,071 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse9 0) .cse6 0)))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_27| Int) (v_ArrVal_1040 Int) (v_ArrVal_1039 (Array Int Int))) (or (= (select (select (let ((.cse0 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1039))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ .cse2 (* |v_ULTIMATE.start_main_~i~1#1_27| 4)) v_ArrVal_1040))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_~i~1#1_27| .cse4))) (forall ((|v_ULTIMATE.start_main_~i~1#1_27| Int) (v_ArrVal_1040 Int) (v_ArrVal_1039 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~1#1_27| .cse4) (= (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1039))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ .cse2 (* |v_ULTIMATE.start_main_~i~1#1_27| 4)) v_ArrVal_1040))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0))) (forall ((|v_ULTIMATE.start_main_~i~1#1_27| Int) (v_ArrVal_1040 Int) (v_ArrVal_1039 (Array Int Int))) (or (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1039))) (store .cse7 .cse1 (store (select .cse7 .cse1) (+ .cse2 (* |v_ULTIMATE.start_main_~i~1#1_27| 4)) v_ArrVal_1040))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0) (< |v_ULTIMATE.start_main_~i~1#1_27| .cse4))) (forall ((|v_ULTIMATE.start_main_~i~1#1_27| Int) (v_ArrVal_1040 Int) (v_ArrVal_1039 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~1#1_27| .cse4) (= (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1039))) (store .cse8 .cse1 (store (select .cse8 .cse1) (+ .cse2 (* |v_ULTIMATE.start_main_~i~1#1_27| 4)) v_ArrVal_1040))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0)))))) is different from false
[2024-03-09 04:55:58,176 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse5 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse8 0) .cse4 0) .cse10 0)))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_27| Int) (v_ArrVal_1040 Int) (v_ArrVal_1039 (Array Int Int))) (or (= (select (select (let ((.cse0 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1039))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ .cse2 (* |v_ULTIMATE.start_main_~i~1#1_27| 4)) v_ArrVal_1040))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0) (< |v_ULTIMATE.start_main_~i~1#1_27| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_27| Int) (v_ArrVal_1040 Int) (v_ArrVal_1039 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~1#1_27| .cse5) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1039))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ .cse2 (* |v_ULTIMATE.start_main_~i~1#1_27| 4)) v_ArrVal_1040))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0))) (forall ((|v_ULTIMATE.start_main_~i~1#1_27| Int) (v_ArrVal_1040 Int) (v_ArrVal_1039 (Array Int Int))) (or (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1039))) (store .cse7 .cse1 (store (select .cse7 .cse1) (+ .cse2 (* |v_ULTIMATE.start_main_~i~1#1_27| 4)) v_ArrVal_1040))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0) (< |v_ULTIMATE.start_main_~i~1#1_27| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_27| Int) (v_ArrVal_1040 Int) (v_ArrVal_1039 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~1#1_27| .cse5) (= (select (select (let ((.cse9 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1039))) (store .cse9 .cse1 (store (select .cse9 .cse1) (+ .cse2 (* |v_ULTIMATE.start_main_~i~1#1_27| 4)) v_ArrVal_1040))) c_threadThread1of1ForFork0_~p~0.base) .cse10) 0)))))) is different from false
[2024-03-09 04:55:58,319 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:55:58,319 INFO  L378             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 85 treesize of output 78
[2024-03-09 04:55:58,338 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:55:58,339 INFO  L378             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 264 treesize of output 252
[2024-03-09 04:55:58,353 INFO  L378             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 221 treesize of output 205
[2024-03-09 04:55:58,371 INFO  L378             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 31 treesize of output 17
[2024-03-09 04:55:58,424 INFO  L378             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 168 treesize of output 146
[2024-03-09 04:55:58,622 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:55:58,623 INFO  L378             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 83 treesize of output 76
[2024-03-09 04:55:58,633 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-09 04:55:58,656 INFO  L349             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2024-03-09 04:55:58,657 INFO  L378             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 144 treesize of output 130
[2024-03-09 04:55:58,678 INFO  L378             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 50 treesize of output 48
[2024-03-09 04:55:58,695 INFO  L378             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 66
[2024-03-09 04:55:58,766 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:55:58,767 INFO  L378             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 85 treesize of output 78
[2024-03-09 04:55:58,775 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-09 04:55:58,797 INFO  L349             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2024-03-09 04:55:58,797 INFO  L378             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 152 treesize of output 138
[2024-03-09 04:55:58,814 INFO  L378             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 88 treesize of output 70
[2024-03-09 04:55:58,828 INFO  L378             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 56 treesize of output 52
[2024-03-09 04:55:58,911 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:55:58,912 INFO  L378             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 85 treesize of output 78
[2024-03-09 04:55:58,922 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-09 04:55:58,950 INFO  L349             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2024-03-09 04:55:58,950 INFO  L378             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 152 treesize of output 138
[2024-03-09 04:55:58,970 INFO  L378             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 56 treesize of output 52
[2024-03-09 04:55:58,988 INFO  L378             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 88 treesize of output 70
[2024-03-09 04:56:00,859 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_15| Int) (v_ArrVal_1027 (Array Int Int)) (v_ArrVal_1026 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1026))) (or (forall ((v_ArrVal_1028 (Array Int Int))) (not (= (select (select (store .cse0 |v_ULTIMATE.start_main_#t~mem12#1.base_15| v_ArrVal_1028) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_1029 (Array Int Int))) (< 0 (+ (div (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1027))) (+ (select (select (store .cse1 |v_ULTIMATE.start_main_#t~mem12#1.base_15| v_ArrVal_1029) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (* (- 1) (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) 4) 1))) (< (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_15|)))) (forall ((v_ArrVal_1026 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1026) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))))) is different from false
[2024-03-09 04:56:01,019 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_26| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_15| Int) (v_ArrVal_1027 (Array Int Int)) (v_ArrVal_1026 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_26| v_ArrVal_1026))) (or (forall ((v_ArrVal_1028 (Array Int Int))) (not (= (select (select (store .cse0 |v_ULTIMATE.start_main_#t~mem12#1.base_15| v_ArrVal_1028) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_1029 (Array Int Int))) (< 0 (+ (div (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem8#1.base_26| v_ArrVal_1027))) (+ (* (- 1) (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (select (select (store .cse1 |v_ULTIMATE.start_main_#t~mem12#1.base_15| v_ArrVal_1029) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) 4) 1))) (< (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_15|)))) (< .cse2 |v_ULTIMATE.start_main_#t~mem8#1.base_26|))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_26| Int)) (or (forall ((v_ArrVal_1026 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_26| v_ArrVal_1026) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (< .cse2 |v_ULTIMATE.start_main_#t~mem8#1.base_26|))))) is different from false
[2024-03-09 04:56:01,164 INFO  L378             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 409 treesize of output 373
[2024-03-09 04:56:01,187 INFO  L378             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 13 treesize of output 11
[2024-03-09 04:56:01,197 INFO  L378             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 17 treesize of output 15
[2024-03-09 04:56:01,207 INFO  L378             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 32 treesize of output 28
[2024-03-09 04:56:01,949 INFO  L349             Elim1Store]: treesize reduction 4, result has 63.6 percent of original size
[2024-03-09 04:56:01,949 INFO  L378             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 45 treesize of output 36
[2024-03-09 04:56:01,957 INFO  L378             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 9
[2024-03-09 04:56:02,280 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked.
[2024-03-09 04:56:02,281 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [71355351] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 04:56:02,281 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 04:56:02,281 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 70
[2024-03-09 04:56:02,282 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378185399]
[2024-03-09 04:56:02,282 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 04:56:02,283 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 71 states
[2024-03-09 04:56:02,284 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 04:56:02,284 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants.
[2024-03-09 04:56:02,285 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=3851, Unknown=44, NotChecked=786, Total=4970
[2024-03-09 04:56:02,547 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136
[2024-03-09 04:56:02,551 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 323 transitions, 3538 flow. Second operand  has 71 states, 71 states have (on average 40.521126760563384) internal successors, (2877), 71 states have internal predecessors, (2877), 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-09 04:56:02,551 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 04:56:02,551 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136
[2024-03-09 04:56:02,551 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 04:56:17,920 INFO  L124   PetriNetUnfolderBase]: 751/2675 cut-off events.
[2024-03-09 04:56:17,921 INFO  L125   PetriNetUnfolderBase]: For 19922/19927 co-relation queries the response was YES.
[2024-03-09 04:56:17,936 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12009 conditions, 2675 events. 751/2675 cut-off events. For 19922/19927 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 19975 event pairs, 117 based on Foata normal form. 21/2696 useless extension candidates. Maximal degree in co-relation 11935. Up to 1149 conditions per place. 
[2024-03-09 04:56:17,945 INFO  L140   encePairwiseOnDemand]: 104/136 looper letters, 325 selfloop transitions, 140 changer transitions 0/487 dead transitions.
[2024-03-09 04:56:17,946 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 487 transitions, 6029 flow
[2024-03-09 04:56:17,946 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. 
[2024-03-09 04:56:17,947 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 39 states.
[2024-03-09 04:56:17,948 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 1701 transitions.
[2024-03-09 04:56:17,948 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3207013574660634
[2024-03-09 04:56:17,949 INFO  L72            ComplementDD]: Start complementDD. Operand 39 states and 1701 transitions.
[2024-03-09 04:56:17,949 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 39 states and 1701 transitions.
[2024-03-09 04:56:17,949 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 04:56:17,949 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 1701 transitions.
[2024-03-09 04:56:17,951 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 40 states, 39 states have (on average 43.61538461538461) internal successors, (1701), 39 states have internal predecessors, (1701), 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-09 04:56:17,955 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 40 states, 40 states have (on average 136.0) internal successors, (5440), 40 states have internal predecessors, (5440), 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-09 04:56:17,955 INFO  L81            ComplementDD]: Finished complementDD. Result  has 40 states, 40 states have (on average 136.0) internal successors, (5440), 40 states have internal predecessors, (5440), 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-09 04:56:17,955 INFO  L175             Difference]: Start difference. First operand has 271 places, 323 transitions, 3538 flow. Second operand 39 states and 1701 transitions.
[2024-03-09 04:56:17,955 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 487 transitions, 6029 flow
[2024-03-09 04:56:18,019 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 487 transitions, 5886 flow, removed 50 selfloop flow, removed 17 redundant places.
[2024-03-09 04:56:18,025 INFO  L231             Difference]: Finished difference. Result has 302 places, 358 transitions, 4519 flow
[2024-03-09 04:56:18,025 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=3421, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=4519, PETRI_PLACES=302, PETRI_TRANSITIONS=358}
[2024-03-09 04:56:18,025 INFO  L281   CegarLoopForPetriNet]: 135 programPoint places, 167 predicate places.
[2024-03-09 04:56:18,026 INFO  L495      AbstractCegarLoop]: Abstraction has has 302 places, 358 transitions, 4519 flow
[2024-03-09 04:56:18,026 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 71 states, 71 states have (on average 40.521126760563384) internal successors, (2877), 71 states have internal predecessors, (2877), 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-09 04:56:18,026 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 04:56:18,026 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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-09 04:56:18,034 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-03-09 04:56:18,227 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 04:56:18,229 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 04:56:18,229 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 04:56:18,230 INFO  L85        PathProgramCache]: Analyzing trace with hash -1371471084, now seen corresponding path program 5 times
[2024-03-09 04:56:18,230 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 04:56:18,230 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386593613]
[2024-03-09 04:56:18,230 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 04:56:18,231 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 04:56:18,258 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 04:56:20,000 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 04:56:20,000 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 04:56:20,001 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386593613]
[2024-03-09 04:56:20,001 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386593613] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 04:56:20,001 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653015684]
[2024-03-09 04:56:20,001 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-03-09 04:56:20,001 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 04:56:20,002 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 04:56:20,003 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 04:56:20,005 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-03-09 04:56:20,274 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-09 04:56:20,274 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 04:56:20,280 INFO  L262         TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 59 conjunts are in the unsatisfiable core
[2024-03-09 04:56:20,286 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 04:56:20,303 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5
[2024-03-09 04:56:20,352 INFO  L349             Elim1Store]: treesize reduction 30, result has 37.5 percent of original size
[2024-03-09 04:56:20,352 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 21 treesize of output 29
[2024-03-09 04:56:20,459 INFO  L349             Elim1Store]: treesize reduction 8, result has 61.9 percent of original size
[2024-03-09 04:56:20,459 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22
[2024-03-09 04:56:20,847 INFO  L349             Elim1Store]: treesize reduction 44, result has 20.0 percent of original size
[2024-03-09 04:56:20,847 INFO  L378             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 54 treesize of output 52
[2024-03-09 04:56:21,527 INFO  L349             Elim1Store]: treesize reduction 40, result has 27.3 percent of original size
[2024-03-09 04:56:21,527 INFO  L378             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 77 treesize of output 73
[2024-03-09 04:56:21,541 INFO  L378             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 20 treesize of output 11
[2024-03-09 04:56:21,551 INFO  L378             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-09 04:56:21,931 INFO  L378             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-09 04:56:22,103 INFO  L378             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-09 04:56:22,211 INFO  L378             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-09 04:56:22,315 INFO  L378             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-09 04:56:22,590 INFO  L378             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 21 treesize of output 13
[2024-03-09 04:56:22,594 INFO  L378             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-09 04:56:22,624 INFO  L378             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 43 treesize of output 32
[2024-03-09 04:56:22,659 INFO  L378             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 43 treesize of output 32
[2024-03-09 04:56:22,727 INFO  L378             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 43 treesize of output 32
[2024-03-09 04:56:22,754 INFO  L378             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 43 treesize of output 32
[2024-03-09 04:56:22,901 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:56:22,903 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:56:22,906 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:56:22,908 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:56:22,911 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:56:22,911 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 47
[2024-03-09 04:56:22,927 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 04:56:22,927 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 04:56:23,206 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_1208 (Array Int Int)) (v_ArrVal_1209 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1208))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1209))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_1208 (Array Int Int)) (v_ArrVal_1209 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1208))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1209))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_1208 (Array Int Int)) (v_ArrVal_1209 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1208))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1209))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (forall ((v_ArrVal_1208 (Array Int Int)) (v_ArrVal_1209 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1208))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1209))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) is different from false
[2024-03-09 04:56:23,313 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1208 (Array Int Int)) (v_ArrVal_1209 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1208))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse2) v_ArrVal_1209))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse3))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1208 (Array Int Int)) (v_ArrVal_1209 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1208))) (store .cse4 .cse1 (store (select .cse4 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse2) v_ArrVal_1209))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse3))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1208 (Array Int Int)) (v_ArrVal_1209 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1208))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse2) v_ArrVal_1209))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse3))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1208 (Array Int Int)) (v_ArrVal_1209 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1208))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse2) v_ArrVal_1209))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse3))))) is different from false
[2024-03-09 04:56:27,481 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_29| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_29| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1208 (Array Int Int)) (v_ArrVal_1209 Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1208))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1209))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse3))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_29| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_29| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1208 (Array Int Int)) (v_ArrVal_1209 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1208))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1209))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse3))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_29| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_29| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1208 (Array Int Int)) (v_ArrVal_1209 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1208))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1209))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse3))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_29| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_29| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1208 (Array Int Int)) (v_ArrVal_1209 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1208))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1209))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse3))))))) is different from false
[2024-03-09 04:56:31,565 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse7 0))) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_29| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_29| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1208 (Array Int Int)) (v_ArrVal_1209 Int)) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1208))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1209))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse4))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_29| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_29| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1208 (Array Int Int)) (v_ArrVal_1209 Int)) (= (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1208))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1209))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse4))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_29| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_29| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1208 (Array Int Int)) (v_ArrVal_1209 Int)) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1208))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1209))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse4))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_29| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_29| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1208 (Array Int Int)) (v_ArrVal_1209 Int)) (= (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1208))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1209))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse4)))))))) is different from false
[2024-03-09 04:56:35,254 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse7 0) .cse9 0))) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_29| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_29| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1208 (Array Int Int)) (v_ArrVal_1209 Int)) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1208))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1209))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse4))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_29| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_29| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1208 (Array Int Int)) (v_ArrVal_1209 Int)) (= (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1208))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1209))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse4))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_29| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_29| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1208 (Array Int Int)) (v_ArrVal_1209 Int)) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1208))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1209))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse4))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_29| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_29| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1208 (Array Int Int)) (v_ArrVal_1209 Int)) (= (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1208))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1209))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse4)))))))) is different from false
[2024-03-09 04:56:37,926 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse10 0) .cse8 0) .cse6 0))) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_29| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_29| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1208 (Array Int Int)) (v_ArrVal_1209 Int)) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1208))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1209))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse4))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_29| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_29| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1208 (Array Int Int)) (v_ArrVal_1209 Int)) (= (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1208))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1209))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse4))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_29| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_29| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1208 (Array Int Int)) (v_ArrVal_1209 Int)) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1208))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1209))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse4))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_29| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_29| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1208 (Array Int Int)) (v_ArrVal_1209 Int)) (= (select (select (let ((.cse9 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1208))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1209))) c_threadThread1of1ForFork0_~p~0.base) .cse10) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse4)))))))) is different from false
[2024-03-09 04:56:38,071 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse3 0) .cse7 0) .cse9 0))) (.cse4 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_1208 (Array Int Int)) (v_ArrVal_1209 Int) (|v_ULTIMATE.start_main_~i~1#1_29| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1208))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1209))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0) (< |v_ULTIMATE.start_main_~i~1#1_29| .cse4) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse5))) (forall ((v_ArrVal_1208 (Array Int Int)) (v_ArrVal_1209 Int) (|v_ULTIMATE.start_main_~i~1#1_29| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (= (select (select (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1208))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1209))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0) (< |v_ULTIMATE.start_main_~i~1#1_29| .cse4) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse5))) (forall ((v_ArrVal_1208 (Array Int Int)) (v_ArrVal_1209 Int) (|v_ULTIMATE.start_main_~i~1#1_29| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_29| .cse4) (= (select (select (let ((.cse8 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1208))) (store .cse8 .cse1 (store (select .cse8 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1209))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse5))) (forall ((v_ArrVal_1208 (Array Int Int)) (v_ArrVal_1209 Int) (|v_ULTIMATE.start_main_~i~1#1_29| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (= (select (select (let ((.cse10 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1208))) (store .cse10 .cse1 (store (select .cse10 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1209))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_~i~1#1_29| .cse4) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse5)))))) is different from false
[2024-03-09 04:56:38,128 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:56:38,128 INFO  L378             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 81 treesize of output 74
[2024-03-09 04:56:38,148 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:56:38,148 INFO  L378             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 444 treesize of output 416
[2024-03-09 04:56:38,168 INFO  L378             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 190 treesize of output 174
[2024-03-09 04:56:38,204 INFO  L378             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 31 treesize of output 17
[2024-03-09 04:56:38,226 INFO  L378             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 149 treesize of output 127
[2024-03-09 04:56:38,402 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 04:56:38,403 INFO  L378             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 79 treesize of output 1
[2024-03-09 04:56:38,414 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 04:56:38,414 INFO  L378             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 81 treesize of output 1
[2024-03-09 04:56:38,425 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 04:56:38,426 INFO  L378             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 81 treesize of output 1
[2024-03-09 04:56:39,301 INFO  L378             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 70 treesize of output 62
[2024-03-09 04:56:39,528 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1196 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1196))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_1198 (Array Int Int))) (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse0 .cse1 v_ArrVal_1198) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (not (= .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|)))))) (forall ((v_ArrVal_1196 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1196) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))))) is different from false
[2024-03-09 04:56:39,632 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_1196 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1196) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_1196 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1196))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#is~0#1.base| .cse1)) (forall ((v_ArrVal_1198 (Array Int Int))) (not (= (select (select (store .cse2 .cse1 v_ArrVal_1198) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))))) is different from false
[2024-03-09 04:56:40,439 INFO  L349             Elim1Store]: treesize reduction 4, result has 63.6 percent of original size
[2024-03-09 04:56:40,440 INFO  L378             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 433 treesize of output 280
[2024-03-09 04:56:40,458 INFO  L378             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 78 treesize of output 70
[2024-03-09 04:56:40,477 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:56:40,477 INFO  L378             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 91 treesize of output 89
[2024-03-09 04:56:40,713 INFO  L349             Elim1Store]: treesize reduction 7, result has 12.5 percent of original size
[2024-03-09 04:56:40,714 INFO  L378             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 22 treesize of output 18
[2024-03-09 04:56:40,814 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked.
[2024-03-09 04:56:40,815 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [653015684] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 04:56:40,815 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 04:56:40,815 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 24] total 62
[2024-03-09 04:56:40,815 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106656705]
[2024-03-09 04:56:40,816 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 04:56:40,816 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 63 states
[2024-03-09 04:56:40,817 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 04:56:40,818 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants.
[2024-03-09 04:56:40,819 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=2662, Unknown=12, NotChecked=1008, Total=3906
[2024-03-09 04:56:40,821 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136
[2024-03-09 04:56:40,822 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 358 transitions, 4519 flow. Second operand  has 63 states, 63 states have (on average 40.6031746031746) internal successors, (2558), 63 states have internal predecessors, (2558), 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-09 04:56:40,823 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 04:56:40,823 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136
[2024-03-09 04:56:40,823 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 04:56:51,218 INFO  L124   PetriNetUnfolderBase]: 824/3293 cut-off events.
[2024-03-09 04:56:51,218 INFO  L125   PetriNetUnfolderBase]: For 30050/30050 co-relation queries the response was YES.
[2024-03-09 04:56:51,233 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14724 conditions, 3293 events. 824/3293 cut-off events. For 30050/30050 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 27720 event pairs, 148 based on Foata normal form. 19/3312 useless extension candidates. Maximal degree in co-relation 14640. Up to 1262 conditions per place. 
[2024-03-09 04:56:51,244 INFO  L140   encePairwiseOnDemand]: 104/136 looper letters, 322 selfloop transitions, 173 changer transitions 0/517 dead transitions.
[2024-03-09 04:56:51,244 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 517 transitions, 7202 flow
[2024-03-09 04:56:51,246 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. 
[2024-03-09 04:56:51,246 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 40 states.
[2024-03-09 04:56:51,248 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 1743 transitions.
[2024-03-09 04:56:51,248 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3204044117647059
[2024-03-09 04:56:51,248 INFO  L72            ComplementDD]: Start complementDD. Operand 40 states and 1743 transitions.
[2024-03-09 04:56:51,249 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 40 states and 1743 transitions.
[2024-03-09 04:56:51,249 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 04:56:51,249 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 1743 transitions.
[2024-03-09 04:56:51,251 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 41 states, 40 states have (on average 43.575) internal successors, (1743), 40 states have internal predecessors, (1743), 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-09 04:56:51,255 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 41 states, 41 states have (on average 136.0) internal successors, (5576), 41 states have internal predecessors, (5576), 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-09 04:56:51,255 INFO  L81            ComplementDD]: Finished complementDD. Result  has 41 states, 41 states have (on average 136.0) internal successors, (5576), 41 states have internal predecessors, (5576), 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-09 04:56:51,256 INFO  L175             Difference]: Start difference. First operand has 302 places, 358 transitions, 4519 flow. Second operand 40 states and 1743 transitions.
[2024-03-09 04:56:51,256 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 517 transitions, 7202 flow
[2024-03-09 04:56:51,363 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 517 transitions, 6981 flow, removed 55 selfloop flow, removed 26 redundant places.
[2024-03-09 04:56:51,370 INFO  L231             Difference]: Finished difference. Result has 330 places, 403 transitions, 5810 flow
[2024-03-09 04:56:51,370 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=4360, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=131, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=5810, PETRI_PLACES=330, PETRI_TRANSITIONS=403}
[2024-03-09 04:56:51,370 INFO  L281   CegarLoopForPetriNet]: 135 programPoint places, 195 predicate places.
[2024-03-09 04:56:51,371 INFO  L495      AbstractCegarLoop]: Abstraction has has 330 places, 403 transitions, 5810 flow
[2024-03-09 04:56:51,371 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 63 states, 63 states have (on average 40.6031746031746) internal successors, (2558), 63 states have internal predecessors, (2558), 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-09 04:56:51,371 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 04:56:51,372 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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-09 04:56:51,380 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2024-03-09 04:56:51,572 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 04:56:51,574 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 04:56:51,574 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 04:56:51,575 INFO  L85        PathProgramCache]: Analyzing trace with hash -947170720, now seen corresponding path program 6 times
[2024-03-09 04:56:51,575 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 04:56:51,575 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845805230]
[2024-03-09 04:56:51,576 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 04:56:51,576 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 04:56:51,613 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 04:56:56,916 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 04:56:56,916 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 04:56:56,916 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845805230]
[2024-03-09 04:56:56,916 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845805230] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 04:56:56,917 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696845889]
[2024-03-09 04:56:56,917 INFO  L93    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2024-03-09 04:56:56,917 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 04:56:56,917 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 04:56:56,919 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 04:56:56,920 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-03-09 04:56:57,087 INFO  L228   tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s)
[2024-03-09 04:56:57,087 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 04:56:57,089 INFO  L262         TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 71 conjunts are in the unsatisfiable core
[2024-03-09 04:56:57,096 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 04:56:57,269 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5
[2024-03-09 04:56:57,407 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:56:57,408 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 7
[2024-03-09 04:56:58,125 INFO  L349             Elim1Store]: treesize reduction 44, result has 20.0 percent of original size
[2024-03-09 04:56:58,126 INFO  L378             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 69 treesize of output 65
[2024-03-09 04:56:58,141 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:56:58,142 INFO  L378             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 24 treesize of output 11
[2024-03-09 04:56:59,316 INFO  L349             Elim1Store]: treesize reduction 44, result has 20.0 percent of original size
[2024-03-09 04:56:59,316 INFO  L378             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-09 04:56:59,329 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:56:59,330 INFO  L378             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 24 treesize of output 11
[2024-03-09 04:57:00,225 INFO  L378             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-09 04:57:00,434 INFO  L378             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 19 treesize of output 18
[2024-03-09 04:57:00,636 INFO  L378             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 26 treesize of output 28
[2024-03-09 04:57:01,463 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:57:01,464 INFO  L378             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 51 treesize of output 39
[2024-03-09 04:57:01,492 INFO  L378             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 7 treesize of output 3
[2024-03-09 04:57:01,620 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:57:01,621 INFO  L378             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 30 treesize of output 21
[2024-03-09 04:57:01,661 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:57:01,662 INFO  L378             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 30 treesize of output 21
[2024-03-09 04:57:01,711 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:57:01,712 INFO  L378             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 30 treesize of output 21
[2024-03-09 04:57:01,748 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:57:01,749 INFO  L378             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 30 treesize of output 21
[2024-03-09 04:57:01,941 INFO  L378             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 33 treesize of output 38
[2024-03-09 04:57:02,114 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:57:02,117 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:57:02,120 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:57:02,122 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:57:02,125 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:57:02,125 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 41
[2024-03-09 04:57:02,242 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 04:57:02,242 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 04:57:03,820 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (forall ((v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1378 Int)) (= (select (select (let ((.cse1 (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1376))) (store .cse4 c_threadThread1of1ForFork0_~p~0.base (store (select .cse4 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse3) v_ArrVal_1378))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int)) (or (forall ((v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1378 Int)) (= (select (select (let ((.cse6 (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1376))) (store .cse7 c_threadThread1of1ForFork0_~p~0.base (store (select .cse7 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse3) v_ArrVal_1378))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (forall ((v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1378 Int)) (= (select (select (let ((.cse8 (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1376))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse3) v_ArrVal_1378))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (forall ((v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1378 Int)) (= (select (select (let ((.cse10 (let ((.cse11 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1376))) (store .cse11 c_threadThread1of1ForFork0_~p~0.base (store (select .cse11 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))))) (store .cse10 .cse2 (store (select .cse10 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse3) v_ArrVal_1378))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))))) is different from false
[2024-03-09 04:57:08,008 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse5 (+ |c_ULTIMATE.start_main_#t~post7#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (forall ((v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1378 Int)) (= (select (select (let ((.cse1 (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1376))) (store .cse3 c_threadThread1of1ForFork0_~p~0.base (store (select .cse3 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_31| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_30|) v_ArrVal_1378))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_31| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (forall ((v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1378 Int)) (= 0 (select (select (let ((.cse6 (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1376))) (store .cse7 c_threadThread1of1ForFork0_~p~0.base (store (select .cse7 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_31| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_30|) v_ArrVal_1378))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)))))) (< |v_ULTIMATE.start_main_~i~1#1_31| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (forall ((v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1378 Int)) (= (select (select (let ((.cse8 (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1376))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_31| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_30|) v_ArrVal_1378))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_31| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (forall ((v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1378 Int)) (= (select (select (let ((.cse10 (let ((.cse11 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1376))) (store .cse11 c_threadThread1of1ForFork0_~p~0.base (store (select .cse11 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse10 .cse2 (store (select .cse10 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_31| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_30|) v_ArrVal_1378))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_31| .cse5))))) is different from false
[2024-03-09 04:57:08,141 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1378 Int) (|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (= (select (select (let ((.cse1 (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1376))) (store .cse3 c_threadThread1of1ForFork0_~p~0.base (store (select .cse3 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_31| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_30|) v_ArrVal_1378))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_~i~1#1_31| .cse5))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1378 Int) (|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (= 0 (select (select (let ((.cse6 (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1376))) (store .cse7 c_threadThread1of1ForFork0_~p~0.base (store (select .cse7 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_31| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_30|) v_ArrVal_1378))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1))) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_31| .cse5))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1378 Int) (|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (= (select (select (let ((.cse8 (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1376))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_31| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_30|) v_ArrVal_1378))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0) (< |v_ULTIMATE.start_main_~i~1#1_31| .cse5))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1378 Int) (|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_31| .cse5) (= (select (select (let ((.cse10 (let ((.cse11 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1376))) (store .cse11 c_threadThread1of1ForFork0_~p~0.base (store (select .cse11 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse10 .cse2 (store (select .cse10 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_31| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_30|) v_ArrVal_1378))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0))))) is different from false
[2024-03-09 04:57:08,384 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse6 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1378 Int) (|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (= (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1376) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1376) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_31| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_30|) v_ArrVal_1378))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0) (< |v_ULTIMATE.start_main_~i~1#1_31| .cse6))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1378 Int) (|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_31| .cse6) (= (select (select (let ((.cse7 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1376) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1376) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_31| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_30|) v_ArrVal_1378))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1378 Int) (|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (= (select (select (let ((.cse8 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1376) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1376) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_31| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_30|) v_ArrVal_1378))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0) (< |v_ULTIMATE.start_main_~i~1#1_31| .cse6))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1378 Int) (|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (= 0 (select (select (let ((.cse9 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1376) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1376) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_31| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_30|) v_ArrVal_1378))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)) (< |v_ULTIMATE.start_main_~i~1#1_31| .cse6)))))) is different from false
[2024-03-09 04:57:08,480 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse10 0) .cse5 0))) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse6 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1378 Int) (|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (= (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1376) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1376) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_31| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_30|) v_ArrVal_1378))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0) (< |v_ULTIMATE.start_main_~i~1#1_31| .cse6))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1378 Int) (|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (= (select (select (let ((.cse7 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1376) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1376) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_31| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_30|) v_ArrVal_1378))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_~i~1#1_31| .cse6))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1378 Int) (|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (= (select (select (let ((.cse8 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1376) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1376) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_31| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_30|) v_ArrVal_1378))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0) (< |v_ULTIMATE.start_main_~i~1#1_31| .cse6))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1378 Int) (|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (= (select (select (let ((.cse9 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1376) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1376) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_31| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_30|) v_ArrVal_1378))) c_threadThread1of1ForFork0_~p~0.base) .cse10) 0) (< |v_ULTIMATE.start_main_~i~1#1_31| .cse6)))))) is different from false
[2024-03-09 04:57:08,535 INFO  L349             Elim1Store]: treesize reduction 54, result has 34.1 percent of original size
[2024-03-09 04:57:08,536 INFO  L378             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 4 case distinctions, treesize of input 240 treesize of output 225
[2024-03-09 04:57:08,555 INFO  L349             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2024-03-09 04:57:08,556 INFO  L378             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 157 treesize of output 151
[2024-03-09 04:57:08,688 INFO  L349             Elim1Store]: treesize reduction 31, result has 62.2 percent of original size
[2024-03-09 04:57:08,689 INFO  L378             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 4 case distinctions, treesize of input 364 treesize of output 300
[2024-03-09 04:57:08,721 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:57:08,722 INFO  L378             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 244 treesize of output 240
[2024-03-09 04:57:08,742 INFO  L378             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 226 treesize of output 210
[2024-03-09 04:57:08,856 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-09 04:57:08,871 INFO  L349             Elim1Store]: treesize reduction 81, result has 1.2 percent of original size
[2024-03-09 04:57:08,871 INFO  L378             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 3 new quantified variables, introduced 4 case distinctions, treesize of input 364 treesize of output 1
[2024-03-09 04:57:08,880 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-09 04:57:08,897 INFO  L349             Elim1Store]: treesize reduction 81, result has 1.2 percent of original size
[2024-03-09 04:57:08,897 INFO  L378             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 3 new quantified variables, introduced 4 case distinctions, treesize of input 348 treesize of output 1
[2024-03-09 04:57:10,248 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1365))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_1366 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1364))) (< (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse0 .cse1 v_ArrVal_1366) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))) (forall ((v_ArrVal_1367 (Array Int Int))) (not (= (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse2 .cse1 v_ArrVal_1367) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))) (forall ((v_ArrVal_1365 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1365) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|)))) is different from false
[2024-03-09 04:57:10,343 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1365))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_1367 (Array Int Int))) (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse0 .cse1 v_ArrVal_1367) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_1366 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1364))) (< (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse2 .cse1 v_ArrVal_1366) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))))))) (forall ((v_ArrVal_1365 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1365) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|))))) is different from false
[2024-03-09 04:57:10,403 INFO  L378             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 279 treesize of output 259
[2024-03-09 04:57:10,418 INFO  L378             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 33 treesize of output 31
[2024-03-09 04:57:10,424 INFO  L378             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 64 treesize of output 60
[2024-03-09 04:57:10,826 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-09 04:57:10,829 INFO  L378             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 10 treesize of output 4
[2024-03-09 04:57:11,072 INFO  L349             Elim1Store]: treesize reduction 4, result has 63.6 percent of original size
[2024-03-09 04:57:11,073 INFO  L378             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 322 treesize of output 205
[2024-03-09 04:57:11,093 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:57:11,093 INFO  L378             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 85 treesize of output 85
[2024-03-09 04:57:11,101 INFO  L378             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 58 treesize of output 54
[2024-03-09 04:57:11,359 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked.
[2024-03-09 04:57:11,360 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [696845889] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 04:57:11,360 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 04:57:11,360 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 24] total 70
[2024-03-09 04:57:11,361 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775041953]
[2024-03-09 04:57:11,361 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 04:57:11,362 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 71 states
[2024-03-09 04:57:11,364 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 04:57:11,364 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants.
[2024-03-09 04:57:11,367 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=3725, Unknown=64, NotChecked=910, Total=4970
[2024-03-09 04:57:12,210 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136
[2024-03-09 04:57:12,213 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 403 transitions, 5810 flow. Second operand  has 71 states, 71 states have (on average 40.50704225352113) internal successors, (2876), 71 states have internal predecessors, (2876), 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-09 04:57:12,213 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 04:57:12,213 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136
[2024-03-09 04:57:12,213 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 04:57:29,305 INFO  L124   PetriNetUnfolderBase]: 866/3248 cut-off events.
[2024-03-09 04:57:29,306 INFO  L125   PetriNetUnfolderBase]: For 41516/41521 co-relation queries the response was YES.
[2024-03-09 04:57:29,322 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16522 conditions, 3248 events. 866/3248 cut-off events. For 41516/41521 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 26439 event pairs, 154 based on Foata normal form. 27/3275 useless extension candidates. Maximal degree in co-relation 16423. Up to 1280 conditions per place. 
[2024-03-09 04:57:29,332 INFO  L140   encePairwiseOnDemand]: 105/136 looper letters, 388 selfloop transitions, 169 changer transitions 0/579 dead transitions.
[2024-03-09 04:57:29,332 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 579 transitions, 8770 flow
[2024-03-09 04:57:29,333 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. 
[2024-03-09 04:57:29,333 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 41 states.
[2024-03-09 04:57:29,334 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 1793 transitions.
[2024-03-09 04:57:29,335 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3215566714490674
[2024-03-09 04:57:29,335 INFO  L72            ComplementDD]: Start complementDD. Operand 41 states and 1793 transitions.
[2024-03-09 04:57:29,335 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 41 states and 1793 transitions.
[2024-03-09 04:57:29,336 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 04:57:29,336 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 41 states and 1793 transitions.
[2024-03-09 04:57:29,338 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 42 states, 41 states have (on average 43.73170731707317) internal successors, (1793), 41 states have internal predecessors, (1793), 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-09 04:57:29,341 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 42 states, 42 states have (on average 136.0) internal successors, (5712), 42 states have internal predecessors, (5712), 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-09 04:57:29,342 INFO  L81            ComplementDD]: Finished complementDD. Result  has 42 states, 42 states have (on average 136.0) internal successors, (5712), 42 states have internal predecessors, (5712), 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-09 04:57:29,342 INFO  L175             Difference]: Start difference. First operand has 330 places, 403 transitions, 5810 flow. Second operand 41 states and 1793 transitions.
[2024-03-09 04:57:29,342 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 579 transitions, 8770 flow
[2024-03-09 04:57:29,541 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 579 transitions, 8593 flow, removed 57 selfloop flow, removed 21 redundant places.
[2024-03-09 04:57:29,548 INFO  L231             Difference]: Finished difference. Result has 358 places, 429 transitions, 6759 flow
[2024-03-09 04:57:29,549 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=5655, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=6759, PETRI_PLACES=358, PETRI_TRANSITIONS=429}
[2024-03-09 04:57:29,549 INFO  L281   CegarLoopForPetriNet]: 135 programPoint places, 223 predicate places.
[2024-03-09 04:57:29,549 INFO  L495      AbstractCegarLoop]: Abstraction has has 358 places, 429 transitions, 6759 flow
[2024-03-09 04:57:29,550 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 71 states, 71 states have (on average 40.50704225352113) internal successors, (2876), 71 states have internal predecessors, (2876), 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-09 04:57:29,550 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 04:57:29,550 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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-09 04:57:29,558 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2024-03-09 04:57:29,751 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12
[2024-03-09 04:57:29,753 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 04:57:29,754 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 04:57:29,754 INFO  L85        PathProgramCache]: Analyzing trace with hash 26831898, now seen corresponding path program 7 times
[2024-03-09 04:57:29,754 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 04:57:29,754 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649799772]
[2024-03-09 04:57:29,755 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 04:57:29,755 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 04:57:29,783 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 04:57:31,617 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 04:57:31,617 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 04:57:31,617 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649799772]
[2024-03-09 04:57:31,617 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649799772] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 04:57:31,618 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950135656]
[2024-03-09 04:57:31,618 INFO  L93    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2024-03-09 04:57:31,618 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 04:57:31,618 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 04:57:31,620 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 04:57:31,621 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2024-03-09 04:57:31,788 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 04:57:31,790 INFO  L262         TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 74 conjunts are in the unsatisfiable core
[2024-03-09 04:57:31,798 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 04:57:31,867 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5
[2024-03-09 04:57:32,050 INFO  L349             Elim1Store]: treesize reduction 30, result has 37.5 percent of original size
[2024-03-09 04:57:32,051 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 21 treesize of output 29
[2024-03-09 04:57:32,168 INFO  L349             Elim1Store]: treesize reduction 8, result has 61.9 percent of original size
[2024-03-09 04:57:32,169 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22
[2024-03-09 04:57:32,828 INFO  L349             Elim1Store]: treesize reduction 44, result has 20.0 percent of original size
[2024-03-09 04:57:32,828 INFO  L378             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 70 treesize of output 64
[2024-03-09 04:57:32,836 INFO  L378             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 24 treesize of output 11
[2024-03-09 04:57:33,801 INFO  L349             Elim1Store]: treesize reduction 40, result has 27.3 percent of original size
[2024-03-09 04:57:33,801 INFO  L378             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 77 treesize of output 73
[2024-03-09 04:57:33,809 INFO  L378             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 20 treesize of output 11
[2024-03-09 04:57:33,816 INFO  L378             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-09 04:57:34,274 INFO  L378             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-09 04:57:34,384 INFO  L378             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 19 treesize of output 18
[2024-03-09 04:57:34,644 INFO  L378             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 26 treesize of output 28
[2024-03-09 04:57:34,777 INFO  L378             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 33 treesize of output 38
[2024-03-09 04:57:35,155 INFO  L378             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 23 treesize of output 11
[2024-03-09 04:57:35,160 INFO  L378             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 7 treesize of output 3
[2024-03-09 04:57:35,281 INFO  L378             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 37 treesize of output 26
[2024-03-09 04:57:35,317 INFO  L378             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 37 treesize of output 26
[2024-03-09 04:57:35,362 INFO  L378             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 37 treesize of output 26
[2024-03-09 04:57:35,407 INFO  L378             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 37 treesize of output 26
[2024-03-09 04:57:35,604 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:57:35,606 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:57:35,609 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:57:35,611 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 04:57:35,614 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:57:35,614 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 41
[2024-03-09 04:57:35,708 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 04:57:35,709 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 04:57:36,019 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1548 Int)) (= 0 (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)))) (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1548 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1548 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1548 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) is different from false
[2024-03-09 04:57:36,124 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse0) (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1548 Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse3) v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse0) (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1548 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse3) v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1548 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse3) v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse0))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1548 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse3) v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse0))))) is different from false
[2024-03-09 04:57:40,286 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_33| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse1) (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1548 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_33| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse1) (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1548 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse4 .cse3 (store (select .cse4 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_33| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1548 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse5 .cse3 (store (select .cse5 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse1))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_33| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse1) (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1548 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse6 .cse3 (store (select .cse6 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))))) is different from false
[2024-03-09 04:57:44,367 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse4 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse6 0)))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse0) (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1548 Int)) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_33| .cse4))) (forall ((|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse0) (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1548 Int)) (= (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_33| .cse4))) (forall ((|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_33| .cse4) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse0) (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1548 Int)) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_33| .cse4) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse0) (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1548 Int)) (= 0 (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)))))))))) is different from false
[2024-03-09 04:57:48,122 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse4 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse9 0) .cse6 0))) (.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_33| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse1) (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1548 Int)) (= (select (select (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_33| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse1) (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1548 Int)) (= (select (select (let ((.cse5 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse5 .cse3 (store (select .cse5 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1548 Int)) (= (select (select (let ((.cse7 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse7 .cse3 (store (select .cse7 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse1))) (< |v_ULTIMATE.start_main_~i~1#1_33| .cse0))) (forall ((|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse1) (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1548 Int)) (= (select (select (let ((.cse8 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse8 .cse3 (store (select .cse8 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_33| .cse0)))))) is different from false
[2024-03-09 04:58:21,525 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse4 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse7 0) .cse5 0) .cse10 0))) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((v_ArrVal_1547 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int) (|v_ULTIMATE.start_main_~i~1#1_33| Int) (v_ArrVal_1548 Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_33| .cse1) (= (select (select (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0))) (forall ((v_ArrVal_1547 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int) (|v_ULTIMATE.start_main_~i~1#1_33| Int) (v_ArrVal_1548 Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse0) (= (select (select (let ((.cse6 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse6 .cse3 (store (select .cse6 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0) (< |v_ULTIMATE.start_main_~i~1#1_33| .cse1))) (forall ((v_ArrVal_1547 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int) (|v_ULTIMATE.start_main_~i~1#1_33| Int) (v_ArrVal_1548 Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse0) (= 0 (select (select (let ((.cse8 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse8 .cse3 (store (select .cse8 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)) (< |v_ULTIMATE.start_main_~i~1#1_33| .cse1))) (forall ((v_ArrVal_1547 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int) (|v_ULTIMATE.start_main_~i~1#1_33| Int) (v_ArrVal_1548 Int)) (or (= (select (select (let ((.cse9 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse9 .cse3 (store (select .cse9 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) .cse10) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_33| .cse1)))))) is different from false
[2024-03-09 04:58:21,600 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:58:21,600 INFO  L378             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 81 treesize of output 74
[2024-03-09 04:58:21,618 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:58:21,619 INFO  L378             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 352 treesize of output 326
[2024-03-09 04:58:21,635 INFO  L378             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 193 treesize of output 177
[2024-03-09 04:58:21,657 INFO  L378             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 31 treesize of output 17
[2024-03-09 04:58:21,692 INFO  L378             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 149 treesize of output 127
[2024-03-09 04:58:21,902 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 04:58:21,902 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 1
[2024-03-09 04:58:21,935 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:58:21,936 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 74
[2024-03-09 04:58:21,947 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-09 04:58:21,971 INFO  L349             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2024-03-09 04:58:21,972 INFO  L378             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 144 treesize of output 130
[2024-03-09 04:58:21,986 INFO  L378             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 80 treesize of output 62
[2024-03-09 04:58:21,999 INFO  L378             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 48 treesize of output 44
[2024-03-09 04:58:22,039 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 04:58:22,039 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 1
[2024-03-09 04:58:23,470 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1535 (Array Int Int)) (v_ArrVal_1534 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1535))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_1536 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1534))) (< (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse0 .cse1 v_ArrVal_1536) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))) (forall ((v_ArrVal_1537 (Array Int Int))) (not (= (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse2 .cse1 v_ArrVal_1537) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))) (forall ((v_ArrVal_1535 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1535) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|)))) is different from false
[2024-03-09 04:58:23,582 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_1535 (Array Int Int)) (v_ArrVal_1534 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1535))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_1537 (Array Int Int))) (not (= (select (select (store .cse0 .cse1 v_ArrVal_1537) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_1536 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1534))) (< (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse2 .cse1 v_ArrVal_1536) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))))))) (forall ((v_ArrVal_1535 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1535) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))) is different from false
[2024-03-09 04:58:23,654 INFO  L378             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 279 treesize of output 259
[2024-03-09 04:58:23,662 INFO  L378             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 122 treesize of output 118
[2024-03-09 04:58:23,668 INFO  L378             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 118 treesize of output 116
[2024-03-09 04:58:24,602 INFO  L349             Elim1Store]: treesize reduction 4, result has 63.6 percent of original size
[2024-03-09 04:58:24,602 INFO  L378             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 813 treesize of output 532
[2024-03-09 04:58:24,628 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 04:58:24,628 INFO  L378             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 99 treesize of output 97
[2024-03-09 04:58:24,638 INFO  L378             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 70 treesize of output 62
[2024-03-09 04:58:24,909 INFO  L349             Elim1Store]: treesize reduction 7, result has 12.5 percent of original size
[2024-03-09 04:58:24,910 INFO  L378             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 22 treesize of output 18
[2024-03-09 04:58:25,017 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked.
[2024-03-09 04:58:25,017 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [950135656] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 04:58:25,017 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 04:58:25,018 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 24] total 71
[2024-03-09 04:58:25,018 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775140432]
[2024-03-09 04:58:25,018 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 04:58:25,018 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 72 states
[2024-03-09 04:58:25,019 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 04:58:25,019 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants.
[2024-03-09 04:58:25,021 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=3708, Unknown=72, NotChecked=1048, Total=5112
[2024-03-09 04:58:25,274 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136
[2024-03-09 04:58:25,276 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 429 transitions, 6759 flow. Second operand  has 72 states, 72 states have (on average 40.486111111111114) internal successors, (2915), 72 states have internal predecessors, (2915), 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-09 04:58:25,276 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 04:58:25,276 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136
[2024-03-09 04:58:25,276 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 04:59:47,903 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 04:59:51,906 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.79s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:00:01,948 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:00:05,961 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:00:09,970 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:00:13,982 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:00:18,005 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:00:22,025 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:00:26,038 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:00:30,071 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:00:34,082 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:00:38,110 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:00:42,145 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:00:46,156 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:00:50,166 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:00:54,177 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:00:58,192 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:01:02,595 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:01:06,795 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:01:10,805 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:01:14,855 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:01:20,412 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:01:21,746 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:01:25,764 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:01:29,776 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:01:33,785 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:01:37,795 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:01:41,805 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:01:53,654 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:01:57,664 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:02:01,676 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:02:05,684 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:02:09,696 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:02:13,725 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:02:17,767 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:02:21,779 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:02:25,790 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:02:29,806 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:02:33,815 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:02:35,041 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:02:39,066 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:02:43,279 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:02:47,290 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:02:51,299 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:02:55,309 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:02:59,986 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:03:04,000 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:03:08,010 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:03:12,019 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:03:16,058 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:03:20,683 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:03:24,697 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:03:28,707 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:03:32,717 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:03:36,731 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:03:40,742 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:03:44,752 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:03:48,765 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 05:03:54,782 INFO  L124   PetriNetUnfolderBase]: 915/3853 cut-off events.
[2024-03-09 05:03:54,782 INFO  L125   PetriNetUnfolderBase]: For 56657/56662 co-relation queries the response was YES.
[2024-03-09 05:03:54,829 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19517 conditions, 3853 events. 915/3853 cut-off events. For 56657/56662 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 34427 event pairs, 160 based on Foata normal form. 21/3874 useless extension candidates. Maximal degree in co-relation 19409. Up to 1504 conditions per place. 
[2024-03-09 05:03:54,859 INFO  L140   encePairwiseOnDemand]: 103/136 looper letters, 389 selfloop transitions, 210 changer transitions 0/621 dead transitions.
[2024-03-09 05:03:54,860 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 621 transitions, 10369 flow
[2024-03-09 05:03:54,866 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. 
[2024-03-09 05:03:54,866 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 43 states.
[2024-03-09 05:03:54,870 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 1875 transitions.
[2024-03-09 05:03:54,871 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.32062243502051985
[2024-03-09 05:03:54,871 INFO  L72            ComplementDD]: Start complementDD. Operand 43 states and 1875 transitions.
[2024-03-09 05:03:54,871 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 43 states and 1875 transitions.
[2024-03-09 05:03:54,872 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:03:54,873 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 1875 transitions.
[2024-03-09 05:03:54,876 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 44 states, 43 states have (on average 43.604651162790695) internal successors, (1875), 43 states have internal predecessors, (1875), 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-09 05:03:54,880 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 44 states, 44 states have (on average 136.0) internal successors, (5984), 44 states have internal predecessors, (5984), 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-09 05:03:54,880 INFO  L81            ComplementDD]: Finished complementDD. Result  has 44 states, 44 states have (on average 136.0) internal successors, (5984), 44 states have internal predecessors, (5984), 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-09 05:03:54,881 INFO  L175             Difference]: Start difference. First operand has 358 places, 429 transitions, 6759 flow. Second operand 43 states and 1875 transitions.
[2024-03-09 05:03:54,881 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 621 transitions, 10369 flow
[2024-03-09 05:03:55,115 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 621 transitions, 10151 flow, removed 42 selfloop flow, removed 30 redundant places.
[2024-03-09 05:03:55,124 INFO  L231             Difference]: Finished difference. Result has 385 places, 477 transitions, 8497 flow
[2024-03-09 05:03:55,125 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=6556, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=166, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=8497, PETRI_PLACES=385, PETRI_TRANSITIONS=477}
[2024-03-09 05:03:55,125 INFO  L281   CegarLoopForPetriNet]: 135 programPoint places, 250 predicate places.
[2024-03-09 05:03:55,125 INFO  L495      AbstractCegarLoop]: Abstraction has has 385 places, 477 transitions, 8497 flow
[2024-03-09 05:03:55,126 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 72 states, 72 states have (on average 40.486111111111114) internal successors, (2915), 72 states have internal predecessors, (2915), 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-09 05:03:55,126 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:03:55,126 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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-09 05:03:55,134 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2024-03-09 05:03:55,327 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2024-03-09 05:03:55,327 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 05:03:55,328 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:03:55,328 INFO  L85        PathProgramCache]: Analyzing trace with hash 1543408080, now seen corresponding path program 8 times
[2024-03-09 05:03:55,329 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:03:55,329 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633057437]
[2024-03-09 05:03:55,329 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:03:55,330 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:03:55,361 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:04:00,654 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:04:00,654 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:04:00,654 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633057437]
[2024-03-09 05:04:00,655 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633057437] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:04:00,655 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67926674]
[2024-03-09 05:04:00,655 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-09 05:04:00,655 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:04:00,656 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:04:00,657 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 05:04:00,658 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2024-03-09 05:04:00,844 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-09 05:04:00,844 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 05:04:00,846 INFO  L262         TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 71 conjunts are in the unsatisfiable core
[2024-03-09 05:04:00,852 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:04:01,142 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5
[2024-03-09 05:04:01,268 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:04:01,269 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 7
[2024-03-09 05:04:02,146 INFO  L349             Elim1Store]: treesize reduction 44, result has 20.0 percent of original size
[2024-03-09 05:04:02,147 INFO  L378             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 69 treesize of output 65
[2024-03-09 05:04:02,165 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:04:02,166 INFO  L378             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 24 treesize of output 11
[2024-03-09 05:04:03,537 INFO  L349             Elim1Store]: treesize reduction 44, result has 20.0 percent of original size
[2024-03-09 05:04:03,538 INFO  L378             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-09 05:04:03,555 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:04:03,556 INFO  L378             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 24 treesize of output 11
[2024-03-09 05:04:04,457 INFO  L378             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-09 05:04:04,741 INFO  L378             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 19 treesize of output 18
[2024-03-09 05:04:05,383 INFO  L378             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 26 treesize of output 28
[2024-03-09 05:04:05,734 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:04:05,735 INFO  L378             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 51 treesize of output 35
[2024-03-09 05:04:05,764 INFO  L378             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 7 treesize of output 3
[2024-03-09 05:04:05,918 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:04:05,919 INFO  L378             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 30 treesize of output 21
[2024-03-09 05:04:05,952 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:04:05,953 INFO  L378             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 30 treesize of output 21
[2024-03-09 05:04:06,003 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:04:06,004 INFO  L378             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 30 treesize of output 21
[2024-03-09 05:04:06,050 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:04:06,051 INFO  L378             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 30 treesize of output 21
[2024-03-09 05:04:06,294 INFO  L378             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 33 treesize of output 38
[2024-03-09 05:04:06,470 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:04:06,472 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:04:06,475 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:04:06,478 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:04:06,482 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:04:06,483 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 41
[2024-03-09 05:04:06,598 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:04:06,598 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 05:04:07,276 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((v_ArrVal_1718 Int) (v_ArrVal_1715 (Array Int Int))) (= 0 (select (select (let ((.cse0 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715))) (store .cse2 c_threadThread1of1ForFork0_~p~0.base (store (select .cse2 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1718))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)))) (forall ((v_ArrVal_1718 Int) (v_ArrVal_1715 (Array Int Int))) (= (select (select (let ((.cse4 (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715))) (store .cse5 c_threadThread1of1ForFork0_~p~0.base (store (select .cse5 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1718))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_1718 Int) (v_ArrVal_1715 (Array Int Int))) (= (select (select (let ((.cse6 (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715))) (store .cse7 c_threadThread1of1ForFork0_~p~0.base (store (select .cse7 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse6 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1718))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_1718 Int) (v_ArrVal_1715 (Array Int Int))) (= (select (select (let ((.cse8 (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse8 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse8 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1718))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0)))) is different from false
[2024-03-09 05:04:07,540 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (forall ((v_ArrVal_1718 Int) (v_ArrVal_1715 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715))) (store .cse3 c_threadThread1of1ForFork0_~p~0.base (store (select .cse3 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse2) v_ArrVal_1718))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse5))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (forall ((v_ArrVal_1718 Int) (v_ArrVal_1715 (Array Int Int))) (= (select (select (let ((.cse6 (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715))) (store .cse7 c_threadThread1of1ForFork0_~p~0.base (store (select .cse7 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse2) v_ArrVal_1718))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse5))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (forall ((v_ArrVal_1718 Int) (v_ArrVal_1715 (Array Int Int))) (= (select (select (let ((.cse8 (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse8 .cse1 (store (select .cse8 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse2) v_ArrVal_1718))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse5))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse5) (forall ((v_ArrVal_1718 Int) (v_ArrVal_1715 (Array Int Int))) (= (select (select (let ((.cse10 (let ((.cse11 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715))) (store .cse11 c_threadThread1of1ForFork0_~p~0.base (store (select .cse11 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse10 .cse1 (store (select .cse10 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse2) v_ArrVal_1718))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))) is different from false
[2024-03-09 05:04:33,791 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse8 0))) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse5 (+ |c_ULTIMATE.start_main_#t~post7#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_35| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse0) (forall ((v_ArrVal_1718 Int) (v_ArrVal_1715 (Array Int Int))) (= (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_35| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_36|) v_ArrVal_1718))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_35| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_35| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse0) (forall ((v_ArrVal_1718 Int) (v_ArrVal_1715 (Array Int Int))) (= 0 (select (select (let ((.cse6 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_35| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_36|) v_ArrVal_1718))) c_threadThread1of1ForFork0_~p~0.base) .cse4))))) (< |v_ULTIMATE.start_main_~i~1#1_35| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_35| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse0) (forall ((v_ArrVal_1718 Int) (v_ArrVal_1715 (Array Int Int))) (= (select (select (let ((.cse7 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_35| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_36|) v_ArrVal_1718))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_35| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_35| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse0) (forall ((v_ArrVal_1718 Int) (v_ArrVal_1715 (Array Int Int))) (= (select (select (let ((.cse9 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_35| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_36|) v_ArrVal_1718))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_35| .cse5)))))) is different from false
[2024-03-09 05:04:33,926 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_1718 Int) (|v_ULTIMATE.start_main_~i~1#1_35| Int) (v_ArrVal_1715 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_35| .cse0) (= (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_35| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_36|) v_ArrVal_1718))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse6))) (forall ((v_ArrVal_1718 Int) (|v_ULTIMATE.start_main_~i~1#1_35| Int) (v_ArrVal_1715 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_35| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse6) (= (select (select (let ((.cse7 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_35| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_36|) v_ArrVal_1718))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0))) (forall ((v_ArrVal_1718 Int) (|v_ULTIMATE.start_main_~i~1#1_35| Int) (v_ArrVal_1715 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (= (select (select (let ((.cse8 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_35| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_36|) v_ArrVal_1718))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_~i~1#1_35| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse6))) (forall ((v_ArrVal_1718 Int) (|v_ULTIMATE.start_main_~i~1#1_35| Int) (v_ArrVal_1715 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_35| .cse0) (= 0 (select (select (let ((.cse9 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_35| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_36|) v_ArrVal_1718))) c_threadThread1of1ForFork0_~p~0.base) .cse4)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse6)))))) is different from false
[2024-03-09 05:04:34,049 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse4 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse7 0) .cse10 0))) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_1718 Int) (|v_ULTIMATE.start_main_~i~1#1_35| Int) (v_ArrVal_1715 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_35| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse1) (= (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_35| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_36|) v_ArrVal_1718))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0))) (forall ((v_ArrVal_1718 Int) (|v_ULTIMATE.start_main_~i~1#1_35| Int) (v_ArrVal_1715 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_35| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse1) (= (select (select (let ((.cse6 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)))) (store .cse6 .cse3 (store (select .cse6 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_35| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_36|) v_ArrVal_1718))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0))) (forall ((v_ArrVal_1718 Int) (|v_ULTIMATE.start_main_~i~1#1_35| Int) (v_ArrVal_1715 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_35| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse1) (= (select (select (let ((.cse8 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)))) (store .cse8 .cse3 (store (select .cse8 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_35| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_36|) v_ArrVal_1718))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0))) (forall ((v_ArrVal_1718 Int) (|v_ULTIMATE.start_main_~i~1#1_35| Int) (v_ArrVal_1715 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (= (select (select (let ((.cse9 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)))) (store .cse9 .cse3 (store (select .cse9 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_35| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_36|) v_ArrVal_1718))) c_threadThread1of1ForFork0_~p~0.base) .cse10) 0) (< |v_ULTIMATE.start_main_~i~1#1_35| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse1)))))) is different from false
[2024-03-09 05:04:34,228 INFO  L349             Elim1Store]: treesize reduction 31, result has 62.2 percent of original size
[2024-03-09 05:04:34,229 INFO  L378             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 4 case distinctions, treesize of input 348 treesize of output 284
[2024-03-09 05:04:34,255 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:04:34,255 INFO  L378             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 228 treesize of output 224
[2024-03-09 05:04:34,275 INFO  L378             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 206 treesize of output 198
[2024-03-09 05:04:34,502 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-09 05:04:34,545 INFO  L349             Elim1Store]: treesize reduction 58, result has 29.3 percent of original size
[2024-03-09 05:04:34,546 INFO  L378             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 3 new quantified variables, introduced 4 case distinctions, treesize of input 364 treesize of output 273
[2024-03-09 05:04:34,554 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-09 05:04:34,558 INFO  L378             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 133 treesize of output 123
[2024-03-09 05:04:34,620 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-09 05:04:34,662 INFO  L349             Elim1Store]: treesize reduction 54, result has 34.1 percent of original size
[2024-03-09 05:04:34,663 INFO  L378             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 3 new quantified variables, introduced 4 case distinctions, treesize of input 240 treesize of output 225
[2024-03-09 05:04:34,670 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-09 05:04:34,687 INFO  L349             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2024-03-09 05:04:34,688 INFO  L378             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 101 treesize of output 95
[2024-03-09 05:04:34,752 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-09 05:04:34,769 INFO  L349             Elim1Store]: treesize reduction 81, result has 1.2 percent of original size
[2024-03-09 05:04:34,769 INFO  L378             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 3 new quantified variables, introduced 4 case distinctions, treesize of input 364 treesize of output 1
[2024-03-09 05:04:40,228 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1703 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1704))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_1706 (Array Int Int))) (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse0 .cse1 v_ArrVal_1706) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_1705 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1703))) (< (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse2 .cse1 v_ArrVal_1705) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))))))) (forall ((v_ArrVal_1704 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1704) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|)))) is different from false
[2024-03-09 05:04:40,331 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_1704 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1704) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_1703 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1704))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_1706 (Array Int Int))) (not (= (select (select (store .cse1 .cse2 v_ArrVal_1706) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_1705 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1703))) (< (select (select .cse3 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse3 .cse2 v_ArrVal_1705) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))))))))) is different from false
[2024-03-09 05:04:40,405 INFO  L378             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 497 treesize of output 461
[2024-03-09 05:04:40,416 INFO  L378             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 15 treesize of output 13
[2024-03-09 05:04:40,422 INFO  L378             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 28 treesize of output 24
[2024-03-09 05:04:40,844 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-09 05:04:40,848 INFO  L378             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 10 treesize of output 4
[2024-03-09 05:04:41,148 INFO  L349             Elim1Store]: treesize reduction 4, result has 63.6 percent of original size
[2024-03-09 05:04:41,149 INFO  L378             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 610 treesize of output 397
[2024-03-09 05:04:41,175 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:04:41,176 INFO  L378             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 99 treesize of output 97
[2024-03-09 05:04:41,184 INFO  L378             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 70 treesize of output 62
[2024-03-09 05:04:41,529 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked.
[2024-03-09 05:04:41,529 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [67926674] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 05:04:41,530 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 05:04:41,530 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 24] total 71
[2024-03-09 05:04:41,530 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765539385]
[2024-03-09 05:04:41,530 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 05:04:41,531 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 72 states
[2024-03-09 05:04:41,532 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:04:41,532 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants.
[2024-03-09 05:04:41,534 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=3884, Unknown=31, NotChecked=924, Total=5112
[2024-03-09 05:04:42,234 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136
[2024-03-09 05:04:42,238 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 477 transitions, 8497 flow. Second operand  has 72 states, 72 states have (on average 40.486111111111114) internal successors, (2915), 72 states have internal predecessors, (2915), 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-09 05:04:42,238 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:04:42,238 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136
[2024-03-09 05:04:42,238 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:05:03,062 INFO  L124   PetriNetUnfolderBase]: 994/4362 cut-off events.
[2024-03-09 05:05:03,062 INFO  L125   PetriNetUnfolderBase]: For 83350/83352 co-relation queries the response was YES.
[2024-03-09 05:05:03,089 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23572 conditions, 4362 events. 994/4362 cut-off events. For 83350/83352 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 40841 event pairs, 180 based on Foata normal form. 27/4389 useless extension candidates. Maximal degree in co-relation 23449. Up to 1554 conditions per place. 
[2024-03-09 05:05:03,100 INFO  L140   encePairwiseOnDemand]: 104/136 looper letters, 435 selfloop transitions, 256 changer transitions 0/713 dead transitions.
[2024-03-09 05:05:03,100 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 713 transitions, 13170 flow
[2024-03-09 05:05:03,101 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. 
[2024-03-09 05:05:03,101 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 41 states.
[2024-03-09 05:05:03,102 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 1817 transitions.
[2024-03-09 05:05:03,103 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.32586083213773315
[2024-03-09 05:05:03,103 INFO  L72            ComplementDD]: Start complementDD. Operand 41 states and 1817 transitions.
[2024-03-09 05:05:03,103 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 41 states and 1817 transitions.
[2024-03-09 05:05:03,104 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:05:03,104 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 41 states and 1817 transitions.
[2024-03-09 05:05:03,106 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 42 states, 41 states have (on average 44.31707317073171) internal successors, (1817), 41 states have internal predecessors, (1817), 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-09 05:05:03,110 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 42 states, 42 states have (on average 136.0) internal successors, (5712), 42 states have internal predecessors, (5712), 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-09 05:05:03,110 INFO  L81            ComplementDD]: Finished complementDD. Result  has 42 states, 42 states have (on average 136.0) internal successors, (5712), 42 states have internal predecessors, (5712), 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-09 05:05:03,110 INFO  L175             Difference]: Start difference. First operand has 385 places, 477 transitions, 8497 flow. Second operand 41 states and 1817 transitions.
[2024-03-09 05:05:03,110 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 713 transitions, 13170 flow
[2024-03-09 05:05:03,516 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 713 transitions, 12945 flow, removed 72 selfloop flow, removed 24 redundant places.
[2024-03-09 05:05:03,526 INFO  L231             Difference]: Finished difference. Result has 413 places, 545 transitions, 11091 flow
[2024-03-09 05:05:03,527 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=8342, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=477, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=196, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=11091, PETRI_PLACES=413, PETRI_TRANSITIONS=545}
[2024-03-09 05:05:03,527 INFO  L281   CegarLoopForPetriNet]: 135 programPoint places, 278 predicate places.
[2024-03-09 05:05:03,527 INFO  L495      AbstractCegarLoop]: Abstraction has has 413 places, 545 transitions, 11091 flow
[2024-03-09 05:05:03,528 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 72 states, 72 states have (on average 40.486111111111114) internal successors, (2915), 72 states have internal predecessors, (2915), 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-09 05:05:03,528 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:05:03,528 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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-09 05:05:03,537 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2024-03-09 05:05:03,729 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:05:03,730 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 05:05:03,730 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:05:03,730 INFO  L85        PathProgramCache]: Analyzing trace with hash 788481042, now seen corresponding path program 9 times
[2024-03-09 05:05:03,731 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:05:03,731 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076645959]
[2024-03-09 05:05:03,731 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:05:03,731 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:05:03,758 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:05:05,682 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:05:05,682 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:05:05,682 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076645959]
[2024-03-09 05:05:05,683 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076645959] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:05:05,683 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893735879]
[2024-03-09 05:05:05,683 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-03-09 05:05:05,683 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:05:05,684 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:05:05,685 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 05:05:05,687 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2024-03-09 05:05:05,876 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-03-09 05:05:05,876 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 05:05:05,878 INFO  L262         TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 63 conjunts are in the unsatisfiable core
[2024-03-09 05:05:05,885 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:05:06,810 INFO  L349             Elim1Store]: treesize reduction 40, result has 21.6 percent of original size
[2024-03-09 05:05:06,810 INFO  L378             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 52 treesize of output 44
[2024-03-09 05:05:06,829 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:05:06,830 INFO  L378             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 16 treesize of output 11
[2024-03-09 05:05:07,888 INFO  L349             Elim1Store]: treesize reduction 44, result has 20.0 percent of original size
[2024-03-09 05:05:07,889 INFO  L378             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-09 05:05:07,905 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:05:07,906 INFO  L378             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 24 treesize of output 11
[2024-03-09 05:05:08,927 INFO  L378             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-09 05:05:09,123 INFO  L378             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 19 treesize of output 18
[2024-03-09 05:05:09,359 INFO  L378             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 26 treesize of output 28
[2024-03-09 05:05:09,608 INFO  L378             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 33 treesize of output 38
[2024-03-09 05:05:10,150 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:05:10,150 INFO  L378             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 51 treesize of output 39
[2024-03-09 05:05:10,172 INFO  L378             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 7 treesize of output 3
[2024-03-09 05:05:10,305 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:05:10,305 INFO  L378             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 37 treesize of output 26
[2024-03-09 05:05:10,354 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:05:10,355 INFO  L378             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 37 treesize of output 26
[2024-03-09 05:05:10,398 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:05:10,399 INFO  L378             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 37 treesize of output 26
[2024-03-09 05:05:10,438 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:05:10,439 INFO  L378             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 37 treesize of output 26
[2024-03-09 05:05:10,641 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:05:10,644 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:05:10,646 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:05:10,648 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:05:10,650 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:05:10,651 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 41
[2024-03-09 05:05:10,758 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:05:10,758 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 05:05:11,101 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)))) is different from false
[2024-03-09 05:05:11,220 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse2) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse3))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse4 .cse1 (store (select .cse4 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse2) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse3))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse2) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse3))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse2) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse3))))) is different from false
[2024-03-09 05:05:15,391 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_37| 4)) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse3))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_37| 4)) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse3))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse3) (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_37| 4)) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_37| 4)) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse3))))))) is different from false
[2024-03-09 05:05:19,476 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse8 0))) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_37| 4)) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse4))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1885 Int)) (= 0 (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_37| 4)) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset))) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse4))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_37| 4)) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse4))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_37| 4)) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse4)))))))) is different from false
[2024-03-09 05:05:23,467 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse9 0) .cse6 0))) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_37| 4)) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse4))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_37| 4)) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse4))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_37| 4)) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse4))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_37| 4)) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse4)))))))) is different from false
[2024-03-09 05:05:26,258 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse10 0) .cse7 0) .cse4 0))) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_37| 4)) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse5))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_37| 4)) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse5))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_37| 4)) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse5))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse9 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_37| 4)) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) .cse10) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse5)))))))) is different from false
[2024-03-09 05:05:26,307 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:05:26,307 INFO  L378             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 81 treesize of output 74
[2024-03-09 05:05:26,332 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:05:26,332 INFO  L378             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 352 treesize of output 326
[2024-03-09 05:05:26,350 INFO  L378             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 193 treesize of output 177
[2024-03-09 05:05:26,366 INFO  L378             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 31 treesize of output 17
[2024-03-09 05:05:26,408 INFO  L378             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 149 treesize of output 127
[2024-03-09 05:05:26,614 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:05:26,615 INFO  L378             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 81 treesize of output 74
[2024-03-09 05:05:26,621 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-09 05:05:26,641 INFO  L349             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2024-03-09 05:05:26,641 INFO  L378             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 144 treesize of output 130
[2024-03-09 05:05:26,660 INFO  L378             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 48 treesize of output 44
[2024-03-09 05:05:26,675 INFO  L378             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 80 treesize of output 62
[2024-03-09 05:05:26,719 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 05:05:26,720 INFO  L378             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 81 treesize of output 1
[2024-03-09 05:05:26,733 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 05:05:26,733 INFO  L378             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 79 treesize of output 1
[2024-03-09 05:05:28,242 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1872 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1872) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_1872 (Array Int Int)) (v_ArrVal_1871 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1872))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_1874 (Array Int Int))) (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse0 .cse1 v_ArrVal_1874) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_1873 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1871))) (< (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse2 .cse1 v_ArrVal_1873) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1))))))))) is different from false
[2024-03-09 05:05:28,364 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_41| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.base_41|) (forall ((v_ArrVal_1872 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_41| v_ArrVal_1872) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_41| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.base_41|) (forall ((v_ArrVal_1872 (Array Int Int)) (v_ArrVal_1871 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_41| v_ArrVal_1872))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_1874 (Array Int Int))) (not (= (select (select (store .cse1 .cse2 v_ArrVal_1874) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_1873 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem8#1.base_41| v_ArrVal_1871))) (< (select (select .cse3 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse3 .cse2 v_ArrVal_1873) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))))))))))) is different from false
[2024-03-09 05:05:28,476 INFO  L378             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 222 treesize of output 202
[2024-03-09 05:05:28,495 INFO  L378             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 50 treesize of output 46
[2024-03-09 05:05:28,502 INFO  L378             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 23 treesize of output 21
[2024-03-09 05:05:28,961 INFO  L378             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 20 treesize of output 18
[2024-03-09 05:05:29,195 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:05:29,195 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 98
[2024-03-09 05:05:29,226 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:05:29,227 INFO  L378             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 33 treesize of output 35
[2024-03-09 05:05:29,572 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked.
[2024-03-09 05:05:29,572 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [893735879] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 05:05:29,573 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 05:05:29,573 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 24] total 70
[2024-03-09 05:05:29,573 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484484653]
[2024-03-09 05:05:29,573 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 05:05:29,574 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 71 states
[2024-03-09 05:05:29,575 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:05:29,575 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants.
[2024-03-09 05:05:29,577 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=3611, Unknown=44, NotChecked=1032, Total=4970
[2024-03-09 05:05:29,579 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136
[2024-03-09 05:05:29,581 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 545 transitions, 11091 flow. Second operand  has 71 states, 71 states have (on average 40.50704225352113) internal successors, (2876), 71 states have internal predecessors, (2876), 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-09 05:05:29,582 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:05:29,582 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136
[2024-03-09 05:05:29,582 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:05:46,659 INFO  L124   PetriNetUnfolderBase]: 1019/4626 cut-off events.
[2024-03-09 05:05:46,659 INFO  L125   PetriNetUnfolderBase]: For 108646/108646 co-relation queries the response was YES.
[2024-03-09 05:05:46,692 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26398 conditions, 4626 events. 1019/4626 cut-off events. For 108646/108646 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 44468 event pairs, 204 based on Foata normal form. 19/4645 useless extension candidates. Maximal degree in co-relation 26264. Up to 1273 conditions per place. 
[2024-03-09 05:05:46,703 INFO  L140   encePairwiseOnDemand]: 104/136 looper letters, 389 selfloop transitions, 298 changer transitions 0/709 dead transitions.
[2024-03-09 05:05:46,703 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 709 transitions, 14649 flow
[2024-03-09 05:05:46,732 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. 
[2024-03-09 05:05:46,732 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 44 states.
[2024-03-09 05:05:46,734 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 1900 transitions.
[2024-03-09 05:05:46,734 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3175133689839572
[2024-03-09 05:05:46,734 INFO  L72            ComplementDD]: Start complementDD. Operand 44 states and 1900 transitions.
[2024-03-09 05:05:46,734 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 44 states and 1900 transitions.
[2024-03-09 05:05:46,735 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:05:46,735 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 1900 transitions.
[2024-03-09 05:05:46,737 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 45 states, 44 states have (on average 43.18181818181818) internal successors, (1900), 44 states have internal predecessors, (1900), 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-09 05:05:46,741 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 45 states, 45 states have (on average 136.0) internal successors, (6120), 45 states have internal predecessors, (6120), 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-09 05:05:46,741 INFO  L81            ComplementDD]: Finished complementDD. Result  has 45 states, 45 states have (on average 136.0) internal successors, (6120), 45 states have internal predecessors, (6120), 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-09 05:05:46,741 INFO  L175             Difference]: Start difference. First operand has 413 places, 545 transitions, 11091 flow. Second operand 44 states and 1900 transitions.
[2024-03-09 05:05:46,741 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 709 transitions, 14649 flow
[2024-03-09 05:05:47,298 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 709 transitions, 14331 flow, removed 88 selfloop flow, removed 26 redundant places.
[2024-03-09 05:05:47,309 INFO  L231             Difference]: Finished difference. Result has 450 places, 587 transitions, 12782 flow
[2024-03-09 05:05:47,309 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=10808, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=257, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=12782, PETRI_PLACES=450, PETRI_TRANSITIONS=587}
[2024-03-09 05:05:47,310 INFO  L281   CegarLoopForPetriNet]: 135 programPoint places, 315 predicate places.
[2024-03-09 05:05:47,310 INFO  L495      AbstractCegarLoop]: Abstraction has has 450 places, 587 transitions, 12782 flow
[2024-03-09 05:05:47,310 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 71 states, 71 states have (on average 40.50704225352113) internal successors, (2876), 71 states have internal predecessors, (2876), 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-09 05:05:47,310 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:05:47,311 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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-09 05:05:47,318 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0
[2024-03-09 05:05:47,511 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2024-03-09 05:05:47,512 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 05:05:47,513 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:05:47,513 INFO  L85        PathProgramCache]: Analyzing trace with hash 2106788088, now seen corresponding path program 10 times
[2024-03-09 05:05:47,513 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:05:47,514 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048100952]
[2024-03-09 05:05:47,514 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:05:47,514 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:05:47,543 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:05:49,920 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:05:49,920 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:05:49,920 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048100952]
[2024-03-09 05:05:49,921 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048100952] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:05:49,921 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714669850]
[2024-03-09 05:05:49,921 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-03-09 05:05:49,921 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:05:49,921 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:05:49,923 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 05:05:49,924 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2024-03-09 05:05:50,464 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-03-09 05:05:50,464 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 05:05:50,467 INFO  L262         TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 77 conjunts are in the unsatisfiable core
[2024-03-09 05:05:50,475 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:05:51,872 INFO  L349             Elim1Store]: treesize reduction 40, result has 21.6 percent of original size
[2024-03-09 05:05:51,872 INFO  L378             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 52 treesize of output 44
[2024-03-09 05:05:51,900 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:05:51,902 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:05:51,905 INFO  L349             Elim1Store]: treesize reduction 7, result has 12.5 percent of original size
[2024-03-09 05:05:51,906 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21
[2024-03-09 05:05:53,387 INFO  L349             Elim1Store]: treesize reduction 44, result has 20.0 percent of original size
[2024-03-09 05:05:53,387 INFO  L378             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-09 05:05:53,410 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:05:53,412 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:05:53,416 INFO  L349             Elim1Store]: treesize reduction 7, result has 12.5 percent of original size
[2024-03-09 05:05:53,417 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 21
[2024-03-09 05:05:54,527 INFO  L378             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-09 05:05:54,746 INFO  L378             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 19 treesize of output 18
[2024-03-09 05:05:55,174 INFO  L378             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 26 treesize of output 28
[2024-03-09 05:05:55,692 INFO  L378             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 33 treesize of output 38
[2024-03-09 05:05:56,111 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:05:56,111 INFO  L378             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 51 treesize of output 35
[2024-03-09 05:05:56,136 INFO  L349             Elim1Store]: treesize reduction 7, result has 12.5 percent of original size
[2024-03-09 05:05:56,136 INFO  L378             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 15 treesize of output 7
[2024-03-09 05:05:56,320 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:05:56,321 INFO  L378             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 37 treesize of output 26
[2024-03-09 05:05:56,369 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:05:56,370 INFO  L378             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 40 treesize of output 48
[2024-03-09 05:05:56,590 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:05:56,592 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 51
[2024-03-09 05:05:56,643 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:05:56,644 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 51
[2024-03-09 05:05:56,981 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:05:56,984 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:05:56,986 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:05:56,988 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:05:56,991 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:05:56,992 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51
[2024-03-09 05:05:57,148 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:05:57,148 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 05:05:59,093 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:05:59,093 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 55 treesize of output 50
[2024-03-09 05:05:59,121 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:05:59,122 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 57 treesize of output 52
[2024-03-09 05:05:59,147 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:05:59,147 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 57 treesize of output 52
[2024-03-09 05:05:59,171 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:05:59,171 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 57 treesize of output 52
[2024-03-09 05:05:59,868 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_main_~#is~0#1.offset| 1)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse0) (forall ((v_arrayElimArr_37 (Array Int Int)) (v_ArrVal_2057 Int)) (or (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_arrayElimArr_37))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse3) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (not (= (select v_arrayElimArr_37 .cse4) 0)))))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int)) (or (forall ((v_ArrVal_2057 Int) (v_arrayElimArr_40 (Array Int Int))) (or (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_arrayElimArr_40))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse3) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0) (not (= (select v_arrayElimArr_40 .cse4) 0)))) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse0))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int)) (or (forall ((v_arrayElimArr_39 (Array Int Int)) (v_ArrVal_2057 Int)) (or (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_arrayElimArr_39))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse3) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0) (not (= (select v_arrayElimArr_39 .cse4) 0)))) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse0))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse0) (forall ((v_arrayElimArr_38 (Array Int Int)) (v_ArrVal_2057 Int)) (or (not (= 0 (select v_arrayElimArr_38 .cse4))) (= (select (select (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_arrayElimArr_38))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse3) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0))))))) is different from false
[2024-03-09 05:06:00,069 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse4 0))) (.cse5 (+ |c_ULTIMATE.start_main_~#is~0#1.offset| 1))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int)) (or (forall ((v_ArrVal_2057 Int) (v_arrayElimArr_40 (Array Int Int))) (or (= (select (select (let ((.cse0 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_arrayElimArr_40))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse2) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0) (not (= (select v_arrayElimArr_40 .cse5) 0)))) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse6))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse6) (forall ((v_arrayElimArr_37 (Array Int Int)) (v_ArrVal_2057 Int)) (or (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_arrayElimArr_37))) (store .cse7 .cse1 (store (select .cse7 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse2) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (not (= (select v_arrayElimArr_37 .cse5) 0)))))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse6) (forall ((v_arrayElimArr_38 (Array Int Int)) (v_ArrVal_2057 Int)) (or (not (= 0 (select v_arrayElimArr_38 .cse5))) (= (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_arrayElimArr_38))) (store .cse8 .cse1 (store (select .cse8 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse2) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0))))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse6) (forall ((v_arrayElimArr_39 (Array Int Int)) (v_ArrVal_2057 Int)) (or (= (select (select (let ((.cse9 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_arrayElimArr_39))) (store .cse9 .cse1 (store (select .cse9 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse2) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0) (not (= (select v_arrayElimArr_39 .cse5) 0))))))))) is different from false
[2024-03-09 05:06:04,170 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse4 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse9 0))) (.cse5 (+ |c_ULTIMATE.start_main_~#is~0#1.offset| 1)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_39| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_39| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse1) (forall ((v_arrayElimArr_38 (Array Int Int)) (v_ArrVal_2057 Int)) (or (= (select (select (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_arrayElimArr_38))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| (* |v_ULTIMATE.start_main_~i~1#1_39| 4)) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0) (not (= 0 (select v_arrayElimArr_38 .cse5))))))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_39| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_39| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int)) (or (forall ((v_arrayElimArr_39 (Array Int Int)) (v_ArrVal_2057 Int)) (or (= (select (select (let ((.cse6 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_arrayElimArr_39))) (store .cse6 .cse3 (store (select .cse6 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| (* |v_ULTIMATE.start_main_~i~1#1_39| 4)) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0) (not (= (select v_arrayElimArr_39 .cse5) 0)))) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse1))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_39| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int)) (or (forall ((v_arrayElimArr_37 (Array Int Int)) (v_ArrVal_2057 Int)) (or (= (select (select (let ((.cse7 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_arrayElimArr_37))) (store .cse7 .cse3 (store (select .cse7 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| (* |v_ULTIMATE.start_main_~i~1#1_39| 4)) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (not (= (select v_arrayElimArr_37 .cse5) 0)))) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse1))) (< |v_ULTIMATE.start_main_~i~1#1_39| .cse0))) (forall ((|v_ULTIMATE.start_main_~i~1#1_39| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_39| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int)) (or (forall ((v_ArrVal_2057 Int) (v_arrayElimArr_40 (Array Int Int))) (or (= (select (select (let ((.cse8 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_arrayElimArr_40))) (store .cse8 .cse3 (store (select .cse8 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| (* |v_ULTIMATE.start_main_~i~1#1_39| 4)) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0) (not (= (select v_arrayElimArr_40 .cse5) 0)))) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse1)))))))) is different from false
[2024-03-09 05:06:08,306 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse3 0) .cse9 0))) (.cse4 (+ |c_ULTIMATE.start_main_~#is~0#1.offset| 1)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_main_#t~post7#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_39| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int)) (or (forall ((v_arrayElimArr_38 (Array Int Int)) (v_ArrVal_2057 Int)) (or (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_arrayElimArr_38))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| (* |v_ULTIMATE.start_main_~i~1#1_39| 4)) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0) (not (= 0 (select v_arrayElimArr_38 .cse4))))) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse5))) (< |v_ULTIMATE.start_main_~i~1#1_39| .cse6))) (forall ((|v_ULTIMATE.start_main_~i~1#1_39| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse5) (forall ((v_arrayElimArr_37 (Array Int Int)) (v_ArrVal_2057 Int)) (or (= (select (select (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_arrayElimArr_37))) (store .cse7 .cse1 (store (select .cse7 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| (* |v_ULTIMATE.start_main_~i~1#1_39| 4)) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (not (= (select v_arrayElimArr_37 .cse4) 0)))))) (< |v_ULTIMATE.start_main_~i~1#1_39| .cse6))) (forall ((|v_ULTIMATE.start_main_~i~1#1_39| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_39| .cse6) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int)) (or (forall ((v_ArrVal_2057 Int) (v_arrayElimArr_40 (Array Int Int))) (or (= (select (select (let ((.cse8 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_arrayElimArr_40))) (store .cse8 .cse1 (store (select .cse8 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| (* |v_ULTIMATE.start_main_~i~1#1_39| 4)) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0) (not (= (select v_arrayElimArr_40 .cse4) 0)))) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse5))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_39| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int)) (or (forall ((v_arrayElimArr_39 (Array Int Int)) (v_ArrVal_2057 Int)) (or (= 0 (select (select (let ((.cse10 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_arrayElimArr_39))) (store .cse10 .cse1 (store (select .cse10 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| (* |v_ULTIMATE.start_main_~i~1#1_39| 4)) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1))) (not (= (select v_arrayElimArr_39 .cse4) 0)))) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse5))) (< |v_ULTIMATE.start_main_~i~1#1_39| .cse6)))))) is different from false
[2024-03-09 05:06:08,516 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse10 0) .cse8 0))) (.cse3 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse5 (+ |c_ULTIMATE.start_main_~#is~0#1.offset| 1)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int) (v_arrayElimArr_39 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_39| Int) (v_ArrVal_2057 Int)) (or (= 0 (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_arrayElimArr_39))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| (* |v_ULTIMATE.start_main_~i~1#1_39| 4)) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1))) (< |v_ULTIMATE.start_main_~i~1#1_39| .cse3) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse4) (not (= (select v_arrayElimArr_39 .cse5) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int) (v_arrayElimArr_37 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_39| Int) (v_ArrVal_2057 Int)) (or (= (select (select (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_arrayElimArr_37))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| (* |v_ULTIMATE.start_main_~i~1#1_39| 4)) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_~i~1#1_39| .cse3) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse4) (not (= (select v_arrayElimArr_37 .cse5) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int) (|v_ULTIMATE.start_main_~i~1#1_39| Int) (v_ArrVal_2057 Int) (v_arrayElimArr_40 (Array Int Int))) (or (= (select (select (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_arrayElimArr_40))) (store .cse7 .cse1 (store (select .cse7 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| (* |v_ULTIMATE.start_main_~i~1#1_39| 4)) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0) (< |v_ULTIMATE.start_main_~i~1#1_39| .cse3) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse4) (not (= (select v_arrayElimArr_40 .cse5) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int) (v_arrayElimArr_38 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_39| Int) (v_ArrVal_2057 Int)) (or (= (select (select (let ((.cse9 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_arrayElimArr_38))) (store .cse9 .cse1 (store (select .cse9 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| (* |v_ULTIMATE.start_main_~i~1#1_39| 4)) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) .cse10) 0) (< |v_ULTIMATE.start_main_~i~1#1_39| .cse3) (not (= 0 (select v_arrayElimArr_38 .cse5))) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse4)))))) is different from false
[2024-03-09 05:06:08,663 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse11 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse9 0) .cse11 0) .cse4 0))) (.cse6 (+ |c_ULTIMATE.start_main_~#is~0#1.offset| 1)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int) (|v_ULTIMATE.start_main_~i~1#1_39| Int) (v_ArrVal_2057 Int) (v_arrayElimArr_40 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~1#1_39| .cse0) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_arrayElimArr_40))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| (* |v_ULTIMATE.start_main_~i~1#1_39| 4)) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse5) (not (= (select v_arrayElimArr_40 .cse6) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int) (v_arrayElimArr_37 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_39| Int) (v_ArrVal_2057 Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_39| .cse0) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_arrayElimArr_37))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| (* |v_ULTIMATE.start_main_~i~1#1_39| 4)) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse5) (not (= (select v_arrayElimArr_37 .cse6) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int) (v_arrayElimArr_39 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_39| Int) (v_ArrVal_2057 Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_39| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse5) (= 0 (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_arrayElimArr_39))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| (* |v_ULTIMATE.start_main_~i~1#1_39| 4)) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) .cse9)) (not (= (select v_arrayElimArr_39 .cse6) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int) (v_arrayElimArr_38 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_39| Int) (v_ArrVal_2057 Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_39| .cse0) (= (select (select (let ((.cse10 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_arrayElimArr_38))) (store .cse10 .cse2 (store (select .cse10 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| (* |v_ULTIMATE.start_main_~i~1#1_39| 4)) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) .cse11) 0) (not (= 0 (select v_arrayElimArr_38 .cse6))) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse5)))))) is different from false
[2024-03-09 05:06:08,722 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:06:08,722 INFO  L378             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 81 treesize of output 74
[2024-03-09 05:06:08,744 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:06:08,745 INFO  L378             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 248 treesize of output 236
[2024-03-09 05:06:08,780 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:06:08,781 INFO  L378             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 205 treesize of output 195
[2024-03-09 05:06:08,810 INFO  L378             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 31 treesize of output 17
[2024-03-09 05:06:08,855 INFO  L378             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 152 treesize of output 130
[2024-03-09 05:06:09,175 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:06:09,176 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 72
[2024-03-09 05:06:09,212 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:06:09,213 INFO  L378             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 412 treesize of output 384
[2024-03-09 05:06:09,250 INFO  L349             Elim1Store]: treesize reduction 9, result has 10.0 percent of original size
[2024-03-09 05:06:09,250 INFO  L378             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 178 treesize of output 166
[2024-03-09 05:06:09,272 INFO  L378             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 31 treesize of output 17
[2024-03-09 05:06:09,320 INFO  L378             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 137 treesize of output 119
[2024-03-09 05:06:09,435 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 05:06:09,436 INFO  L378             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 81 treesize of output 1
[2024-03-09 05:06:09,450 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 05:06:09,451 INFO  L378             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 81 treesize of output 1
[2024-03-09 05:06:11,004 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2039 (Array Int Int)) (v_ArrVal_2040 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2040))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_2042 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2039))) (< (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse0 .cse1 v_ArrVal_2042) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))) (forall ((v_ArrVal_2041 (Array Int Int))) (not (= (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse2 .cse1 v_ArrVal_2041) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))) (forall ((v_ArrVal_2040 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2040) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|)))) is different from false
[2024-03-09 05:06:11,141 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_44| Int)) (or (forall ((v_ArrVal_2040 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_44| v_ArrVal_2040) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.base_44|))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_44| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.base_44|) (forall ((v_ArrVal_2039 (Array Int Int)) (v_ArrVal_2040 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_44| v_ArrVal_2040))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_2042 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem8#1.base_44| v_ArrVal_2039))) (< (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse1 .cse2 v_ArrVal_2042) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))) (forall ((v_ArrVal_2041 (Array Int Int))) (not (= (select (select .cse3 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse3 .cse2 v_ArrVal_2041) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))))))) is different from false
[2024-03-09 05:06:12,368 INFO  L349             Elim1Store]: treesize reduction 4, result has 63.6 percent of original size
[2024-03-09 05:06:12,369 INFO  L378             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 390 treesize of output 317
[2024-03-09 05:06:12,387 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-09 05:06:12,410 INFO  L349             Elim1Store]: treesize reduction 10, result has 9.1 percent of original size
[2024-03-09 05:06:12,410 INFO  L378             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 66 treesize of output 50
[2024-03-09 05:06:12,436 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:06:12,437 INFO  L378             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 97 treesize of output 95
[2024-03-09 05:06:12,447 INFO  L378             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 70 treesize of output 62
[2024-03-09 05:06:12,456 INFO  L378             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 34 treesize of output 30
[2024-03-09 05:06:12,776 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked.
[2024-03-09 05:06:12,777 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714669850] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 05:06:12,777 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 05:06:12,777 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 27] total 75
[2024-03-09 05:06:12,778 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504032969]
[2024-03-09 05:06:12,778 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 05:06:12,778 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 76 states
[2024-03-09 05:06:12,779 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:06:12,780 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants.
[2024-03-09 05:06:12,781 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=4233, Unknown=45, NotChecked=1112, Total=5700
[2024-03-09 05:06:13,571 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136
[2024-03-09 05:06:13,575 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 587 transitions, 12782 flow. Second operand  has 76 states, 76 states have (on average 40.35526315789474) internal successors, (3067), 76 states have internal predecessors, (3067), 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-09 05:06:13,575 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:06:13,575 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136
[2024-03-09 05:06:13,575 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:06:39,486 INFO  L124   PetriNetUnfolderBase]: 1047/4795 cut-off events.
[2024-03-09 05:06:39,487 INFO  L125   PetriNetUnfolderBase]: For 138600/138600 co-relation queries the response was YES.
[2024-03-09 05:06:39,586 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29631 conditions, 4795 events. 1047/4795 cut-off events. For 138600/138600 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 46580 event pairs, 198 based on Foata normal form. 19/4814 useless extension candidates. Maximal degree in co-relation 29477. Up to 1695 conditions per place. 
[2024-03-09 05:06:39,600 INFO  L140   encePairwiseOnDemand]: 102/136 looper letters, 474 selfloop transitions, 275 changer transitions 0/771 dead transitions.
[2024-03-09 05:06:39,600 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 494 places, 771 transitions, 17279 flow
[2024-03-09 05:06:39,601 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. 
[2024-03-09 05:06:39,601 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 45 states.
[2024-03-09 05:06:39,603 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 1955 transitions.
[2024-03-09 05:06:39,604 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3194444444444444
[2024-03-09 05:06:39,604 INFO  L72            ComplementDD]: Start complementDD. Operand 45 states and 1955 transitions.
[2024-03-09 05:06:39,604 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 45 states and 1955 transitions.
[2024-03-09 05:06:39,604 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:06:39,605 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 1955 transitions.
[2024-03-09 05:06:39,607 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 46 states, 45 states have (on average 43.44444444444444) internal successors, (1955), 45 states have internal predecessors, (1955), 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-09 05:06:39,610 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 46 states, 46 states have (on average 136.0) internal successors, (6256), 46 states have internal predecessors, (6256), 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-09 05:06:39,611 INFO  L81            ComplementDD]: Finished complementDD. Result  has 46 states, 46 states have (on average 136.0) internal successors, (6256), 46 states have internal predecessors, (6256), 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-09 05:06:39,611 INFO  L175             Difference]: Start difference. First operand has 450 places, 587 transitions, 12782 flow. Second operand 45 states and 1955 transitions.
[2024-03-09 05:06:39,611 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 494 places, 771 transitions, 17279 flow
[2024-03-09 05:06:40,438 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 477 places, 771 transitions, 16792 flow, removed 159 selfloop flow, removed 17 redundant places.
[2024-03-09 05:06:40,451 INFO  L231             Difference]: Finished difference. Result has 487 places, 623 transitions, 14537 flow
[2024-03-09 05:06:40,451 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=12394, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=587, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=243, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=14537, PETRI_PLACES=487, PETRI_TRANSITIONS=623}
[2024-03-09 05:06:40,452 INFO  L281   CegarLoopForPetriNet]: 135 programPoint places, 352 predicate places.
[2024-03-09 05:06:40,452 INFO  L495      AbstractCegarLoop]: Abstraction has has 487 places, 623 transitions, 14537 flow
[2024-03-09 05:06:40,452 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 76 states, 76 states have (on average 40.35526315789474) internal successors, (3067), 76 states have internal predecessors, (3067), 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-09 05:06:40,453 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:06:40,453 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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-09 05:06:40,461 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0
[2024-03-09 05:06:40,653 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2024-03-09 05:06:40,654 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 05:06:40,655 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:06:40,655 INFO  L85        PathProgramCache]: Analyzing trace with hash 614479100, now seen corresponding path program 11 times
[2024-03-09 05:06:40,656 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:06:40,656 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386241803]
[2024-03-09 05:06:40,656 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:06:40,657 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:06:40,697 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:06:42,996 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:06:42,996 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:06:42,996 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386241803]
[2024-03-09 05:06:42,997 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386241803] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:06:42,997 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809833774]
[2024-03-09 05:06:42,997 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-03-09 05:06:42,997 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:06:42,998 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:06:42,999 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 05:06:43,001 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2024-03-09 05:06:43,509 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-09 05:06:43,510 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 05:06:43,513 INFO  L262         TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 80 conjunts are in the unsatisfiable core
[2024-03-09 05:06:43,520 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:06:43,528 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5
[2024-03-09 05:06:43,637 INFO  L349             Elim1Store]: treesize reduction 18, result has 35.7 percent of original size
[2024-03-09 05:06:43,638 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21
[2024-03-09 05:06:43,867 INFO  L349             Elim1Store]: treesize reduction 52, result has 34.2 percent of original size
[2024-03-09 05:06:43,868 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 28 treesize of output 36
[2024-03-09 05:06:44,047 INFO  L349             Elim1Store]: treesize reduction 8, result has 61.9 percent of original size
[2024-03-09 05:06:44,048 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22
[2024-03-09 05:06:44,934 INFO  L349             Elim1Store]: treesize reduction 44, result has 20.0 percent of original size
[2024-03-09 05:06:44,935 INFO  L378             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 78 treesize of output 70
[2024-03-09 05:06:44,944 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:06:44,944 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11
[2024-03-09 05:06:46,444 INFO  L349             Elim1Store]: treesize reduction 44, result has 20.0 percent of original size
[2024-03-09 05:06:46,445 INFO  L378             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 85 treesize of output 75
[2024-03-09 05:06:46,462 INFO  L378             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 24 treesize of output 11
[2024-03-09 05:06:47,582 INFO  L378             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-09 05:06:47,814 INFO  L378             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 19 treesize of output 18
[2024-03-09 05:06:48,712 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-09 05:06:48,713 INFO  L378             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 60 treesize of output 32
[2024-03-09 05:06:48,744 INFO  L378             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 7 treesize of output 3
[2024-03-09 05:06:48,881 INFO  L378             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 26 treesize of output 28
[2024-03-09 05:06:49,046 INFO  L378             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 33 treesize of output 38
[2024-03-09 05:06:49,210 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:06:49,211 INFO  L378             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 37 treesize of output 26
[2024-03-09 05:06:49,269 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:06:49,270 INFO  L378             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 37 treesize of output 26
[2024-03-09 05:06:49,332 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:06:49,333 INFO  L378             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 37 treesize of output 26
[2024-03-09 05:06:49,371 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:06:49,372 INFO  L378             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 37 treesize of output 26
[2024-03-09 05:06:49,646 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:06:49,649 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:06:49,651 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:06:49,653 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:06:49,656 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:06:49,656 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 41
[2024-03-09 05:06:49,775 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:06:49,776 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 05:06:50,154 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2228 Int)) (= 0 (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2226))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2228))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset))) (forall ((v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2228 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2226))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2228))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (forall ((v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2228 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2226))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2228))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2228 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2226))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2228))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) is different from false
[2024-03-09 05:06:50,253 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (and (forall ((v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2228 Int)) (= 0 (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2226))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2228))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset))) (forall ((v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2228 Int)) (= (select (select (let ((.cse3 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2226))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2228))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)) (forall ((v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2228 Int)) (= (select (select (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2226))) (store .cse5 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2228))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2228 Int)) (= (select (select (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2226))) (store .cse6 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2228))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0))))) is different from false
Killed by 15
