./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-struct-tid.i --full-output --preprocessor.use.memory.slicer true --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version d2ba6107 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-struct-tid.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-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 GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash da100b5cb95d7325be7357bb16aa7526e66fa3d3a90ac0a0850ac9736c0f81ee --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-dev-d2ba610-m [2023-11-21 19:45:53,921 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 19:45:53,982 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2023-11-21 19:45:53,987 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 19:45:53,987 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 19:45:54,007 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 19:45:54,008 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 19:45:54,008 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 19:45:54,009 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 19:45:54,011 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 19:45:54,012 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 19:45:54,012 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 19:45:54,013 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 19:45:54,014 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 19:45:54,014 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 19:45:54,014 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 19:45:54,014 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 19:45:54,014 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 19:45:54,015 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 19:45:54,015 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 19:45:54,015 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 19:45:54,015 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 19:45:54,016 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-21 19:45:54,016 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 19:45:54,016 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 19:45:54,016 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 19:45:54,016 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 19:45:54,016 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 19:45:54,017 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 19:45:54,017 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-21 19:45:54,018 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 19:45:54,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 19:45:54,018 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 19:45:54,018 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 19:45:54,018 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 19:45:54,018 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 19:45:54,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 19:45:54,019 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 19:45:54,019 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2023-11-21 19:45:54,019 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-21 19:45:54,019 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 19:45:54,019 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-21 19:45:54,020 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-11-21 19:45:54,020 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-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 -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-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 -> GemCutter 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 -> da100b5cb95d7325be7357bb16aa7526e66fa3d3a90ac0a0850ac9736c0f81ee Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-21 19:45:54,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 19:45:54,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 19:45:54,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 19:45:54,239 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 19:45:54,240 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 19:45:54,240 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-struct-tid.i [2023-11-21 19:45:55,192 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 19:45:55,390 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 19:45:55,394 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/per-thread-struct-tid.i [2023-11-21 19:45:55,407 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d1af2b080/a9348fe56aac48f1a9378207d6bb6b70/FLAG7e29f55a3 [2023-11-21 19:45:55,419 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d1af2b080/a9348fe56aac48f1a9378207d6bb6b70 [2023-11-21 19:45:55,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 19:45:55,422 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 19:45:55,424 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 19:45:55,424 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 19:45:55,428 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 19:45:55,429 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 07:45:55" (1/1) ... [2023-11-21 19:45:55,429 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fa56058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:45:55, skipping insertion in model container [2023-11-21 19:45:55,430 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 07:45:55" (1/1) ... [2023-11-21 19:45:55,481 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 19:45:55,612 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-21 19:45:55,806 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 19:45:55,813 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 19:45:55,821 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-21 19:45:55,847 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 19:45:55,879 WARN L675 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 19:45:55,885 INFO L206 MainTranslator]: Completed translation [2023-11-21 19:45:55,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:45:55 WrapperNode [2023-11-21 19:45:55,885 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 19:45:55,886 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 19:45:55,886 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 19:45:55,886 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 19:45:55,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:45:55" (1/1) ... [2023-11-21 19:45:55,902 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:45:55" (1/1) ... [2023-11-21 19:45:55,919 INFO L138 Inliner]: procedures = 264, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 76 [2023-11-21 19:45:55,919 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 19:45:55,920 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 19:45:55,920 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 19:45:55,920 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 19:45:55,928 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:45:55" (1/1) ... [2023-11-21 19:45:55,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:45:55" (1/1) ... [2023-11-21 19:45:55,930 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:45:55" (1/1) ... [2023-11-21 19:45:55,939 INFO L193 HeapSplitter]: Split 6 memory accesses to 3 slices as follows [3, 1, 2] [2023-11-21 19:45:55,939 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:45:55" (1/1) ... [2023-11-21 19:45:55,939 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:45:55" (1/1) ... [2023-11-21 19:45:55,945 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:45:55" (1/1) ... [2023-11-21 19:45:55,948 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:45:55" (1/1) ... [2023-11-21 19:45:55,949 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:45:55" (1/1) ... [2023-11-21 19:45:55,950 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:45:55" (1/1) ... [2023-11-21 19:45:55,952 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 19:45:55,953 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 19:45:55,953 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 19:45:55,953 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 19:45:55,954 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:45:55" (1/1) ... [2023-11-21 19:45:55,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 19:45:55,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:45:55,980 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 19:45:55,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 19:45:56,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-21 19:45:56,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-21 19:45:56,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-21 19:45:56,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 19:45:56,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-21 19:45:56,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-21 19:45:56,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-21 19:45:56,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-21 19:45:56,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-21 19:45:56,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-21 19:45:56,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-21 19:45:56,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-21 19:45:56,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-21 19:45:56,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-21 19:45:56,019 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-21 19:45:56,019 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-21 19:45:56,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 19:45:56,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 19:45:56,021 WARN L212 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-21 19:45:56,118 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 19:45:56,119 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 19:45:56,296 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 19:45:56,304 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 19:45:56,307 INFO L308 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-21 19:45:56,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 07:45:56 BoogieIcfgContainer [2023-11-21 19:45:56,309 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 19:45:56,311 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 19:45:56,311 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 19:45:56,314 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 19:45:56,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 07:45:55" (1/3) ... [2023-11-21 19:45:56,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@231dc101 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 07:45:56, skipping insertion in model container [2023-11-21 19:45:56,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:45:55" (2/3) ... [2023-11-21 19:45:56,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@231dc101 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 07:45:56, skipping insertion in model container [2023-11-21 19:45:56,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 07:45:56" (3/3) ... [2023-11-21 19:45:56,316 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-struct-tid.i [2023-11-21 19:45:56,322 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-21 19:45:56,329 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 19:45:56,329 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2023-11-21 19:45:56,329 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 19:45:56,371 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-21 19:45:56,404 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 19:45:56,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 19:45:56,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:45:56,405 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-21 19:45:56,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-11-21 19:45:56,442 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 19:45:56,456 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of1ForFork0 ======== [2023-11-21 19:45:56,461 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=PARTIAL_ORDER_FA, 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;@45d927d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 19:45:56,462 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-21 19:45:56,707 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:45:56,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:45:56,712 INFO L85 PathProgramCache]: Analyzing trace with hash -752109601, now seen corresponding path program 1 times [2023-11-21 19:45:56,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:45:56,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232560237] [2023-11-21 19:45:56,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:45:56,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:45:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:45:56,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:45:56,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:45:56,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232560237] [2023-11-21 19:45:56,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232560237] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:45:56,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:45:56,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 19:45:56,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668650587] [2023-11-21 19:45:56,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:45:56,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-21 19:45:56,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:45:56,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-21 19:45:56,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-21 19:45:56,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:56,952 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:45:56,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 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) [2023-11-21 19:45:56,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:56,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:56,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 19:45:56,975 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:45:56,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:45:56,976 INFO L85 PathProgramCache]: Analyzing trace with hash 123090180, now seen corresponding path program 1 times [2023-11-21 19:45:56,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:45:56,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614747659] [2023-11-21 19:45:56,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:45:56,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:45:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:45:57,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:45:57,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:45:57,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614747659] [2023-11-21 19:45:57,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614747659] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:45:57,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:45:57,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 19:45:57,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827190449] [2023-11-21 19:45:57,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:45:57,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 19:45:57,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:45:57,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 19:45:57,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 19:45:57,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:57,481 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:45:57,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 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) [2023-11-21 19:45:57,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:57,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:57,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:57,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:57,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 19:45:57,625 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:45:57,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:45:57,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1173503134, now seen corresponding path program 1 times [2023-11-21 19:45:57,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:45:57,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121708448] [2023-11-21 19:45:57,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:45:57,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:45:57,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:45:58,258 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:45:58,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:45:58,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121708448] [2023-11-21 19:45:58,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121708448] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:45:58,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820972455] [2023-11-21 19:45:58,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:45:58,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:45:58,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:45:58,317 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:45:58,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-21 19:45:58,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:45:58,416 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-21 19:45:58,421 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:45:58,444 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 [2023-11-21 19:45:58,485 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 19:45:58,486 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 11 treesize of output 11 [2023-11-21 19:45:58,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-21 19:45:58,547 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 23 treesize of output 22 [2023-11-21 19:45:58,562 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:45:58,562 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2023-11-21 19:45:58,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:45:58,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2023-11-21 19:45:58,739 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 45 treesize of output 34 [2023-11-21 19:45:58,748 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:45:58,749 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:45:58,775 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_181 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_181) c_threadThread1of1ForFork0_~t~0.base) (+ 7 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_181 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_181) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)))) (forall ((v_ArrVal_181 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_181) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_181 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_181) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-21 19:45:58,896 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_181 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_181) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_181 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_181) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_181 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_181) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_181 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_181) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 19:45:58,909 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse2 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_181 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_181) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_181 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_181) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_181 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_181) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_181 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_181) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4))))))) is different from false [2023-11-21 19:45:58,923 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) (.cse1 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse3 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_181 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_181) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_181 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_181) c_threadThread1of1ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_181 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_181) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_181 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_181) c_threadThread1of1ForFork0_~t~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 19:45:58,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:45:58,939 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 37 treesize of output 53 [2023-11-21 19:45:58,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:45:58,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 32 [2023-11-21 19:45:58,962 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2023-11-21 19:45:58,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2023-11-21 19:45:58,970 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2023-11-21 19:45:58,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2023-11-21 19:45:58,975 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2023-11-21 19:45:58,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2023-11-21 19:45:59,012 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-11-21 19:45:59,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820972455] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:45:59,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:45:59,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 19 [2023-11-21 19:45:59,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786083276] [2023-11-21 19:45:59,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:45:59,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-21 19:45:59,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:45:59,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-21 19:45:59,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=202, Unknown=4, NotChecked=124, Total=380 [2023-11-21 19:45:59,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:59,022 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:45:59,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.157894736842105) internal successors, (79), 20 states have internal predecessors, (79), 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) [2023-11-21 19:45:59,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:59,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:59,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:59,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:59,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:59,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-21 19:45:59,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-21 19:45:59,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-21 19:45:59,768 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:45:59,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:45:59,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1684441920, now seen corresponding path program 1 times [2023-11-21 19:45:59,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:45:59,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119326699] [2023-11-21 19:45:59,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:45:59,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:45:59,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:46:01,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:46:01,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:46:01,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119326699] [2023-11-21 19:46:01,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119326699] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:46:01,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745473569] [2023-11-21 19:46:01,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:46:01,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:46:01,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:46:01,158 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:46:01,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-21 19:46:01,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:46:01,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-21 19:46:01,249 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:46:01,252 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 [2023-11-21 19:46:01,309 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 19:46:01,310 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 11 treesize of output 11 [2023-11-21 19:46:01,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 19:46:01,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 19:46:01,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-21 19:46:01,611 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 23 treesize of output 22 [2023-11-21 19:46:01,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2023-11-21 19:46:01,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2023-11-21 19:46:01,940 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 [2023-11-21 19:46:01,943 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 [2023-11-21 19:46:01,991 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 45 treesize of output 34 [2023-11-21 19:46:02,006 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 45 treesize of output 34 [2023-11-21 19:46:02,021 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 45 treesize of output 34 [2023-11-21 19:46:02,037 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 45 treesize of output 34 [2023-11-21 19:46:02,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:02,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:02,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:02,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:02,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:02,098 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 56 [2023-11-21 19:46:02,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:46:02,143 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:46:02,285 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse1 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse1 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 7 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_292 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)))) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-21 19:46:02,361 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (let ((.cse2 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse6)) (.cse1 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse6))) (and (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_12| Int)) (or (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_12| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 7 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse2 |v_ULTIMATE.start_main_#t~mem13#1.offset_12|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_12| Int)) (or (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse3 .cse1 (store (select .cse3 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_12| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse2 |v_ULTIMATE.start_main_#t~mem13#1.offset_12|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_12| Int)) (or (< .cse2 |v_ULTIMATE.start_main_#t~mem13#1.offset_12|) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse4 .cse1 (store (select .cse4 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_12| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_12| Int)) (or (< .cse2 |v_ULTIMATE.start_main_#t~mem13#1.offset_12|) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse5 .cse1 (store (select .cse5 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_12| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))))))) is different from false [2023-11-21 19:46:02,438 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_12| Int)) (or (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_12| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse2 |v_ULTIMATE.start_main_#t~mem13#1.offset_12|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_12| Int)) (or (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse3 .cse1 (store (select .cse3 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_12| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse2 |v_ULTIMATE.start_main_#t~mem13#1.offset_12|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_12| Int)) (or (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse4 .cse1 (store (select .cse4 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_12| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse2 |v_ULTIMATE.start_main_#t~mem13#1.offset_12|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_12| Int)) (or (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse5 .cse1 (store (select .cse5 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_12| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 7 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse2 |v_ULTIMATE.start_main_#t~mem13#1.offset_12|))))) is different from false [2023-11-21 19:46:02,601 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse2 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse7 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse0 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_12|) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_12| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_12|) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (let ((.cse4 (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse4 .cse2 (store (select .cse4 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_12| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_12| Int)) (or (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse5 .cse2 (store (select .cse5 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_12| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_12|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_12| Int)) (or (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse6 .cse2 (store (select .cse6 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_12| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse7) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_12|)))))) is different from false [2023-11-21 19:46:02,631 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse7 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse4 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse7 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_12| Int)) (or (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_12| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse4 |v_ULTIMATE.start_main_#t~mem13#1.offset_12|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_12| Int)) (or (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse5 .cse1 (store (select .cse5 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_12| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse4 |v_ULTIMATE.start_main_#t~mem13#1.offset_12|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_12| Int)) (or (< .cse4 |v_ULTIMATE.start_main_#t~mem13#1.offset_12|) (forall ((v_ArrVal_292 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse6 .cse1 (store (select .cse6 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_12| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse7))))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_12| Int)) (or (< .cse4 |v_ULTIMATE.start_main_#t~mem13#1.offset_12|) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (let ((.cse8 (store .cse2 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse8 .cse1 (store (select .cse8 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_12| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))))))) is different from false [2023-11-21 19:46:02,661 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) (.cse3 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse9 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse4 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse7 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse9 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_12| Int)) (or (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_12| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse4 |v_ULTIMATE.start_main_#t~mem13#1.offset_12|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_12| Int)) (or (< .cse4 |v_ULTIMATE.start_main_#t~mem13#1.offset_12|) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse5 .cse1 (store (select .cse5 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_12| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_12| Int)) (or (forall ((v_ArrVal_292 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse6 .cse1 (store (select .cse6 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_12| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse7))) (< .cse4 |v_ULTIMATE.start_main_#t~mem13#1.offset_12|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_12| Int)) (or (< .cse4 |v_ULTIMATE.start_main_#t~mem13#1.offset_12|) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (let ((.cse8 (store .cse2 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse8 .cse1 (store (select .cse8 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_12| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse9) |c_threadThread1of1ForFork0_#t~nondet4|))))))) is different from false [2023-11-21 19:46:02,681 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:02,681 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 72 [2023-11-21 19:46:02,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:02,689 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 290 treesize of output 258 [2023-11-21 19:46:02,696 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 205 treesize of output 189 [2023-11-21 19:46:02,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:02,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 76 [2023-11-21 19:46:02,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:02,827 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 72 [2023-11-21 19:46:02,830 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:02,838 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-21 19:46:02,838 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 170 treesize of output 144 [2023-11-21 19:46:02,844 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 [2023-11-21 19:46:02,849 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 130 treesize of output 86 [2023-11-21 19:46:02,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:02,869 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 72 [2023-11-21 19:46:02,872 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:02,879 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-21 19:46:02,882 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 170 treesize of output 144 [2023-11-21 19:46:02,889 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 [2023-11-21 19:46:02,898 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 130 treesize of output 86 [2023-11-21 19:46:02,912 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2023-11-21 19:46:02,912 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 [2023-11-21 19:46:03,125 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 16 treesize of output 14 [2023-11-21 19:46:03,127 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 13 [2023-11-21 19:46:03,129 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:03,130 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 6 treesize of output 4 [2023-11-21 19:46:03,132 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 16 treesize of output 14 [2023-11-21 19:46:03,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-21 19:46:03,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745473569] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:46:03,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:46:03,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 52 [2023-11-21 19:46:03,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243006552] [2023-11-21 19:46:03,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:46:03,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-11-21 19:46:03,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:46:03,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-11-21 19:46:03,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1956, Unknown=6, NotChecked=570, Total=2756 [2023-11-21 19:46:03,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:03,237 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:46:03,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 3.0) internal successors, (156), 53 states have internal predecessors, (156), 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) [2023-11-21 19:46:03,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:03,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:03,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-11-21 19:46:03,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:05,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:05,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:05,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-21 19:46:05,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:46:05,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-21 19:46:05,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:46:05,863 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:46:05,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:46:05,863 INFO L85 PathProgramCache]: Analyzing trace with hash -374674482, now seen corresponding path program 2 times [2023-11-21 19:46:05,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:46:05,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9735652] [2023-11-21 19:46:05,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:46:05,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:46:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:46:07,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:46:07,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:46:07,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9735652] [2023-11-21 19:46:07,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9735652] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:46:07,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290120608] [2023-11-21 19:46:07,251 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 19:46:07,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:46:07,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:46:07,258 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:46:07,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-21 19:46:07,355 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 19:46:07,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 19:46:07,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-21 19:46:07,363 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:46:07,367 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 [2023-11-21 19:46:07,445 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 19:46:07,446 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 11 treesize of output 11 [2023-11-21 19:46:07,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 19:46:07,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 19:46:07,694 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 [2023-11-21 19:46:07,742 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 [2023-11-21 19:46:07,789 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 [2023-11-21 19:46:07,932 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 7 treesize of output 3 [2023-11-21 19:46:07,934 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 [2023-11-21 19:46:07,970 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 [2023-11-21 19:46:07,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-21 19:46:08,031 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 [2023-11-21 19:46:08,048 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 [2023-11-21 19:46:08,067 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 [2023-11-21 19:46:08,137 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:08,138 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 40 treesize of output 48 [2023-11-21 19:46:08,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:46:08,184 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:46:17,353 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse1 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse5 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_405 (Array Int Int))) (= (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_405))) (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_405 (Array Int Int))) (= (select (select (let ((.cse2 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_405))) (store .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_405 (Array Int Int))) (= (select (select (let ((.cse3 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_405))) (store .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_405 (Array Int Int))) (= (select (select (let ((.cse4 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_405))) (store .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse5) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 19:46:17,372 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (and (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_399 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_399) c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_405))) (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_399 (Array Int Int))) (= (select (select (let ((.cse2 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_399) c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_405))) (store .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_399 (Array Int Int))) (= (select (select (let ((.cse3 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_399) c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_405))) (store .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_399 (Array Int Int))) (= (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_399) c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_405))) (store .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false [2023-11-21 19:46:17,393 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (let ((.cse1 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse7)) (.cse2 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse7)) (.cse3 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (and (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_399 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_399) c_threadThread1of1ForFork0_~t~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_405))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_399 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_399) c_threadThread1of1ForFork0_~t~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_405))) (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)))) (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_399 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_399) c_threadThread1of1ForFork0_~t~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_405))) (store .cse5 .cse1 (store (select .cse5 .cse1) .cse2 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)))) (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_399 (Array Int Int))) (= (select (select (let ((.cse6 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_399) c_threadThread1of1ForFork0_~t~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_405))) (store .cse6 .cse1 (store (select .cse6 .cse1) .cse2 0))) c_threadThread1of1ForFork0_~t~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 19:46:17,443 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse3 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (and (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_399 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_399) c_threadThread1of1ForFork0_~t~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_405))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_399 (Array Int Int))) (= (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_399) c_threadThread1of1ForFork0_~t~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_405))) (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_399 (Array Int Int))) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_399) c_threadThread1of1ForFork0_~t~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_405))) (store .cse5 .cse1 (store (select .cse5 .cse1) .cse2 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_399 (Array Int Int))) (= (select (select (let ((.cse6 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_399) c_threadThread1of1ForFork0_~t~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_405))) (store .cse6 .cse1 (store (select .cse6 .cse1) .cse2 0))) c_threadThread1of1ForFork0_~t~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false [2023-11-21 19:46:17,542 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 6 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse1 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse6 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse4 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (and (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_399 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_399) c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_405))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_399 (Array Int Int))) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_399) c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_405))) (store .cse5 .cse1 (store (select .cse5 .cse1) .cse2 0))) c_threadThread1of1ForFork0_~t~0.base) .cse6) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_399 (Array Int Int))) (= (select (select (let ((.cse7 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_399) c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_405))) (store .cse7 .cse1 (store (select .cse7 .cse1) .cse2 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_399 (Array Int Int))) (= (select (select (let ((.cse8 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_399) c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_405))) (store .cse8 .cse1 (store (select .cse8 .cse1) .cse2 0))) c_threadThread1of1ForFork0_~t~0.base) .cse4) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 19:46:17,562 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) (.cse6 (+ 6 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse1 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse9 |c_threadThread1of1ForFork0_#t~nondet4|) .cse6 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse4 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (and (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_399 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_399) c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_405))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 0))) c_threadThread1of1ForFork0_~t~0.base) .cse4))) (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_399 (Array Int Int))) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_399) c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_405))) (store .cse5 .cse1 (store (select .cse5 .cse1) .cse2 0))) c_threadThread1of1ForFork0_~t~0.base) .cse6) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_399 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_399) c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_405))) (store .cse7 .cse1 (store (select .cse7 .cse1) .cse2 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_399 (Array Int Int))) (= (select (select (let ((.cse8 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_399) c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_405))) (store .cse8 .cse1 (store (select .cse8 .cse1) .cse2 0))) c_threadThread1of1ForFork0_~t~0.base) .cse9) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 19:46:17,600 INFO L349 Elim1Store]: treesize reduction 33, result has 61.6 percent of original size [2023-11-21 19:46:17,600 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 1710 treesize of output 1554 [2023-11-21 19:46:17,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:17,614 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 356 treesize of output 326 [2023-11-21 19:46:17,626 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 231 treesize of output 215 [2023-11-21 19:46:17,712 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:17,729 INFO L349 Elim1Store]: treesize reduction 60, result has 30.2 percent of original size [2023-11-21 19:46:17,730 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 710 treesize of output 523 [2023-11-21 19:46:17,738 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 88 treesize of output 84 [2023-11-21 19:46:17,741 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:17,743 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 164 treesize of output 146 [2023-11-21 19:46:17,763 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:17,788 INFO L349 Elim1Store]: treesize reduction 60, result has 30.2 percent of original size [2023-11-21 19:46:17,789 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 710 treesize of output 523 [2023-11-21 19:46:17,805 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 88 treesize of output 84 [2023-11-21 19:46:17,808 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:17,810 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 196 treesize of output 170 [2023-11-21 19:46:17,830 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:17,847 INFO L349 Elim1Store]: treesize reduction 60, result has 30.2 percent of original size [2023-11-21 19:46:17,849 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 710 treesize of output 523 [2023-11-21 19:46:17,860 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 88 treesize of output 84 [2023-11-21 19:46:17,863 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:17,865 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 196 treesize of output 170 [2023-11-21 19:46:18,455 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 13 [2023-11-21 19:46:18,459 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 [2023-11-21 19:46:18,463 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 17 treesize of output 15 [2023-11-21 19:46:18,465 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 10 [2023-11-21 19:46:18,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-21 19:46:18,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290120608] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:46:18,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:46:18,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18, 19] total 54 [2023-11-21 19:46:18,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882898189] [2023-11-21 19:46:18,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:46:18,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-11-21 19:46:18,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:46:18,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-11-21 19:46:18,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=2157, Unknown=25, NotChecked=594, Total=2970 [2023-11-21 19:46:18,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:18,647 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:46:18,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.888888888888889) internal successors, (156), 55 states have internal predecessors, (156), 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) [2023-11-21 19:46:18,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:18,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:18,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-11-21 19:46:18,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:46:18,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:24,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:24,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:24,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-21 19:46:24,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-21 19:46:24,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-21 19:46:24,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-21 19:46:24,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:46:24,256 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:46:24,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:46:24,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1322926626, now seen corresponding path program 3 times [2023-11-21 19:46:24,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:46:24,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809325057] [2023-11-21 19:46:24,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:46:24,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:46:24,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:46:25,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:46:25,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:46:25,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809325057] [2023-11-21 19:46:25,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809325057] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:46:25,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089624896] [2023-11-21 19:46:25,365 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-21 19:46:25,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:46:25,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:46:25,366 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:46:25,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-21 19:46:25,484 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-21 19:46:25,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 19:46:25,486 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-21 19:46:25,490 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:46:25,493 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 [2023-11-21 19:46:25,513 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 19:46:25,513 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 11 treesize of output 11 [2023-11-21 19:46:25,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 19:46:25,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 19:46:25,794 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 [2023-11-21 19:46:25,832 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 [2023-11-21 19:46:25,963 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 7 treesize of output 3 [2023-11-21 19:46:25,965 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 [2023-11-21 19:46:26,001 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 23 treesize of output 16 [2023-11-21 19:46:26,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-21 19:46:26,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-21 19:46:26,105 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 [2023-11-21 19:46:26,116 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 [2023-11-21 19:46:26,135 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 [2023-11-21 19:46:26,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:26,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:26,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:26,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:26,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:26,204 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 40 treesize of output 48 [2023-11-21 19:46:26,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:46:26,245 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:46:26,338 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_518 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_518))) (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_518 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_518))) (store .cse1 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse1 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 7 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_518 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_518))) (store .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_518 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_518))) (store .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-21 19:46:26,374 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse1 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_518 (Array Int Int))) (= (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_518))) (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_518 (Array Int Int))) (= (select (select (let ((.cse3 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_518))) (store .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_518 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse4 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_518))) (store .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)))) (forall ((v_ArrVal_518 (Array Int Int))) (= (select (select (let ((.cse5 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_518))) (store .cse5 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 19:46:26,389 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse2 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse1 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse6 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_518 (Array Int Int))) (= (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_518))) (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_518 (Array Int Int))) (= (select (select (let ((.cse3 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_518))) (store .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_518 (Array Int Int))) (= (select (select (let ((.cse4 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_518))) (store .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_518 (Array Int Int))) (= (select (select (let ((.cse5 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_518))) (store .cse5 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse6) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 19:46:26,418 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 7 c_threadThread1of1ForFork0_~t~0.offset)) (.cse1 (+ 6 c_threadThread1of1ForFork0_~t~0.offset))) (and (forall ((v_ArrVal_518 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_510) c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_518))) (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)))) (forall ((v_ArrVal_518 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (= (select (select (let ((.cse3 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_510) c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_518))) (store .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_518 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (= (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_510) c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_518))) (store .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_518 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_510) c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_518))) (store .cse5 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false [2023-11-21 19:46:26,459 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse8)) (.cse2 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse8)) (.cse3 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse4 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (and (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_14| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_14|) (forall ((v_ArrVal_518 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (= (select (select (let ((.cse1 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_510) c_threadThread1of1ForFork0_~t~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_518))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_14| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_14| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_14|) (forall ((v_ArrVal_518 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_510) c_threadThread1of1ForFork0_~t~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_518))) (store .cse5 .cse2 (store (select .cse5 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_14| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_14| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_14|) (forall ((v_ArrVal_518 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (= (select (select (let ((.cse6 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_510) c_threadThread1of1ForFork0_~t~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_518))) (store .cse6 .cse2 (store (select .cse6 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_14| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse4) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_14| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_14|) (forall ((v_ArrVal_518 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (= (select (select (let ((.cse7 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_510) c_threadThread1of1ForFork0_~t~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_518))) (store .cse7 .cse2 (store (select .cse7 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_14| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))))))) is different from false [2023-11-21 19:46:26,562 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse2 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse3 (+ 7 c_threadThread1of1ForFork0_~t~0.offset)) (.cse4 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_14| Int)) (or (forall ((v_ArrVal_518 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_510) c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_518))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_14| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse4 |v_ULTIMATE.start_main_#t~mem13#1.offset_14|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_14| Int)) (or (< .cse4 |v_ULTIMATE.start_main_#t~mem13#1.offset_14|) (forall ((v_ArrVal_518 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_510) c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_518))) (store .cse5 .cse1 (store (select .cse5 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_14| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_14| Int)) (or (forall ((v_ArrVal_518 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (= (select (select (let ((.cse6 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_510) c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_518))) (store .cse6 .cse1 (store (select .cse6 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_14| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse4 |v_ULTIMATE.start_main_#t~mem13#1.offset_14|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_14| Int)) (or (forall ((v_ArrVal_518 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_510) c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_518))) (store .cse7 .cse1 (store (select .cse7 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_14| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)))) (< .cse4 |v_ULTIMATE.start_main_#t~mem13#1.offset_14|))))) is different from false [2023-11-21 19:46:26,771 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (+ 5 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse9 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse4 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse5 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (and (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_14| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_14|) (forall ((v_ArrVal_518 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (= (select (select (let ((.cse1 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_510) c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|) .cse5 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_518))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_14| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_14| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_14|) (forall ((v_ArrVal_518 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_510) c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|) .cse5 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_518))) (store .cse6 .cse2 (store (select .cse6 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_14| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse5))))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_14| Int)) (or (forall ((v_ArrVal_518 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (= (select (select (let ((.cse7 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_510) c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|) .cse5 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_518))) (store .cse7 .cse2 (store (select .cse7 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_14| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse4) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_14|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_14| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_14|) (forall ((v_ArrVal_518 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (= (select (select (let ((.cse8 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_510) c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|) .cse5 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_518))) (store .cse8 .cse2 (store (select .cse8 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_14| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse9) |c_threadThread1of1ForFork0_#t~nondet4|))))))) is different from false [2023-11-21 19:46:26,811 INFO L349 Elim1Store]: treesize reduction 28, result has 63.2 percent of original size [2023-11-21 19:46:26,812 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 1070 treesize of output 913 [2023-11-21 19:46:26,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:26,828 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 419 treesize of output 379 [2023-11-21 19:46:26,840 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 117 treesize of output 113 [2023-11-21 19:46:26,846 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 230 treesize of output 214 [2023-11-21 19:46:26,942 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:26,948 INFO L349 Elim1Store]: treesize reduction 75, result has 1.3 percent of original size [2023-11-21 19:46:26,948 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 414 treesize of output 1 [2023-11-21 19:46:26,951 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:26,966 INFO L349 Elim1Store]: treesize reduction 55, result has 27.6 percent of original size [2023-11-21 19:46:26,966 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 638 treesize of output 496 [2023-11-21 19:46:26,978 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:26,980 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 168 treesize of output 144 [2023-11-21 19:46:26,985 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 69 treesize of output 65 [2023-11-21 19:46:27,007 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:27,014 INFO L349 Elim1Store]: treesize reduction 75, result has 1.3 percent of original size [2023-11-21 19:46:27,015 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 414 treesize of output 1 [2023-11-21 19:46:27,221 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 13 [2023-11-21 19:46:27,223 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 [2023-11-21 19:46:27,226 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 16 treesize of output 14 [2023-11-21 19:46:27,227 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 16 treesize of output 14 [2023-11-21 19:46:27,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-21 19:46:27,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089624896] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:46:27,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:46:27,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 19] total 47 [2023-11-21 19:46:27,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001939913] [2023-11-21 19:46:27,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:46:27,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-11-21 19:46:27,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:46:27,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-11-21 19:46:27,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1502, Unknown=7, NotChecked=588, Total=2256 [2023-11-21 19:46:27,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:27,363 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:46:27,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 3.0638297872340425) internal successors, (144), 48 states have internal predecessors, (144), 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) [2023-11-21 19:46:27,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:27,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:27,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-21 19:46:27,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2023-11-21 19:46:27,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2023-11-21 19:46:27,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:30,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:30,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:30,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-21 19:46:30,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-21 19:46:30,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-21 19:46:30,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-21 19:46:30,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-21 19:46:30,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-21 19:46:30,329 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:46:30,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:46:30,330 INFO L85 PathProgramCache]: Analyzing trace with hash -246107600, now seen corresponding path program 4 times [2023-11-21 19:46:30,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:46:30,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398320526] [2023-11-21 19:46:30,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:46:30,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:46:30,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:46:31,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:46:31,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:46:31,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398320526] [2023-11-21 19:46:31,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398320526] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:46:31,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461292566] [2023-11-21 19:46:31,557 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-21 19:46:31,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:46:31,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:46:31,558 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:46:31,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-21 19:46:31,711 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-21 19:46:31,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 19:46:31,713 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-21 19:46:31,727 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:46:31,731 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 [2023-11-21 19:46:31,813 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 19:46:31,813 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 11 treesize of output 11 [2023-11-21 19:46:31,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 19:46:31,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 19:46:32,088 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 [2023-11-21 19:46:32,199 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 7 treesize of output 3 [2023-11-21 19:46:32,202 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 [2023-11-21 19:46:32,248 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 23 treesize of output 11 [2023-11-21 19:46:32,269 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 19 treesize of output 18 [2023-11-21 19:46:32,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-21 19:46:32,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-21 19:46:32,484 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 44 treesize of output 41 [2023-11-21 19:46:32,503 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 [2023-11-21 19:46:32,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 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 [2023-11-21 19:46:32,677 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 47 treesize of output 58 [2023-11-21 19:46:32,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:46:32,734 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:46:43,651 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 13 [2023-11-21 19:46:43,654 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 [2023-11-21 19:46:43,656 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 17 treesize of output 15 [2023-11-21 19:46:43,658 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 10 [2023-11-21 19:46:44,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:46:44,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461292566] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:46:44,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:46:44,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 20] total 56 [2023-11-21 19:46:44,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296306400] [2023-11-21 19:46:44,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:46:44,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-11-21 19:46:44,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:46:44,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-11-21 19:46:44,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=2912, Unknown=0, NotChecked=0, Total=3192 [2023-11-21 19:46:44,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:44,655 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:46:44,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 2.7857142857142856) internal successors, (156), 57 states have internal predecessors, (156), 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) [2023-11-21 19:46:44,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:44,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:44,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-11-21 19:46:44,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2023-11-21 19:46:44,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2023-11-21 19:46:44,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-11-21 19:46:44,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:53,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:53,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:53,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-21 19:46:53,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-21 19:46:53,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-21 19:46:53,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-21 19:46:53,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-21 19:46:53,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-21 19:46:54,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:46:54,110 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:46:54,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:46:54,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1465561092, now seen corresponding path program 5 times [2023-11-21 19:46:54,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:46:54,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735512705] [2023-11-21 19:46:54,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:46:54,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:46:54,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:46:55,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:46:55,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:46:55,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735512705] [2023-11-21 19:46:55,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735512705] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:46:55,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057364023] [2023-11-21 19:46:55,132 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-21 19:46:55,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:46:55,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:46:55,133 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:46:55,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-21 19:46:55,241 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 19:46:55,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 19:46:55,242 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-21 19:46:55,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:46:55,249 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 [2023-11-21 19:46:55,269 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 19:46:55,269 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 11 treesize of output 11 [2023-11-21 19:46:55,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 19:46:55,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 19:46:55,555 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 7 treesize of output 3 [2023-11-21 19:46:55,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 15 treesize of output 7 [2023-11-21 19:46:55,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 19:46:55,620 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 19 treesize of output 18 [2023-11-21 19:46:55,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-21 19:46:55,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-21 19:46:55,751 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 [2023-11-21 19:46:55,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 37 treesize of output 26 [2023-11-21 19:46:55,782 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 [2023-11-21 19:46:55,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:55,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:55,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:55,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:55,854 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:55,855 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 40 treesize of output 48 [2023-11-21 19:46:55,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:46:55,898 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:46:56,122 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_744 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_744))) (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)))) (forall ((v_ArrVal_744 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_744))) (store .cse1 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse1 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 7 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_744 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_744))) (store .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_744 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_744))) (store .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset))))) is different from false [2023-11-21 19:46:56,168 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse1 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse5 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_744 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_744))) (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)))) (forall ((v_ArrVal_744 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse2 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_744))) (store .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)))) (forall ((v_ArrVal_744 (Array Int Int))) (= (select (select (let ((.cse3 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_744))) (store .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_744 (Array Int Int))) (= (select (select (let ((.cse4 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_744))) (store .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse5) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 19:46:56,186 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse5 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse1 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse5 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_744 (Array Int Int))) (= (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_744))) (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_744 (Array Int Int))) (= (select (select (let ((.cse3 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_744))) (store .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_744 (Array Int Int))) (= (select (select (let ((.cse4 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_744))) (store .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse5) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_744 (Array Int Int))) (= (select (select (let ((.cse6 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_744))) (store .cse6 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 19:46:56,311 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:56,311 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 73 treesize of output 64 [2023-11-21 19:46:56,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:56,318 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 242 treesize of output 214 [2023-11-21 19:46:56,331 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 173 treesize of output 157 [2023-11-21 19:46:56,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:56,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 65 [2023-11-21 19:46:56,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:56,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 73 treesize of output 64 [2023-11-21 19:46:56,411 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:56,418 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 19:46:56,418 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 142 treesize of output 120 [2023-11-21 19:46:56,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 40 treesize of output 36 [2023-11-21 19:46:56,427 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 114 treesize of output 70 [2023-11-21 19:46:56,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:56,447 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 73 treesize of output 64 [2023-11-21 19:46:56,450 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:56,457 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 19:46:56,457 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 142 treesize of output 120 [2023-11-21 19:46:56,462 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 40 treesize of output 36 [2023-11-21 19:46:56,465 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 114 treesize of output 70 [2023-11-21 19:46:56,485 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:56,486 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 73 treesize of output 64 [2023-11-21 19:46:56,488 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:56,502 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 19:46:56,502 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 110 treesize of output 96 [2023-11-21 19:46:56,508 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 40 treesize of output 36 [2023-11-21 19:46:56,513 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 102 treesize of output 66 [2023-11-21 19:46:56,857 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 13 [2023-11-21 19:46:56,858 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 [2023-11-21 19:46:56,860 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 16 treesize of output 14 [2023-11-21 19:46:56,862 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 16 treesize of output 14 [2023-11-21 19:46:57,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:46:57,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057364023] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:46:57,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:46:57,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 47 [2023-11-21 19:46:57,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939209525] [2023-11-21 19:46:57,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:46:57,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-11-21 19:46:57,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:46:57,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-11-21 19:46:57,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1792, Unknown=20, NotChecked=264, Total=2256 [2023-11-21 19:46:57,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:57,044 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:46:57,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 3.0638297872340425) internal successors, (144), 48 states have internal predecessors, (144), 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) [2023-11-21 19:46:57,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:57,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:57,045 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-11-21 19:46:57,045 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2023-11-21 19:46:57,045 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2023-11-21 19:46:57,045 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-11-21 19:46:57,045 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-11-21 19:46:57,045 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:00,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:00,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:47:00,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-21 19:47:00,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-11-21 19:47:00,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-11-21 19:47:00,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-21 19:47:00,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-21 19:47:00,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-21 19:47:00,004 INFO L805 garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2023-11-21 19:47:00,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-21 19:47:00,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-21 19:47:00,223 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1] [2023-11-21 19:47:00,226 INFO L307 ceAbstractionStarter]: Result for error location threadThread1of1ForFork0 was SAFE (1/2) [2023-11-21 19:47:00,229 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 19:47:00,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 19:47:00,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:47:00,230 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-21 19:47:00,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Waiting until timeout for monitored process [2023-11-21 19:47:00,232 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 19:47:00,233 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-21 19:47:00,233 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=PARTIAL_ORDER_FA, 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;@45d927d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 19:47:00,233 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-21 19:47:00,251 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2023-11-21 19:47:00,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:47:00,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1012862309, now seen corresponding path program 1 times [2023-11-21 19:47:00,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:47:00,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844097696] [2023-11-21 19:47:00,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:47:00,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:47:00,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:47:00,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:47:00,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:47:00,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844097696] [2023-11-21 19:47:00,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844097696] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:47:00,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:47:00,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 19:47:00,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750038697] [2023-11-21 19:47:00,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:47:00,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-21 19:47:00,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:47:00,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-21 19:47:00,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-21 19:47:00,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:00,261 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:47:00,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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) [2023-11-21 19:47:00,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:00,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:00,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-21 19:47:00,263 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2023-11-21 19:47:00,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:47:00,264 INFO L85 PathProgramCache]: Analyzing trace with hash -320054848, now seen corresponding path program 1 times [2023-11-21 19:47:00,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:47:00,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921994671] [2023-11-21 19:47:00,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:47:00,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:47:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:47:00,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:47:00,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:47:00,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921994671] [2023-11-21 19:47:00,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921994671] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:47:00,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:47:00,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 19:47:00,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816254384] [2023-11-21 19:47:00,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:47:00,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 19:47:00,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:47:00,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 19:47:00,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 19:47:00,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:00,355 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:47:00,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 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) [2023-11-21 19:47:00,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:00,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:00,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:00,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:47:00,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-21 19:47:00,424 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2023-11-21 19:47:00,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:47:00,424 INFO L85 PathProgramCache]: Analyzing trace with hash 122711626, now seen corresponding path program 1 times [2023-11-21 19:47:00,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:47:00,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612363500] [2023-11-21 19:47:00,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:47:00,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:47:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 19:47:00,447 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 19:47:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 19:47:00,474 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 19:47:00,474 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-21 19:47:00,474 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-11-21 19:47:00,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2023-11-21 19:47:00,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2023-11-21 19:47:00,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2023-11-21 19:47:00,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2023-11-21 19:47:00,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-21 19:47:00,476 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-21 19:47:00,476 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2023-11-21 19:47:00,477 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-21 19:47:00,477 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-21 19:47:00,487 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-21 19:47:00,489 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 19:47:00,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 19:47:00,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:47:00,490 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-21 19:47:00,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Waiting until timeout for monitored process [2023-11-21 19:47:00,497 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 19:47:00,497 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of2ForFork0 ======== [2023-11-21 19:47:00,497 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=PARTIAL_ORDER_FA, 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;@45d927d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 19:47:00,497 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-21 19:47:00,567 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:47:00,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:47:00,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1037719185, now seen corresponding path program 1 times [2023-11-21 19:47:00,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:47:00,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477640640] [2023-11-21 19:47:00,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:47:00,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:47:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:47:00,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:47:00,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:47:00,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477640640] [2023-11-21 19:47:00,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477640640] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:47:00,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:47:00,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 19:47:00,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731059366] [2023-11-21 19:47:00,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:47:00,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-21 19:47:00,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:47:00,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-21 19:47:00,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-21 19:47:00,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:00,597 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:47:00,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 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) [2023-11-21 19:47:00,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:00,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:00,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-21 19:47:00,603 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:47:00,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:47:00,603 INFO L85 PathProgramCache]: Analyzing trace with hash -104180193, now seen corresponding path program 1 times [2023-11-21 19:47:00,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:47:00,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781726253] [2023-11-21 19:47:00,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:47:00,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:47:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:47:00,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:47:00,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:47:00,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781726253] [2023-11-21 19:47:00,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781726253] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:47:00,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:47:00,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 19:47:00,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213683491] [2023-11-21 19:47:00,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:47:00,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 19:47:00,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:47:00,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 19:47:00,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 19:47:00,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:00,724 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:47:00,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 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) [2023-11-21 19:47:00,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:00,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:00,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:00,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:47:00,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-21 19:47:00,909 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:47:00,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:47:00,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1354762887, now seen corresponding path program 1 times [2023-11-21 19:47:00,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:47:00,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100213780] [2023-11-21 19:47:00,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:47:00,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:47:00,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:47:01,201 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:47:01,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:47:01,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100213780] [2023-11-21 19:47:01,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100213780] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:47:01,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133212459] [2023-11-21 19:47:01,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:47:01,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:47:01,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:47:01,203 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:47:01,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-21 19:47:01,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:47:01,302 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-21 19:47:01,304 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:47:01,306 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 [2023-11-21 19:47:01,333 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 19:47:01,333 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 11 treesize of output 11 [2023-11-21 19:47:01,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-21 19:47:01,367 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 23 treesize of output 22 [2023-11-21 19:47:01,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:47:01,374 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2023-11-21 19:47:01,384 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:47:01,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2023-11-21 19:47:01,481 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 45 treesize of output 34 [2023-11-21 19:47:01,488 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:47:01,488 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:47:01,505 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1006 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1006) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_ArrVal_1006 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1006) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (forall ((v_ArrVal_1006 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1006) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_1006 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1006) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5))))) is different from false [2023-11-21 19:47:01,602 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 c_threadThread1of2ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1006 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1006) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (forall ((v_ArrVal_1006 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1006) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_1006 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1006) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_1006 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1006) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2023-11-21 19:47:01,617 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 6)) (.cse1 (+ 7 c_threadThread1of2ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1006 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1006) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1006 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1006) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_1006 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1006) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_1006 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1006) c_threadThread1of2ForFork0_~t~0.base) .cse2)))))) is different from false [2023-11-21 19:47:03,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:47:03,677 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 37 treesize of output 53 [2023-11-21 19:47:03,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:47:03,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 32 [2023-11-21 19:47:03,685 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2023-11-21 19:47:03,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2023-11-21 19:47:03,688 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2023-11-21 19:47:03,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2023-11-21 19:47:03,691 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2023-11-21 19:47:03,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2023-11-21 19:47:03,714 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-11-21 19:47:03,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133212459] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:47:03,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:47:03,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 19 [2023-11-21 19:47:03,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531079908] [2023-11-21 19:47:03,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:47:03,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-21 19:47:03,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:47:03,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-21 19:47:03,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=219, Unknown=11, NotChecked=96, Total=380 [2023-11-21 19:47:03,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:03,716 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:47:03,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.157894736842105) internal successors, (79), 20 states have internal predecessors, (79), 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) [2023-11-21 19:47:03,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:03,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:47:03,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:04,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:04,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:47:04,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-21 19:47:04,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-21 19:47:04,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-21 19:47:04,488 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:47:04,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:47:04,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1104226494, now seen corresponding path program 1 times [2023-11-21 19:47:04,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:47:04,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26381244] [2023-11-21 19:47:04,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:47:04,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:47:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:47:04,718 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-21 19:47:04,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:47:04,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26381244] [2023-11-21 19:47:04,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26381244] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:47:04,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:47:04,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 19:47:04,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265589167] [2023-11-21 19:47:04,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:47:04,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 19:47:04,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:47:04,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 19:47:04,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 19:47:04,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:04,722 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:47:04,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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) [2023-11-21 19:47:04,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:04,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:47:04,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-11-21 19:47:04,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:04,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:04,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:47:04,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-21 19:47:04,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:47:04,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-21 19:47:04,887 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:47:04,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:47:04,888 INFO L85 PathProgramCache]: Analyzing trace with hash -942664213, now seen corresponding path program 1 times [2023-11-21 19:47:04,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:47:04,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223804892] [2023-11-21 19:47:04,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:47:04,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:47:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:47:05,659 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:47:05,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:47:05,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223804892] [2023-11-21 19:47:05,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223804892] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:47:05,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564919652] [2023-11-21 19:47:05,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:47:05,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:47:05,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:47:05,661 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:47:05,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-21 19:47:05,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:47:05,793 INFO L262 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-21 19:47:05,796 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:47:05,798 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 [2023-11-21 19:47:05,815 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-21 19:47:05,815 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 [2023-11-21 19:47:05,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-21 19:47:06,003 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 23 treesize of output 22 [2023-11-21 19:47:06,043 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:47:06,043 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2023-11-21 19:47:06,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:47:06,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2023-11-21 19:47:06,231 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-21 19:47:06,231 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 16 treesize of output 18 [2023-11-21 19:47:06,342 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 45 treesize of output 34 [2023-11-21 19:47:06,356 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 45 treesize of output 34 [2023-11-21 19:47:06,368 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 45 treesize of output 34 [2023-11-21 19:47:06,384 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 45 treesize of output 34 [2023-11-21 19:47:06,616 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 45 treesize of output 34 [2023-11-21 19:47:06,632 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 45 treesize of output 34 [2023-11-21 19:47:06,643 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 45 treesize of output 34 [2023-11-21 19:47:06,659 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 45 treesize of output 34 [2023-11-21 19:47:06,760 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 45 treesize of output 34 [2023-11-21 19:47:06,766 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 2 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:47:06,767 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:47:06,779 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1286 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_1286) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_1286 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_1286) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1286 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_1286) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_ArrVal_1286 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_1286) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6))))) is different from false [2023-11-21 19:47:06,810 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1286 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread2of2ForFork0_~arg.base v_ArrVal_1286) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1286 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread2of2ForFork0_~arg.base v_ArrVal_1286) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1286 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~arg.base v_ArrVal_1286) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_ArrVal_1286 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread2of2ForFork0_~arg.base v_ArrVal_1286) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false [2023-11-21 19:47:06,818 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1286 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1286) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_1286 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1286) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1286 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1286) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (forall ((v_ArrVal_1286 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1286) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5))))) is different from false [2023-11-21 19:47:06,861 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1286 (Array Int Int)) (v_ArrVal_1285 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1285) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1286) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_1286 (Array Int Int)) (v_ArrVal_1285 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1285) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1286) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1286 (Array Int Int)) (v_ArrVal_1285 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1285) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1286) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_1286 (Array Int Int)) (v_ArrVal_1285 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1285) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1286) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset))))) is different from false [2023-11-21 19:47:06,980 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1286 (Array Int Int)) (v_ArrVal_1285 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1285) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1286) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_ArrVal_1286 (Array Int Int)) (v_ArrVal_1285 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1285) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1286) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_1286 (Array Int Int)) (v_ArrVal_1285 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1285) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1286) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_1286 (Array Int Int)) (v_ArrVal_1285 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1285) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1286) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6))))) is different from false [2023-11-21 19:47:07,082 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1286 (Array Int Int)) (v_ArrVal_1285 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1285) |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_1286) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1286 (Array Int Int)) (v_ArrVal_1285 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1285) |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_1286) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1286 (Array Int Int)) (v_ArrVal_1285 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1285) |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_1286) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (forall ((v_ArrVal_1286 (Array Int Int)) (v_ArrVal_1285 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1285) |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_1286) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4))))) is different from false [2023-11-21 19:47:09,977 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:47:09,978 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 40 treesize of output 56 [2023-11-21 19:47:09,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:47:09,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 226 treesize of output 130 [2023-11-21 19:47:09,986 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 13 [2023-11-21 19:47:09,988 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 20 [2023-11-21 19:47:10,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:47:10,004 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 40 treesize of output 56 [2023-11-21 19:47:10,006 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:47:10,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:47:10,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 32 [2023-11-21 19:47:10,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:47:10,021 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 40 treesize of output 56 [2023-11-21 19:47:10,037 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:47:10,040 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:47:10,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 32 [2023-11-21 19:47:10,051 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:47:10,052 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 40 treesize of output 56 [2023-11-21 19:47:10,054 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:47:10,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:47:10,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 32 [2023-11-21 19:47:14,428 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 51 not checked. [2023-11-21 19:47:14,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564919652] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:47:14,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:47:14,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 48 [2023-11-21 19:47:14,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047652200] [2023-11-21 19:47:14,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:47:14,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-11-21 19:47:14,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:47:14,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-11-21 19:47:14,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1603, Unknown=17, NotChecked=522, Total=2352 [2023-11-21 19:47:14,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:14,431 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:47:14,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 4.895833333333333) internal successors, (235), 49 states have internal predecessors, (235), 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) [2023-11-21 19:47:14,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:14,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:47:14,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-11-21 19:47:14,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:47:14,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:16,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:16,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:47:16,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-21 19:47:16,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:47:16,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:47:16,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-21 19:47:16,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:47:16,908 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:47:16,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:47:16,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1606297204, now seen corresponding path program 1 times [2023-11-21 19:47:16,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:47:16,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017015481] [2023-11-21 19:47:16,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:47:16,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:47:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:47:18,419 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:47:18,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:47:18,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017015481] [2023-11-21 19:47:18,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017015481] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:47:18,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205919719] [2023-11-21 19:47:18,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:47:18,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:47:18,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:47:18,420 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:47:18,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-21 19:47:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:47:18,560 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-21 19:47:18,563 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:47:18,572 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 [2023-11-21 19:47:18,653 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 19:47:18,654 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 11 treesize of output 11 [2023-11-21 19:47:18,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 19:47:18,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 19:47:18,943 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 13 treesize of output 9 [2023-11-21 19:47:18,990 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 23 treesize of output 22 [2023-11-21 19:47:19,044 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 32 treesize of output 34 [2023-11-21 19:47:19,100 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 41 treesize of output 46 [2023-11-21 19:47:19,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:19,396 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 39 treesize of output 15 [2023-11-21 19:47:19,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:19,403 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 31 treesize of output 11 [2023-11-21 19:47:19,473 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 45 treesize of output 34 [2023-11-21 19:47:19,488 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 45 treesize of output 34 [2023-11-21 19:47:19,506 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 45 treesize of output 34 [2023-11-21 19:47:19,521 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 45 treesize of output 34 [2023-11-21 19:47:19,766 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 [2023-11-21 19:47:19,768 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 [2023-11-21 19:47:19,836 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 45 treesize of output 34 [2023-11-21 19:47:19,853 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 45 treesize of output 34 [2023-11-21 19:47:19,891 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 45 treesize of output 34 [2023-11-21 19:47:19,905 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 45 treesize of output 34 [2023-11-21 19:47:19,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:19,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:19,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:19,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:19,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:47:19,982 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 56 [2023-11-21 19:47:20,043 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:47:20,043 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:47:20,241 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1446 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1446))) (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (forall ((v_ArrVal_1446 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1446))) (store .cse1 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse1 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1446 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1446))) (store .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1446 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1446))) (store .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false [2023-11-21 19:47:20,284 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (let ((.cse1 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse6)) (.cse2 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse6))) (and (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int)) (or (forall ((v_ArrVal_1446 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1446))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (< .cse2 |v_ULTIMATE.start_main_#t~mem13#1.offset_17|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int)) (or (forall ((v_ArrVal_1446 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1446))) (store .cse3 .cse1 (store (select .cse3 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (< .cse2 |v_ULTIMATE.start_main_#t~mem13#1.offset_17|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int)) (or (< .cse2 |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (forall ((v_ArrVal_1446 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1446))) (store .cse4 .cse1 (store (select .cse4 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int)) (or (forall ((v_ArrVal_1446 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1446))) (store .cse5 .cse1 (store (select .cse5 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (< .cse2 |v_ULTIMATE.start_main_#t~mem13#1.offset_17|)))))) is different from false [2023-11-21 19:47:23,078 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~ts~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~ts~0#1.base|)) (.cse3 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (and (forall ((|ULTIMATE.start_main_~t~1#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (v_ArrVal_1437 Int)) (or (forall ((v_ArrVal_1446 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1446)) (.cse1 (select (store .cse2 .cse3 v_ArrVal_1437) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (< (select (store .cse4 .cse3 |ULTIMATE.start_main_~t~1#1.offset|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|))) (forall ((|ULTIMATE.start_main_~t~1#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (v_ArrVal_1437 Int)) (or (< (select (store .cse4 .cse3 |ULTIMATE.start_main_~t~1#1.offset|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (forall ((v_ArrVal_1446 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1446)) (.cse6 (select (store .cse2 .cse3 v_ArrVal_1437) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse5 .cse6 (store (select .cse5 .cse6) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))))) (forall ((|ULTIMATE.start_main_~t~1#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (v_ArrVal_1437 Int)) (or (< (select (store .cse4 .cse3 |ULTIMATE.start_main_~t~1#1.offset|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (forall ((v_ArrVal_1446 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1446)) (.cse8 (select (store .cse2 .cse3 v_ArrVal_1437) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse7 .cse8 (store (select .cse7 .cse8) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)))))) (forall ((|ULTIMATE.start_main_~t~1#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (v_ArrVal_1437 Int)) (or (< (select (store .cse4 .cse3 |ULTIMATE.start_main_~t~1#1.offset|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (forall ((v_ArrVal_1446 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1446)) (.cse10 (select (store .cse2 .cse3 v_ArrVal_1437) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse9 .cse10 (store (select .cse9 .cse10) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))))))) is different from false [2023-11-21 19:47:25,250 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse5 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~ts~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~ts~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_40| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_40| .cse0) (forall ((|ULTIMATE.start_main_~t~1#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (v_ArrVal_1437 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_40| 4)))) (or (< (select (store .cse1 .cse2 |ULTIMATE.start_main_~t~1#1.offset|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (forall ((v_ArrVal_1446 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1446)) (.cse4 (select (store .cse5 .cse2 v_ArrVal_1437) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse3 .cse4 (store (select .cse3 .cse4) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)) |c_threadThread1of2ForFork0_#t~nondet4|))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_40| Int)) (or (forall ((|ULTIMATE.start_main_~t~1#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (v_ArrVal_1437 Int)) (let ((.cse8 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_40| 4)))) (or (forall ((v_ArrVal_1446 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1446)) (.cse7 (select (store .cse5 .cse8 v_ArrVal_1437) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse6 .cse7 (store (select .cse6 .cse7) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)))) (< (select (store .cse1 .cse8 |ULTIMATE.start_main_~t~1#1.offset|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|)))) (< |v_ULTIMATE.start_main_~i~0#1_40| .cse0))) (forall ((|v_ULTIMATE.start_main_~i~0#1_40| Int)) (or (forall ((|ULTIMATE.start_main_~t~1#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (v_ArrVal_1437 Int)) (let ((.cse11 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_40| 4)))) (or (forall ((v_ArrVal_1446 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1446)) (.cse10 (select (store .cse5 .cse11 v_ArrVal_1437) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse9 .cse10 (store (select .cse9 .cse10) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (< (select (store .cse1 .cse11 |ULTIMATE.start_main_~t~1#1.offset|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|)))) (< |v_ULTIMATE.start_main_~i~0#1_40| .cse0))) (forall ((|v_ULTIMATE.start_main_~i~0#1_40| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_40| .cse0) (forall ((|ULTIMATE.start_main_~t~1#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (v_ArrVal_1437 Int)) (let ((.cse14 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_40| 4)))) (or (forall ((v_ArrVal_1446 (Array Int Int))) (= (select (select (let ((.cse12 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1446)) (.cse13 (select (store .cse5 .cse14 v_ArrVal_1437) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse12 .cse13 (store (select .cse12 .cse13) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)) |c_threadThread1of2ForFork0_#t~nondet4|)) (< (select (store .cse1 .cse14 |ULTIMATE.start_main_~t~1#1.offset|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|)))))))) is different from false [2023-11-21 19:47:25,963 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~ts~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~ts~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((v_ArrVal_1446 (Array Int Int)) (|ULTIMATE.start_main_~t~1#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (|v_ULTIMATE.start_main_~i~0#1_40| Int) (v_ArrVal_1437 Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_40| 4)))) (or (< (select (store .cse0 .cse1 |ULTIMATE.start_main_~t~1#1.offset|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1446)) (.cse3 (select (store .cse4 .cse1 v_ArrVal_1437) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse2 .cse3 (store (select .cse2 .cse3) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)) |c_threadThread1of2ForFork0_#t~nondet4|) (< |v_ULTIMATE.start_main_~i~0#1_40| .cse5)))) (forall ((v_ArrVal_1446 (Array Int Int)) (|ULTIMATE.start_main_~t~1#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (|v_ULTIMATE.start_main_~i~0#1_40| Int) (v_ArrVal_1437 Int)) (let ((.cse6 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_40| 4)))) (or (< (select (store .cse0 .cse6 |ULTIMATE.start_main_~t~1#1.offset|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (< |v_ULTIMATE.start_main_~i~0#1_40| .cse5) (= (select (select (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1446)) (.cse8 (select (store .cse4 .cse6 v_ArrVal_1437) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse7 .cse8 (store (select .cse7 .cse8) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)) |c_threadThread1of2ForFork0_#t~nondet4|)))) (forall ((v_ArrVal_1446 (Array Int Int)) (|ULTIMATE.start_main_~t~1#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (|v_ULTIMATE.start_main_~i~0#1_40| Int) (v_ArrVal_1437 Int)) (let ((.cse9 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_40| 4)))) (or (< (select (store .cse0 .cse9 |ULTIMATE.start_main_~t~1#1.offset|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (< |v_ULTIMATE.start_main_~i~0#1_40| .cse5) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse10 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1446)) (.cse11 (select (store .cse4 .cse9 v_ArrVal_1437) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse10 .cse11 (store (select .cse10 .cse11) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))))) (forall ((v_ArrVal_1446 (Array Int Int)) (|ULTIMATE.start_main_~t~1#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (|v_ULTIMATE.start_main_~i~0#1_40| Int) (v_ArrVal_1437 Int)) (let ((.cse14 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_40| 4)))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse12 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1446)) (.cse13 (select (store .cse4 .cse14 v_ArrVal_1437) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse12 .cse13 (store (select .cse12 .cse13) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset))) (< (select (store .cse0 .cse14 |ULTIMATE.start_main_~t~1#1.offset|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (< |v_ULTIMATE.start_main_~i~0#1_40| .cse5)))))) is different from false [2023-11-21 19:47:26,098 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse16 (+ 7 c_threadThread1of2ForFork0_~t~0.offset))) (let ((.cse0 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~ts~0#1.base|)) (.cse5 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~ts~0#1.base|)) (.cse6 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse16 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse2 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((v_ArrVal_1446 (Array Int Int)) (|ULTIMATE.start_main_~t~1#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (|v_ULTIMATE.start_main_~i~0#1_40| Int) (v_ArrVal_1437 Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_40| 4)))) (or (< (select (store .cse0 .cse1 |ULTIMATE.start_main_~t~1#1.offset|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (< |v_ULTIMATE.start_main_~i~0#1_40| .cse2) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store .cse6 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1446)) (.cse4 (select (store .cse5 .cse1 v_ArrVal_1437) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse3 .cse4 (store (select .cse3 .cse4) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))))) (forall ((v_ArrVal_1446 (Array Int Int)) (|ULTIMATE.start_main_~t~1#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (|v_ULTIMATE.start_main_~i~0#1_40| Int) (v_ArrVal_1437 Int)) (let ((.cse9 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_40| 4)))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store .cse6 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1446)) (.cse8 (select (store .cse5 .cse9 v_ArrVal_1437) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse7 .cse8 (store (select .cse7 .cse8) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5))) (< (select (store .cse0 .cse9 |ULTIMATE.start_main_~t~1#1.offset|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (< |v_ULTIMATE.start_main_~i~0#1_40| .cse2)))) (forall ((v_ArrVal_1446 (Array Int Int)) (|ULTIMATE.start_main_~t~1#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (|v_ULTIMATE.start_main_~i~0#1_40| Int) (v_ArrVal_1437 Int)) (let ((.cse10 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_40| 4)))) (or (< (select (store .cse0 .cse10 |ULTIMATE.start_main_~t~1#1.offset|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (< |v_ULTIMATE.start_main_~i~0#1_40| .cse2) (= (select (select (let ((.cse11 (store .cse6 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1446)) (.cse12 (select (store .cse5 .cse10 v_ArrVal_1437) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse11 .cse12 (store (select .cse11 .cse12) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)) |c_threadThread1of2ForFork0_#t~nondet4|)))) (forall ((v_ArrVal_1446 (Array Int Int)) (|ULTIMATE.start_main_~t~1#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (|v_ULTIMATE.start_main_~i~0#1_40| Int) (v_ArrVal_1437 Int)) (let ((.cse13 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_40| 4)))) (or (< (select (store .cse0 .cse13 |ULTIMATE.start_main_~t~1#1.offset|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (= (select (select (let ((.cse14 (store .cse6 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1446)) (.cse15 (select (store .cse5 .cse13 v_ArrVal_1437) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse14 .cse15 (store (select .cse14 .cse15) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) .cse16) |c_threadThread1of2ForFork0_#t~nondet4|) (< |v_ULTIMATE.start_main_~i~0#1_40| .cse2))))))) is different from false [2023-11-21 19:47:26,151 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_threadThread1of2ForFork0_~t~0.offset 6)) (.cse11 (+ 7 c_threadThread1of2ForFork0_~t~0.offset))) (let ((.cse6 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~ts~0#1.base|)) (.cse7 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse2 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~ts~0#1.base|)) (.cse4 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse11 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1446 (Array Int Int)) (|ULTIMATE.start_main_~t~1#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (|v_ULTIMATE.start_main_~i~0#1_40| Int) (v_ArrVal_1437 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_40| 4)))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1446)) (.cse1 (select (store .cse2 .cse3 v_ArrVal_1437) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) .cse5)) (< (select (store .cse6 .cse3 |ULTIMATE.start_main_~t~1#1.offset|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (< |v_ULTIMATE.start_main_~i~0#1_40| .cse7)))) (forall ((v_ArrVal_1446 (Array Int Int)) (|ULTIMATE.start_main_~t~1#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (|v_ULTIMATE.start_main_~i~0#1_40| Int) (v_ArrVal_1437 Int)) (let ((.cse10 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_40| 4)))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse8 (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1446)) (.cse9 (select (store .cse2 .cse10 v_ArrVal_1437) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse8 .cse9 (store (select .cse8 .cse9) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) .cse11)) (< (select (store .cse6 .cse10 |ULTIMATE.start_main_~t~1#1.offset|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (< |v_ULTIMATE.start_main_~i~0#1_40| .cse7)))) (forall ((v_ArrVal_1446 (Array Int Int)) (|ULTIMATE.start_main_~t~1#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (|v_ULTIMATE.start_main_~i~0#1_40| Int) (v_ArrVal_1437 Int)) (let ((.cse14 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_40| 4)))) (or (= (select (select (let ((.cse12 (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1446)) (.cse13 (select (store .cse2 .cse14 v_ArrVal_1437) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse12 .cse13 (store (select .cse12 .cse13) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)) |c_threadThread1of2ForFork0_#t~nondet4|) (< (select (store .cse6 .cse14 |ULTIMATE.start_main_~t~1#1.offset|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (< |v_ULTIMATE.start_main_~i~0#1_40| .cse7)))) (forall ((v_ArrVal_1446 (Array Int Int)) (|ULTIMATE.start_main_~t~1#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (|v_ULTIMATE.start_main_~i~0#1_40| Int) (v_ArrVal_1437 Int)) (let ((.cse15 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_40| 4)))) (or (< (select (store .cse6 .cse15 |ULTIMATE.start_main_~t~1#1.offset|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (< |v_ULTIMATE.start_main_~i~0#1_40| .cse7) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse16 (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1446)) (.cse17 (select (store .cse2 .cse15 v_ArrVal_1437) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse16 .cse17 (store (select .cse16 .cse17) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5))))))))) is different from false [2023-11-21 19:47:26,209 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse18 (+ c_threadThread1of2ForFork0_~t~0.offset 5)) (.cse7 (+ c_threadThread1of2ForFork0_~t~0.offset 6)) (.cse11 (+ 7 c_threadThread1of2ForFork0_~t~0.offset))) (let ((.cse5 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~ts~0#1.base|)) (.cse6 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse18 |c_threadThread1of2ForFork0_#t~nondet4|) .cse7 |c_threadThread1of2ForFork0_#t~nondet4|) .cse11 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse0 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~ts~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((v_ArrVal_1446 (Array Int Int)) (|ULTIMATE.start_main_~t~1#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (|v_ULTIMATE.start_main_~i~0#1_40| Int) (v_ArrVal_1437 Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_40| 4)))) (or (< (select (store .cse0 .cse1 |ULTIMATE.start_main_~t~1#1.offset|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (< |v_ULTIMATE.start_main_~i~0#1_40| .cse2) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store .cse6 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1446)) (.cse4 (select (store .cse5 .cse1 v_ArrVal_1437) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse3 .cse4 (store (select .cse3 .cse4) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) .cse7))))) (forall ((v_ArrVal_1446 (Array Int Int)) (|ULTIMATE.start_main_~t~1#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (|v_ULTIMATE.start_main_~i~0#1_40| Int) (v_ArrVal_1437 Int)) (let ((.cse10 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_40| 4)))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse8 (store .cse6 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1446)) (.cse9 (select (store .cse5 .cse10 v_ArrVal_1437) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse8 .cse9 (store (select .cse8 .cse9) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) .cse11)) (< (select (store .cse0 .cse10 |ULTIMATE.start_main_~t~1#1.offset|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (< |v_ULTIMATE.start_main_~i~0#1_40| .cse2)))) (forall ((v_ArrVal_1446 (Array Int Int)) (|ULTIMATE.start_main_~t~1#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (|v_ULTIMATE.start_main_~i~0#1_40| Int) (v_ArrVal_1437 Int)) (let ((.cse12 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_40| 4)))) (or (< (select (store .cse0 .cse12 |ULTIMATE.start_main_~t~1#1.offset|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (= (select (select (let ((.cse13 (store .cse6 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1446)) (.cse14 (select (store .cse5 .cse12 v_ArrVal_1437) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse13 .cse14 (store (select .cse13 .cse14) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)) |c_threadThread1of2ForFork0_#t~nondet4|) (< |v_ULTIMATE.start_main_~i~0#1_40| .cse2)))) (forall ((v_ArrVal_1446 (Array Int Int)) (|ULTIMATE.start_main_~t~1#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int) (|v_ULTIMATE.start_main_~i~0#1_40| Int) (v_ArrVal_1437 Int)) (let ((.cse17 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_40| 4)))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse15 (store .cse6 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1446)) (.cse16 (select (store .cse5 .cse17 v_ArrVal_1437) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse15 .cse16 (store (select .cse15 .cse16) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) .cse18)) (< (select (store .cse0 .cse17 |ULTIMATE.start_main_~t~1#1.offset|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (< |v_ULTIMATE.start_main_~i~0#1_40| .cse2))))))) is different from false [2023-11-21 19:47:26,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:47:26,235 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 95 treesize of output 86 [2023-11-21 19:47:26,252 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:47:26,253 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 342 treesize of output 311 [2023-11-21 19:47:26,261 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 261 treesize of output 245 [2023-11-21 19:47:26,439 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:47:26,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 287 treesize of output 247 [2023-11-21 19:47:26,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:47:26,601 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 95 treesize of output 86 [2023-11-21 19:47:26,610 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:47:26,611 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 474 treesize of output 411 [2023-11-21 19:47:26,620 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 250 treesize of output 234 [2023-11-21 19:47:26,807 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:47:26,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 286 treesize of output 246 [2023-11-21 19:47:26,945 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:47:26,946 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 95 treesize of output 86 [2023-11-21 19:47:26,955 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:47:26,955 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 644 treesize of output 559 [2023-11-21 19:47:26,963 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 240 treesize of output 224 [2023-11-21 19:47:27,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:47:27,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 295 treesize of output 251 [2023-11-21 19:47:27,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:47:27,308 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 95 treesize of output 86 [2023-11-21 19:47:27,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:47:27,322 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 474 treesize of output 411 [2023-11-21 19:47:27,331 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 250 treesize of output 234 [2023-11-21 19:47:27,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:47:27,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 206 treesize of output 166 [2023-11-21 19:47:34,728 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 22 treesize of output 20 [2023-11-21 19:47:34,732 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 23 treesize of output 21 [2023-11-21 19:47:34,737 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 46 treesize of output 44 [2023-11-21 19:47:34,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 43 treesize of output 41 [2023-11-21 19:47:34,763 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 19 treesize of output 17 [2023-11-21 19:47:34,766 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-21 19:47:34,769 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 19 treesize of output 17 [2023-11-21 19:47:34,772 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-21 19:47:34,775 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 19 treesize of output 17 [2023-11-21 19:47:34,778 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-21 19:47:34,781 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 19 treesize of output 17 [2023-11-21 19:47:34,784 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-21 19:47:34,787 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 19 treesize of output 17 [2023-11-21 19:47:34,790 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-21 19:47:34,793 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-21 19:47:34,796 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 19 treesize of output 17 [2023-11-21 19:47:34,799 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-21 19:47:34,803 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-21 19:47:34,806 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-21 19:47:34,810 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 19 treesize of output 17 [2023-11-21 19:47:34,813 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-21 19:47:35,004 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2023-11-21 19:47:35,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205919719] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:47:35,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:47:35,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 60 [2023-11-21 19:47:35,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308958226] [2023-11-21 19:47:35,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:47:35,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2023-11-21 19:47:35,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:47:35,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2023-11-21 19:47:35,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=2544, Unknown=22, NotChecked=872, Total=3660 [2023-11-21 19:47:35,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:35,007 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:47:35,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 3.65) internal successors, (219), 61 states have internal predecessors, (219), 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) [2023-11-21 19:47:35,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:35,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:47:35,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-11-21 19:47:35,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:47:35,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:47:35,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:46,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 19:47:49,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 19:47:52,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 19:47:54,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 19:47:56,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 19:47:59,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 19:48:00,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 19:48:02,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 19:48:04,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 19:48:06,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 19:48:09,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 19:48:11,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 19:48:14,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 19:48:17,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 19:48:20,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 19:48:22,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 19:48:24,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 19:48:27,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 19:48:30,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 19:48:32,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 19:48:34,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 19:48:36,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 19:48:42,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 19:48:44,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 19:48:46,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 19:48:49,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 19:48:51,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 19:48:53,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 19:48:54,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:48:54,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:48:54,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-21 19:48:54,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:48:54,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:48:54,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-21 19:48:54,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-21 19:48:54,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-21 19:48:54,763 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:48:54,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:48:54,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1876292254, now seen corresponding path program 1 times [2023-11-21 19:48:54,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:48:54,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627950167] [2023-11-21 19:48:54,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:48:54,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:48:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:48:54,964 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-11-21 19:48:54,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:48:54,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627950167] [2023-11-21 19:48:54,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627950167] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:48:54,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:48:54,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 19:48:54,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623868383] [2023-11-21 19:48:54,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:48:54,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 19:48:54,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:48:54,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 19:48:54,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 19:48:54,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:48:54,966 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:48:54,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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) [2023-11-21 19:48:54,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:48:54,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:48:54,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-11-21 19:48:54,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:48:54,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:48:54,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-11-21 19:48:54,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:48:55,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:48:55,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:48:55,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-21 19:48:55,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:48:55,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:48:55,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-21 19:48:55,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:48:55,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-21 19:48:55,072 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:48:55,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:48:55,072 INFO L85 PathProgramCache]: Analyzing trace with hash 611220579, now seen corresponding path program 1 times [2023-11-21 19:48:55,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:48:55,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908650532] [2023-11-21 19:48:55,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:48:55,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:48:55,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:48:57,719 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:48:57,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:48:57,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908650532] [2023-11-21 19:48:57,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908650532] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:48:57,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145651547] [2023-11-21 19:48:57,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:48:57,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:48:57,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:48:57,721 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:48:57,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-21 19:48:57,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:48:57,877 INFO L262 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 78 conjunts are in the unsatisfiable core [2023-11-21 19:48:57,880 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:48:57,893 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 [2023-11-21 19:48:58,005 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-21 19:48:58,006 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 [2023-11-21 19:48:58,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 19:48:58,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 19:48:58,515 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 13 treesize of output 9 [2023-11-21 19:48:58,587 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 23 treesize of output 22 [2023-11-21 19:48:58,673 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 32 treesize of output 34 [2023-11-21 19:48:58,765 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 41 treesize of output 46 [2023-11-21 19:48:59,122 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-21 19:48:59,122 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 [2023-11-21 19:48:59,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:48:59,334 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 31 treesize of output 11 [2023-11-21 19:48:59,344 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-21 19:48:59,344 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 1 case distinctions, treesize of input 47 treesize of output 19 [2023-11-21 19:48:59,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:48:59,455 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 45 treesize of output 34 [2023-11-21 19:48:59,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:48:59,480 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 45 treesize of output 34 [2023-11-21 19:48:59,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:48:59,508 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 45 treesize of output 34 [2023-11-21 19:48:59,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:48:59,531 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 45 treesize of output 34 [2023-11-21 19:48:59,984 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 31 treesize of output 15 [2023-11-21 19:48:59,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2023-11-21 19:49:00,079 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 45 treesize of output 34 [2023-11-21 19:49:00,105 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 45 treesize of output 34 [2023-11-21 19:49:00,122 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 45 treesize of output 34 [2023-11-21 19:49:00,142 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 45 treesize of output 34 [2023-11-21 19:49:00,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:49:00,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:49:00,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:49:00,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:49:00,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2023-11-21 19:49:00,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:49:00,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:49:00,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:49:00,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:49:00,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:49:00,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:49:00,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:49:00,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:49:00,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 68 [2023-11-21 19:49:00,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:49:00,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:49:00,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:49:00,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:49:00,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:49:00,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:49:00,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:49:00,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:49:00,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:49:00,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:49:00,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:49:00,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:49:00,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 71 [2023-11-21 19:49:00,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:49:00,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:49:00,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:49:00,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:49:00,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:49:00,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:49:00,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:49:00,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:49:00,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:49:00,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:49:00,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:49:00,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:49:00,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 71 [2023-11-21 19:49:00,893 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 61 treesize of output 46 [2023-11-21 19:49:01,004 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:49:01,004 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:49:01,085 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1727 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (forall ((v_ArrVal_1727 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1727 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1727 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset))))) is different from false [2023-11-21 19:49:01,120 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1727 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~arg.base v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_1727 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~arg.base v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_ArrVal_1727 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~arg.base v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (forall ((v_ArrVal_1727 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~arg.base v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4))))) is different from false [2023-11-21 19:49:01,130 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1727 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_ArrVal_1727 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_1727 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_1727 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false [2023-11-21 19:49:01,148 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base|)) (.cse1 (+ 3 |c_ULTIMATE.start_main_#t~mem13#1.offset|))) (and (forall ((v_ArrVal_1725 Int) (v_ArrVal_1727 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| (store .cse0 .cse1 v_ArrVal_1725)) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_1725 Int) (v_ArrVal_1727 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| (store .cse0 .cse1 v_ArrVal_1725)) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_ArrVal_1725 Int) (v_ArrVal_1727 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| (store .cse0 .cse1 v_ArrVal_1725)) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (forall ((v_ArrVal_1725 Int) (v_ArrVal_1727 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| (store .cse0 .cse1 v_ArrVal_1725)) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))))) is different from false [2023-11-21 19:49:01,179 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base|)) (.cse1 (+ 2 |c_ULTIMATE.start_main_#t~mem13#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_#t~mem13#1.offset|))) (and (forall ((v_ArrVal_1725 Int) (v_ArrVal_1727 (Array Int Int)) (v_ArrVal_1724 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| (store (store .cse0 .cse1 v_ArrVal_1724) .cse2 v_ArrVal_1725)) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1725 Int) (v_ArrVal_1727 (Array Int Int)) (v_ArrVal_1724 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| (store (store .cse0 .cse1 v_ArrVal_1724) .cse2 v_ArrVal_1725)) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (forall ((v_ArrVal_1725 Int) (v_ArrVal_1727 (Array Int Int)) (v_ArrVal_1724 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| (store (store .cse0 .cse1 v_ArrVal_1724) .cse2 v_ArrVal_1725)) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_1725 Int) (v_ArrVal_1727 (Array Int Int)) (v_ArrVal_1724 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| (store (store .cse0 .cse1 v_ArrVal_1724) .cse2 v_ArrVal_1725)) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false [2023-11-21 19:49:01,197 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (store (select |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| 1) 0)) (.cse1 (+ 2 |c_ULTIMATE.start_main_#t~mem13#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_#t~mem13#1.offset|))) (and (forall ((v_ArrVal_1725 Int) (v_ArrVal_1727 (Array Int Int)) (v_ArrVal_1724 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| (store (store .cse0 .cse1 v_ArrVal_1724) .cse2 v_ArrVal_1725)) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_1725 Int) (v_ArrVal_1727 (Array Int Int)) (v_ArrVal_1724 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| (store (store .cse0 .cse1 v_ArrVal_1724) .cse2 v_ArrVal_1725)) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1725 Int) (v_ArrVal_1727 (Array Int Int)) (v_ArrVal_1724 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| (store (store .cse0 .cse1 v_ArrVal_1724) .cse2 v_ArrVal_1725)) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1725 Int) (v_ArrVal_1727 (Array Int Int)) (v_ArrVal_1724 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| (store (store .cse0 .cse1 v_ArrVal_1724) .cse2 v_ArrVal_1725)) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false [2023-11-21 19:49:01,215 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (store (store (select |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| 1) 0)) (.cse1 (+ 2 |c_ULTIMATE.start_main_#t~mem13#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_#t~mem13#1.offset|))) (and (forall ((v_ArrVal_1725 Int) (v_ArrVal_1727 (Array Int Int)) (v_ArrVal_1724 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| (store (store .cse0 .cse1 v_ArrVal_1724) .cse2 v_ArrVal_1725)) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_1725 Int) (v_ArrVal_1727 (Array Int Int)) (v_ArrVal_1724 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| (store (store .cse0 .cse1 v_ArrVal_1724) .cse2 v_ArrVal_1725)) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (forall ((v_ArrVal_1725 Int) (v_ArrVal_1727 (Array Int Int)) (v_ArrVal_1724 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| (store (store .cse0 .cse1 v_ArrVal_1724) .cse2 v_ArrVal_1725)) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_ArrVal_1725 Int) (v_ArrVal_1727 (Array Int Int)) (v_ArrVal_1724 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| (store (store .cse0 .cse1 v_ArrVal_1724) .cse2 v_ArrVal_1725)) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))))) is different from false [2023-11-21 19:49:01,263 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| 1)) (.cse2 (+ 2 |c_ULTIMATE.start_main_#t~mem13#1.offset|)) (.cse3 (+ 3 |c_ULTIMATE.start_main_#t~mem13#1.offset|))) (and (forall ((v_ArrVal_1720 (Array Int Int)) (v_ArrVal_1725 Int) (v_ArrVal_1727 (Array Int Int)) (v_ArrVal_1724 Int)) (= (select (select (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1720))) (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (store (store (store (select .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0) .cse1 0) .cse2 v_ArrVal_1724) .cse3 v_ArrVal_1725))) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1720 (Array Int Int)) (v_ArrVal_1725 Int) (v_ArrVal_1727 (Array Int Int)) (v_ArrVal_1724 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1720))) (store .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (store (store (store (select .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0) .cse1 0) .cse2 v_ArrVal_1724) .cse3 v_ArrVal_1725))) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_1720 (Array Int Int)) (v_ArrVal_1725 Int) (v_ArrVal_1727 (Array Int Int)) (v_ArrVal_1724 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1720))) (store .cse5 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (store (store (store (select .cse5 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0) .cse1 0) .cse2 v_ArrVal_1724) .cse3 v_ArrVal_1725))) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (forall ((v_ArrVal_1720 (Array Int Int)) (v_ArrVal_1725 Int) (v_ArrVal_1727 (Array Int Int)) (v_ArrVal_1724 Int)) (= (select (select (store (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1720))) (store .cse6 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (store (store (store (select .cse6 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0) .cse1 0) .cse2 v_ArrVal_1724) .cse3 v_ArrVal_1725))) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false [2023-11-21 19:49:06,152 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_18| Int)) (or (forall ((v_ArrVal_1720 (Array Int Int)) (v_ArrVal_1725 Int) (v_ArrVal_1727 (Array Int Int)) (v_ArrVal_1724 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1720))) (store .cse0 .cse1 (store (store (store (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 0) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 1) 0) (+ 2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_1724) (+ 3 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_1725))) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)))) (< .cse2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_18| Int)) (or (forall ((v_ArrVal_1720 (Array Int Int)) (v_ArrVal_1725 Int) (v_ArrVal_1727 (Array Int Int)) (v_ArrVal_1724 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1720))) (store .cse3 .cse1 (store (store (store (store (select .cse3 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 0) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 1) 0) (+ 2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_1724) (+ 3 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_1725))) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (< .cse2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_18| Int)) (or (< .cse2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) (forall ((v_ArrVal_1720 (Array Int Int)) (v_ArrVal_1725 Int) (v_ArrVal_1727 (Array Int Int)) (v_ArrVal_1724 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1720))) (store .cse4 .cse1 (store (store (store (store (select .cse4 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 0) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 1) 0) (+ 2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_1724) (+ 3 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_1725))) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_18| Int)) (or (forall ((v_ArrVal_1720 (Array Int Int)) (v_ArrVal_1725 Int) (v_ArrVal_1727 (Array Int Int)) (v_ArrVal_1724 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1720))) (store .cse5 .cse1 (store (store (store (store (select .cse5 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 0) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 1) 0) (+ 2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_1724) (+ 3 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_1725))) |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (< .cse2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|))))) is different from false [2023-11-21 19:49:06,477 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_18| Int)) (or (forall ((v_ArrVal_1720 (Array Int Int)) (v_ArrVal_1725 Int) (v_ArrVal_1727 (Array Int Int)) (v_ArrVal_1724 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1720))) (store .cse0 .cse1 (store (store (store (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 0) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 1) 0) (+ 2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_1724) (+ 3 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_1725))) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)))) (< .cse2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_18| Int)) (or (< .cse2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) (forall ((v_ArrVal_1720 (Array Int Int)) (v_ArrVal_1725 Int) (v_ArrVal_1727 (Array Int Int)) (v_ArrVal_1724 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1720))) (store .cse3 .cse1 (store (store (store (store (select .cse3 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 0) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 1) 0) (+ 2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_1724) (+ 3 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_1725))) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_18| Int)) (or (forall ((v_ArrVal_1720 (Array Int Int)) (v_ArrVal_1725 Int) (v_ArrVal_1727 (Array Int Int)) (v_ArrVal_1724 Int)) (= (select (select (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1720))) (store .cse4 .cse1 (store (store (store (store (select .cse4 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 0) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 1) 0) (+ 2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_1724) (+ 3 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_1725))) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)) |c_threadThread1of2ForFork0_#t~nondet4|)) (< .cse2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_18| Int)) (or (forall ((v_ArrVal_1720 (Array Int Int)) (v_ArrVal_1725 Int) (v_ArrVal_1727 (Array Int Int)) (v_ArrVal_1724 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1720))) (store .cse5 .cse1 (store (store (store (store (select .cse5 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 0) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 1) 0) (+ 2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_1724) (+ 3 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_1725))) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (< .cse2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|))))) is different from false [2023-11-21 19:49:06,873 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~ts~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~ts~0#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (and (forall ((|ULTIMATE.start_main_~t~1#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_18| Int) (v_ArrVal_1712 Int)) (or (< (select (store .cse0 .cse1 |ULTIMATE.start_main_~t~1#1.offset|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) (forall ((v_ArrVal_1720 (Array Int Int)) (v_ArrVal_1725 Int) (v_ArrVal_1727 (Array Int Int)) (v_ArrVal_1724 Int)) (= (select (select (store (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1720)) (.cse3 (select (store .cse4 .cse1 v_ArrVal_1712) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse2 .cse3 (store (store (store (store (select .cse2 .cse3) |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 0) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 1) 0) (+ 2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_1724) (+ 3 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_1725))) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)))) (forall ((|ULTIMATE.start_main_~t~1#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_18| Int) (v_ArrVal_1712 Int)) (or (< (select (store .cse0 .cse1 |ULTIMATE.start_main_~t~1#1.offset|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) (forall ((v_ArrVal_1720 (Array Int Int)) (v_ArrVal_1725 Int) (v_ArrVal_1727 (Array Int Int)) (v_ArrVal_1724 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1720)) (.cse6 (select (store .cse4 .cse1 v_ArrVal_1712) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse5 .cse6 (store (store (store (store (select .cse5 .cse6) |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 0) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 1) 0) (+ 2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_1724) (+ 3 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_1725))) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))))) (forall ((|ULTIMATE.start_main_~t~1#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_18| Int) (v_ArrVal_1712 Int)) (or (< (select (store .cse0 .cse1 |ULTIMATE.start_main_~t~1#1.offset|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) (forall ((v_ArrVal_1720 (Array Int Int)) (v_ArrVal_1725 Int) (v_ArrVal_1727 (Array Int Int)) (v_ArrVal_1724 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1720)) (.cse8 (select (store .cse4 .cse1 v_ArrVal_1712) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse7 .cse8 (store (store (store (store (select .cse7 .cse8) |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 0) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 1) 0) (+ 2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_1724) (+ 3 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_1725))) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))))) (forall ((|ULTIMATE.start_main_~t~1#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_18| Int) (v_ArrVal_1712 Int)) (or (< (select (store .cse0 .cse1 |ULTIMATE.start_main_~t~1#1.offset|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) (forall ((v_ArrVal_1720 (Array Int Int)) (v_ArrVal_1725 Int) (v_ArrVal_1727 (Array Int Int)) (v_ArrVal_1724 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1720)) (.cse10 (select (store .cse4 .cse1 v_ArrVal_1712) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse9 .cse10 (store (store (store (store (select .cse9 .cse10) |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 0) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 1) 0) (+ 2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_1724) (+ 3 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_1725))) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))))))) is different from false [2023-11-21 19:49:07,028 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~ts~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~ts~0#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (and (forall ((|ULTIMATE.start_main_~t~1#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_18| Int) (v_ArrVal_1712 Int)) (or (< (select (store .cse0 .cse1 |ULTIMATE.start_main_~t~1#1.offset|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) (forall ((v_ArrVal_1720 (Array Int Int)) (v_ArrVal_1725 Int) (v_ArrVal_1727 (Array Int Int)) (v_ArrVal_1724 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1720)) (.cse3 (select (store .cse4 .cse1 v_ArrVal_1712) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse2 .cse3 (store (store (store (store (select .cse2 .cse3) |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 0) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 1) 0) (+ 2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_1724) (+ 3 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_1725))) |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))))) (forall ((|ULTIMATE.start_main_~t~1#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_18| Int) (v_ArrVal_1712 Int)) (or (< (select (store .cse0 .cse1 |ULTIMATE.start_main_~t~1#1.offset|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) (forall ((v_ArrVal_1720 (Array Int Int)) (v_ArrVal_1725 Int) (v_ArrVal_1727 (Array Int Int)) (v_ArrVal_1724 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1720)) (.cse6 (select (store .cse4 .cse1 v_ArrVal_1712) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse5 .cse6 (store (store (store (store (select .cse5 .cse6) |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 0) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 1) 0) (+ 2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_1724) (+ 3 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_1725))) |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))))) (forall ((|ULTIMATE.start_main_~t~1#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_18| Int) (v_ArrVal_1712 Int)) (or (< (select (store .cse0 .cse1 |ULTIMATE.start_main_~t~1#1.offset|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) (forall ((v_ArrVal_1720 (Array Int Int)) (v_ArrVal_1725 Int) (v_ArrVal_1727 (Array Int Int)) (v_ArrVal_1724 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1720)) (.cse8 (select (store .cse4 .cse1 v_ArrVal_1712) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse7 .cse8 (store (store (store (store (select .cse7 .cse8) |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 0) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 1) 0) (+ 2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_1724) (+ 3 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_1725))) |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)))))) (forall ((|ULTIMATE.start_main_~t~1#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_18| Int) (v_ArrVal_1712 Int)) (or (forall ((v_ArrVal_1720 (Array Int Int)) (v_ArrVal_1725 Int) (v_ArrVal_1727 (Array Int Int)) (v_ArrVal_1724 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1720)) (.cse10 (select (store .cse4 .cse1 v_ArrVal_1712) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse9 .cse10 (store (store (store (store (select .cse9 .cse10) |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 0) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_18| 1) 0) (+ 2 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_1724) (+ 3 |v_ULTIMATE.start_main_#t~mem13#1.offset_18|) v_ArrVal_1725))) |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_1727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (< (select (store .cse0 .cse1 |ULTIMATE.start_main_~t~1#1.offset|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_18|))))) is different from false [2023-11-21 19:50:13,003 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:50:13,003 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 113 treesize of output 104 [2023-11-21 19:50:13,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:50:13,018 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 2838 treesize of output 2613 [2023-11-21 19:50:13,033 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 454 treesize of output 422 [2023-11-21 19:50:13,046 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 3056 treesize of output 3016 [2023-11-21 19:50:13,413 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:50:13,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 826 treesize of output 658 [2023-11-21 19:50:13,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:50:13,616 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 113 treesize of output 104 [2023-11-21 19:50:13,628 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:50:13,628 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 1068 treesize of output 967 [2023-11-21 19:50:13,648 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 432 treesize of output 400 [2023-11-21 19:50:13,676 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 3034 treesize of output 2994 [2023-11-21 19:50:14,126 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:50:14,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1438 treesize of output 1166 [2023-11-21 19:50:14,345 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:50:14,345 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 113 treesize of output 104 [2023-11-21 19:50:14,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:50:14,359 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 1242 treesize of output 1125 [2023-11-21 19:50:14,372 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 487 treesize of output 455 [2023-11-21 19:50:14,386 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 5808 treesize of output 5736 [2023-11-21 19:50:15,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:50:15,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2832 treesize of output 2256 [2023-11-21 19:50:15,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:50:15,162 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 113 treesize of output 104 [2023-11-21 19:50:15,166 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:50:15,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:50:15,175 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 434 treesize of output 395 [2023-11-21 19:50:15,191 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 1559 treesize of output 1535 [2023-11-21 19:50:15,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:50:15,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 6949 treesize of output 5557 Killed by 15