./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-in-array.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/config/GemCutterReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-in-array.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/config/svcomp-DataRace-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F --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 0026ab1092a8a0465a20b39c2dea92fa9c4dc52098c477016ebc8544f5aaf0f0 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 12:27:01,049 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 12:27:01,108 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2024-11-13 12:27:01,113 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 12:27:01,113 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 12:27:01,134 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 12:27:01,135 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 12:27:01,135 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 12:27:01,135 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 12:27:01,135 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 12:27:01,136 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 12:27:01,136 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 12:27:01,136 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 12:27:01,136 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 12:27:01,136 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 12:27:01,136 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 12:27:01,136 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 12:27:01,136 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 12:27:01,137 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 12:27:01,137 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 12:27:01,137 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 12:27:01,137 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 12:27:01,137 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-13 12:27:01,137 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 12:27:01,137 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 12:27:01,137 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 12:27:01,137 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 12:27:01,138 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 12:27:01,138 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 12:27:01,138 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 12:27:01,138 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-11-13 12:27:01,138 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 12:27:01,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 12:27:01,138 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 12:27:01,138 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 12:27:01,139 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 12:27:01,139 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 12:27:01,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 12:27:01,139 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 12:27:01,139 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-11-13 12:27:01,139 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-13 12:27:01,139 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-13 12:27:01,139 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-13 12:27:01,139 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F 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 -> 0026ab1092a8a0465a20b39c2dea92fa9c4dc52098c477016ebc8544f5aaf0f0 [2024-11-13 12:27:01,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 12:27:01,420 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 12:27:01,423 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 12:27:01,424 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 12:27:01,424 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 12:27:01,425 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/../../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-in-array.i Unable to find full path for "g++" [2024-11-13 12:27:03,268 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 12:27:03,614 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 12:27:03,614 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/sv-benchmarks/c/pthread-race-challenges/per-thread-struct-in-array.i [2024-11-13 12:27:03,631 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/data/c211e7174/c4b8fa07781c4532a27b10ba31730622/FLAGe990349fd [2024-11-13 12:27:03,842 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/data/c211e7174/c4b8fa07781c4532a27b10ba31730622 [2024-11-13 12:27:03,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 12:27:03,849 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 12:27:03,850 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 12:27:03,851 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 12:27:03,856 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 12:27:03,858 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:27:03" (1/1) ... [2024-11-13 12:27:03,860 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40c1ad49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:27:03, skipping insertion in model container [2024-11-13 12:27:03,861 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:27:03" (1/1) ... [2024-11-13 12:27:03,923 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 12:27:04,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:27:04,517 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 12:27:04,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:27:04,634 INFO L204 MainTranslator]: Completed translation [2024-11-13 12:27:04,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:27:04 WrapperNode [2024-11-13 12:27:04,635 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 12:27:04,636 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 12:27:04,636 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 12:27:04,636 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 12:27:04,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:27:04" (1/1) ... [2024-11-13 12:27:04,656 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:27:04" (1/1) ... [2024-11-13 12:27:04,676 INFO L138 Inliner]: procedures = 261, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 59 [2024-11-13 12:27:04,676 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 12:27:04,677 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 12:27:04,677 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 12:27:04,677 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 12:27:04,684 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:27:04" (1/1) ... [2024-11-13 12:27:04,684 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:27:04" (1/1) ... [2024-11-13 12:27:04,687 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:27:04" (1/1) ... [2024-11-13 12:27:04,687 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:27:04" (1/1) ... [2024-11-13 12:27:04,694 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:27:04" (1/1) ... [2024-11-13 12:27:04,697 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:27:04" (1/1) ... [2024-11-13 12:27:04,699 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:27:04" (1/1) ... [2024-11-13 12:27:04,700 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:27:04" (1/1) ... [2024-11-13 12:27:04,702 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 12:27:04,703 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 12:27:04,703 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 12:27:04,703 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 12:27:04,704 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:27:04" (1/1) ... [2024-11-13 12:27:04,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 12:27:04,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/z3 [2024-11-13 12:27:04,742 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-13 12:27:04,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-13 12:27:04,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 12:27:04,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 12:27:04,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 12:27:04,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 12:27:04,768 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-13 12:27:04,769 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-13 12:27:04,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 12:27:04,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 12:27:04,771 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 12:27:04,909 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 12:27:04,910 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 12:27:05,124 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 12:27:05,124 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 12:27:05,139 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 12:27:05,139 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-13 12:27:05,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:27:05 BoogieIcfgContainer [2024-11-13 12:27:05,143 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 12:27:05,146 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 12:27:05,146 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 12:27:05,151 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 12:27:05,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 12:27:03" (1/3) ... [2024-11-13 12:27:05,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@757a1992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:27:05, skipping insertion in model container [2024-11-13 12:27:05,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:27:04" (2/3) ... [2024-11-13 12:27:05,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@757a1992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:27:05, skipping insertion in model container [2024-11-13 12:27:05,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:27:05" (3/3) ... [2024-11-13 12:27:05,155 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-struct-in-array.i [2024-11-13 12:27:05,171 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 12:27:05,174 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-struct-in-array.i that has 2 procedures, 80 locations, 1 initial locations, 2 loop locations, and 3 error locations. [2024-11-13 12:27:05,175 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 12:27:05,243 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-13 12:27:05,326 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:27:05,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-13 12:27:05,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/z3 [2024-11-13 12:27:05,330 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-13 12:27:05,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-13 12:27:05,360 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 12:27:05,372 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of1ForFork0 ======== [2024-11-13 12:27:05,385 INFO L333 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, 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;@1cbb993d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:27:05,385 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 12:27:05,832 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 12:27:05,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:27:05,838 INFO L85 PathProgramCache]: Analyzing trace with hash 188756657, now seen corresponding path program 1 times [2024-11-13 12:27:05,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:27:05,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552650285] [2024-11-13 12:27:05,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:27:05,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:27:05,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:27:06,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:27:06,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:27:06,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552650285] [2024-11-13 12:27:06,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552650285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:27:06,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:27:06,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 12:27:06,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313432574] [2024-11-13 12:27:06,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:27:06,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 12:27:06,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:27:06,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 12:27:06,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 12:27:06,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:06,083 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:27:06,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:27:06,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:06,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:06,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 12:27:06,124 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 12:27:06,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:27:06,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1922340584, now seen corresponding path program 1 times [2024-11-13 12:27:06,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:27:06,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905562521] [2024-11-13 12:27:06,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:27:06,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:27:06,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:27:07,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:27:07,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:27:07,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905562521] [2024-11-13 12:27:07,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905562521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:27:07,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:27:07,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:27:07,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687192670] [2024-11-13 12:27:07,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:27:07,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:27:07,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:27:07,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:27:07,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:27:07,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:07,053 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:27:07,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:27:07,054 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:07,054 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:07,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:07,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:27:07,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 12:27:07,646 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 12:27:07,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:27:07,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1954910409, now seen corresponding path program 1 times [2024-11-13 12:27:07,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:27:07,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268207503] [2024-11-13 12:27:07,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:27:07,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:27:07,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:27:08,504 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:27:08,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:27:08,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268207503] [2024-11-13 12:27:08,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268207503] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:27:08,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802353054] [2024-11-13 12:27:08,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:27:08,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:27:08,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/z3 [2024-11-13 12:27:08,509 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:27:08,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 12:27:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:27:08,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-13 12:27:08,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:27:08,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 12:27:08,737 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 12:27:08,738 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 [2024-11-13 12:27:08,807 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 [2024-11-13 12:27:08,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-13 12:27:08,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:27:08,855 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 30 treesize of output 32 [2024-11-13 12:27:08,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:27:08,889 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 39 treesize of output 44 [2024-11-13 12:27:09,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-13 12:27:09,190 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:27:09,191 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:27:11,580 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 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_111 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_111) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_111 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_111) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_111 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_111) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_111 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_111) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2024-11-13 12:27:11,609 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) (.cse2 (+ 3 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_111 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_111) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_111 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_111) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_111 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_111) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_111 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_111) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2024-11-13 12:27:15,752 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:27:15,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802353054] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:27:15,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:27:15,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2024-11-13 12:27:15,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323662404] [2024-11-13 12:27:15,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:27:15,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 12:27:15,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:27:15,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 12:27:15,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=221, Unknown=10, NotChecked=62, Total=342 [2024-11-13 12:27:15,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:15,760 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:27:15,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.111111111111111) internal successors, (74), 19 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) [2024-11-13 12:27:15,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:15,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:27:15,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:19,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:19,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:27:19,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:27:19,556 INFO L782 garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-13 12:27:19,578 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 12:27:19,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:27:19,768 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-13 12:27:19,769 INFO L320 ceAbstractionStarter]: Result for error location threadThread1of1ForFork0 was SAFE (1/2) [2024-11-13 12:27:19,776 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:27:19,779 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 12:27:19,780 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-13 12:27:19,781 INFO L333 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, 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;@1cbb993d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:27:19,783 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-13 12:27:19,791 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 12:27:19,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:27:19,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1166940868, now seen corresponding path program 1 times [2024-11-13 12:27:19,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:27:19,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441671593] [2024-11-13 12:27:19,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:27:19,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:27:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:27:19,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:27:19,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:27:19,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441671593] [2024-11-13 12:27:19,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441671593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:27:19,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:27:19,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 12:27:19,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590483073] [2024-11-13 12:27:19,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:27:19,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 12:27:19,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:27:19,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 12:27:19,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 12:27:19,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:19,840 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:27:19,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:27:19,840 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:19,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:19,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 12:27:19,842 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 12:27:19,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:27:19,843 INFO L85 PathProgramCache]: Analyzing trace with hash -400146909, now seen corresponding path program 1 times [2024-11-13 12:27:19,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:27:19,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591896806] [2024-11-13 12:27:19,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:27:19,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:27:19,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:27:20,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:27:20,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:27:20,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591896806] [2024-11-13 12:27:20,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591896806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:27:20,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:27:20,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:27:20,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423035873] [2024-11-13 12:27:20,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:27:20,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:27:20,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:27:20,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:27:20,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:27:20,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:20,127 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:27:20,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:27:20,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:20,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:20,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:20,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:27:20,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 12:27:20,279 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 12:27:20,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:27:20,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1944233106, now seen corresponding path program 1 times [2024-11-13 12:27:20,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:27:20,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752567149] [2024-11-13 12:27:20,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:27:20,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:27:20,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:27:20,332 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:27:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:27:20,374 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:27:20,377 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 12:27:20,377 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-11-13 12:27:20,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (1 of 3 remaining) [2024-11-13 12:27:20,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (0 of 3 remaining) [2024-11-13 12:27:20,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 12:27:20,380 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-13 12:27:20,380 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN (2/2) [2024-11-13 12:27:20,381 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-13 12:27:20,383 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-13 12:27:20,406 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-13 12:27:20,409 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:27:20,412 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 12:27:20,413 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of2ForFork0 ======== [2024-11-13 12:27:20,414 INFO L333 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, 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;@1cbb993d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:27:20,414 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 12:27:20,704 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 12:27:20,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:27:20,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1207282145, now seen corresponding path program 1 times [2024-11-13 12:27:20,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:27:20,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434949327] [2024-11-13 12:27:20,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:27:20,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:27:20,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:27:20,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:27:20,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:27:20,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434949327] [2024-11-13 12:27:20,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434949327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:27:20,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:27:20,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 12:27:20,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789149646] [2024-11-13 12:27:20,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:27:20,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 12:27:20,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:27:20,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 12:27:20,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 12:27:20,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:20,737 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:27:20,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:27:20,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:20,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:20,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 12:27:20,748 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 12:27:20,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:27:20,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1910330551, now seen corresponding path program 1 times [2024-11-13 12:27:20,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:27:20,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754177466] [2024-11-13 12:27:20,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:27:20,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:27:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:27:21,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:27:21,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:27:21,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754177466] [2024-11-13 12:27:21,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754177466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:27:21,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:27:21,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:27:21,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168405304] [2024-11-13 12:27:21,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:27:21,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:27:21,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:27:21,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:27:21,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:27:21,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:21,109 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:27:21,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:27:21,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:21,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:22,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:22,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:27:22,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 12:27:22,983 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 12:27:22,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:27:22,984 INFO L85 PathProgramCache]: Analyzing trace with hash -937801432, now seen corresponding path program 1 times [2024-11-13 12:27:22,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:27:22,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161307423] [2024-11-13 12:27:22,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:27:22,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:27:23,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:27:23,735 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:27:23,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:27:23,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161307423] [2024-11-13 12:27:23,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161307423] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:27:23,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248699347] [2024-11-13 12:27:23,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:27:23,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:27:23,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/z3 [2024-11-13 12:27:23,739 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:27:23,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 12:27:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:27:23,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-13 12:27:23,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:27:23,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 12:27:23,917 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 12:27:23,919 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 [2024-11-13 12:27:23,972 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 [2024-11-13 12:27:23,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-13 12:27:23,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:27:23,998 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 30 treesize of output 32 [2024-11-13 12:27:24,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:27:24,023 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 39 treesize of output 44 [2024-11-13 12:27:24,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-13 12:27:24,226 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:27:24,226 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:27:26,530 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (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_273 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_273) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_273 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_273) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_273 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_273) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_273 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_273) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2024-11-13 12:27:30,838 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:27:30,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248699347] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:27:30,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:27:30,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2024-11-13 12:27:30,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930873455] [2024-11-13 12:27:30,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:27:30,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 12:27:30,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:27:30,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 12:27:30,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=238, Unknown=20, NotChecked=32, Total=342 [2024-11-13 12:27:30,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:30,843 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:27:30,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.111111111111111) internal successors, (74), 19 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) [2024-11-13 12:27:30,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:30,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:27:30,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:33,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:33,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:27:33,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:27:33,534 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 12:27:33,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:27:33,722 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 12:27:33,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:27:33,723 INFO L85 PathProgramCache]: Analyzing trace with hash -354474395, now seen corresponding path program 1 times [2024-11-13 12:27:33,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:27:33,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156805466] [2024-11-13 12:27:33,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:27:33,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:27:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:27:34,319 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 12:27:34,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:27:34,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156805466] [2024-11-13 12:27:34,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156805466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:27:34,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:27:34,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 12:27:34,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485929872] [2024-11-13 12:27:34,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:27:34,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:27:34,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:27:34,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:27:34,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:27:34,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:34,323 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:27:34,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:27:34,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:34,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:27:34,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:27:34,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:36,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:36,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:27:36,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:27:36,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:27:36,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 12:27:36,445 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 12:27:36,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:27:36,445 INFO L85 PathProgramCache]: Analyzing trace with hash 185285203, now seen corresponding path program 1 times [2024-11-13 12:27:36,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:27:36,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733530754] [2024-11-13 12:27:36,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:27:36,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:27:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:27:38,838 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:27:38,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:27:38,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733530754] [2024-11-13 12:27:38,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733530754] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:27:38,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853194555] [2024-11-13 12:27:38,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:27:38,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:27:38,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/z3 [2024-11-13 12:27:38,841 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:27:38,844 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 12:27:38,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:27:38,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-13 12:27:38,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:27:38,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 12:27:39,063 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 12:27:39,063 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 [2024-11-13 12:27:39,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 12:27:39,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-13 12:27:39,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2024-11-13 12:27:39,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2024-11-13 12:27:39,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-13 12:27:39,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-13 12:27:39,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-13 12:27:40,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-13 12:27:40,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-13 12:27:40,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-13 12:27:40,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-13 12:27:40,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-13 12:27:40,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:27:40,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:27:40,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:27:40,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:27:40,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:27:40,689 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 50 treesize of output 47 [2024-11-13 12:27:40,701 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 11 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:27:40,701 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:27:43,764 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_threadThread2of2ForFork0_#in~arg.base|))) (and (forall ((|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| (store .cse0 v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|)) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) (forall ((|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| (store .cse0 v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|)) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< v_threadThread2of2ForFork0_~t~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| (store .cse0 v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|)) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (< v_threadThread2of2ForFork0_~t~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|) (= (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| (store .cse0 v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|)) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2024-11-13 12:27:43,894 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_430 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_430))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) (forall ((|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_430 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_430))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< v_threadThread2of2ForFork0_~t~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_430 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_430))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))))) (forall ((|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_430 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_430))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|)))) is different from false [2024-11-13 12:27:44,559 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (and (forall ((|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_430 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_430))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse1))) (forall ((|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_430 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_430))) (store .cse2 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))) (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse1))) (forall ((|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_430 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_430))) (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse1))) (forall ((|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_430 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_430))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse1))))) is different from false [2024-11-13 12:27:45,124 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_#t~post11#1| 4) |c_ULTIMATE.start_main_~ts~0#1.offset| 4))) (and (forall ((|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_430 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_430))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse1))) (forall ((|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_430 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_430))) (store .cse2 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse1))) (forall ((|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_430 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_430))) (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse1))) (forall ((|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_430 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_430))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))) (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse1))))) is different from false [2024-11-13 12:27:45,191 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~ts~0#1.offset| 4))) (and (forall ((|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_430 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_430))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))) (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse1))) (forall ((|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_430 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_430))) (store .cse2 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse1))) (forall ((|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_430 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_430))) (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse1))) (forall ((|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_430 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse1) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_430))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false [2024-11-13 12:27:45,402 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse1 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~ts~0#1.offset| 4))) (and (forall ((|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_430 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (= (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_430))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse2))) (forall ((|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_430 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_430))) (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse4)) (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse2))) (forall ((|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_430 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse2) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_430))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_430 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (= (select (select (let ((.cse6 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_430))) (store .cse6 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse2)))))) is different from false [2024-11-13 12:27:45,466 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse4 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse1 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse7 |c_threadThread1of2ForFork0_#t~nondet4|) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~ts~0#1.offset| 4))) (and (forall ((|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_430 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_430))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse2))) (forall ((|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_430 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_430))) (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse4)) (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse2))) (forall ((|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_430 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_430))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))) (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse2))) (forall ((|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_430 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (= (select (select (let ((.cse6 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_430))) (store .cse6 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse7) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse2)))))) is different from false [2024-11-13 12:27:47,143 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse5 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse3 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~ts~0#1.offset| 4)) (.cse1 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse8 |c_threadThread1of2ForFork0_#t~nondet4|) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_430 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_430))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse2)) (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse3))) (forall ((|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_430 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_430))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse5)) (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse3))) (forall ((|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_430 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse3) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_430))) (store .cse6 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_430 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse3) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_430))) (store .cse7 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse8))))))) is different from false [2024-11-13 12:27:47,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:27:47,188 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 69 treesize of output 62 [2024-11-13 12:27:47,206 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:27:47,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 444 treesize of output 392 [2024-11-13 12:27:47,231 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 174 treesize of output 158 [2024-11-13 12:27:47,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:27:47,378 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 85 treesize of output 51 [2024-11-13 12:27:47,413 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2024-11-13 12:27:47,413 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 69 treesize of output 1 [2024-11-13 12:27:47,424 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2024-11-13 12:27:47,424 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 69 treesize of output 1 [2024-11-13 12:27:47,434 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2024-11-13 12:27:47,434 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 67 treesize of output 1 [2024-11-13 12:27:47,693 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 39 not checked. [2024-11-13 12:27:47,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853194555] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:27:47,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:27:47,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 44 [2024-11-13 12:27:47,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072255992] [2024-11-13 12:27:47,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:27:47,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-13 12:27:47,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:27:47,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-13 12:27:47,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1167, Unknown=8, NotChecked=616, Total=1980 [2024-11-13 12:27:47,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:47,697 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:27:47,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 3.977272727272727) internal successors, (175), 45 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:27:47,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:47,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:27:47,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:27:47,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:27:47,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:56,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:56,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:27:56,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 12:27:56,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:27:56,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-13 12:27:56,806 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 12:27:56,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:27:56,991 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 12:27:56,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:27:56,991 INFO L85 PathProgramCache]: Analyzing trace with hash 857885141, now seen corresponding path program 2 times [2024-11-13 12:27:56,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:27:56,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668659470] [2024-11-13 12:27:56,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:27:56,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:27:57,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:27:59,307 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:27:59,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:27:59,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668659470] [2024-11-13 12:27:59,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668659470] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:27:59,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969985909] [2024-11-13 12:27:59,308 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 12:27:59,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:27:59,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/z3 [2024-11-13 12:27:59,311 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:27:59,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 12:27:59,479 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 12:27:59,480 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:27:59,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-13 12:27:59,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:27:59,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 12:27:59,579 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 12:27:59,580 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 [2024-11-13 12:28:00,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 12:28:00,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-13 12:28:00,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-13 12:28:00,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-13 12:28:00,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-11-13 12:28:00,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-11-13 12:28:00,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-11-13 12:28:01,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-11-13 12:28:01,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-11-13 12:28:01,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-11-13 12:28:01,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-11-13 12:28:01,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-11-13 12:28:01,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:28:01,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:28:01,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:28:01,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:28:01,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:28:01,876 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 44 treesize of output 41 [2024-11-13 12:28:01,936 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:28:01,936 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:28:03,006 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_21 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_540 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_21 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_540))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_21 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_540 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_21 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_540))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_21 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_540 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_21 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_540))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_21 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_540 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_540))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (< v_threadThread2of2ForFork0_~t~0.offset_21 |c_threadThread2of2ForFork0_#in~arg.offset|)))) is different from false [2024-11-13 12:28:03,695 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_21 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_540 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_540))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (< v_threadThread2of2ForFork0_~t~0.offset_21 .cse1))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_21 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_540 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_540))) (store .cse2 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (< v_threadThread2of2ForFork0_~t~0.offset_21 .cse1))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_21 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_540 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_540))) (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< v_threadThread2of2ForFork0_~t~0.offset_21 .cse1))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_21 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_540 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_540))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))) (< v_threadThread2of2ForFork0_~t~0.offset_21 .cse1))))) is different from false [2024-11-13 12:28:03,957 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse1 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_21 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_540 (Array Int Int))) (or (= (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_540))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_21 .cse2))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_21 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_540 (Array Int Int))) (or (= (select (select (let ((.cse3 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_540))) (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_21 .cse2))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_21 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_540 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_540))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse5)) (< v_threadThread2of2ForFork0_~t~0.offset_21 .cse2))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_21 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_540 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_540))) (store .cse6 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< v_threadThread2of2ForFork0_~t~0.offset_21 .cse2)))))) is different from false [2024-11-13 12:28:04,028 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_21 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_532) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_540))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (< v_threadThread2of2ForFork0_~t~0.offset_21 .cse2))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_21 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (or (= (select (select (let ((.cse3 (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_532) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_540))) (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_21 .cse2))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_21 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (or (= (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_532) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_540))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_21 .cse2))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_21 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_21 .cse2) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_532) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_540))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false [2024-11-13 12:28:04,402 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse0 (+ (* |c_ULTIMATE.start_main_#t~post11#1| 4) |c_ULTIMATE.start_main_~ts~0#1.offset| 4))) (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_21 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_21 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_532) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_540))) (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_21 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_21 .cse0) (= (select (select (let ((.cse3 (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_532) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_540))) (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_21 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_21 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_532) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_540))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_21 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (or (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_532) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_540))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_21 .cse0))))) is different from false [2024-11-13 12:28:04,469 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~ts~0#1.offset| 4)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_21 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_532) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_540))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (< v_threadThread2of2ForFork0_~t~0.offset_21 .cse2))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_21 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (or (= (select (select (let ((.cse3 (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_532) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_540))) (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_21 .cse2))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_21 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_21 .cse2) (= (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_532) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_540))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_21 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_21 .cse2) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_532) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_540))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false [2024-11-13 12:28:04,703 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~ts~0#1.offset| 4)) (.cse2 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_21 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_21 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_532) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_540))) (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse4)))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_21 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_21 .cse0) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_532) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_540))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_21 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (or (= (select (select (let ((.cse6 (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_532) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_540))) (store .cse6 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_21 .cse0))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_21 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_21 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_532) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_540))) (store .cse7 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))))))) is different from false [2024-11-13 12:28:04,781 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse8 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse1 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|) .cse8 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse3 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~ts~0#1.offset| 4))) (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_21 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_532) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_540))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< v_threadThread2of2ForFork0_~t~0.offset_21 .cse3))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_21 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_21 .cse3) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_532) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_540))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse2)))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_21 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_532) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_540))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse6)) (< v_threadThread2of2ForFork0_~t~0.offset_21 .cse3))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_21 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_532) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_540))) (store .cse7 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse8)) (< v_threadThread2of2ForFork0_~t~0.offset_21 .cse3)))))) is different from false [2024-11-13 12:28:04,849 INFO L349 Elim1Store]: treesize reduction 23, result has 62.9 percent of original size [2024-11-13 12:28:04,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 886 treesize of output 700 [2024-11-13 12:28:04,868 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 268 treesize of output 252 [2024-11-13 12:28:04,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:28:04,887 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 408 treesize of output 362 [2024-11-13 12:28:04,904 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 108 treesize of output 104 [2024-11-13 12:28:05,149 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:28:05,186 INFO L349 Elim1Store]: treesize reduction 38, result has 38.7 percent of original size [2024-11-13 12:28:05,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 282 treesize of output 265 [2024-11-13 12:28:05,199 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 44 treesize of output 40 [2024-11-13 12:28:05,204 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:28:05,217 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 12:28:05,218 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 117 treesize of output 103 [2024-11-13 12:28:05,258 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:28:05,269 INFO L349 Elim1Store]: treesize reduction 61, result has 1.6 percent of original size [2024-11-13 12:28:05,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 498 treesize of output 1 [2024-11-13 12:28:05,276 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:28:05,288 INFO L349 Elim1Store]: treesize reduction 61, result has 1.6 percent of original size [2024-11-13 12:28:05,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 530 treesize of output 1 [2024-11-13 12:28:05,656 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 37 not checked. [2024-11-13 12:28:05,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969985909] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:28:05,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:28:05,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 54 [2024-11-13 12:28:05,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094824687] [2024-11-13 12:28:05,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:28:05,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-13 12:28:05,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:28:05,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-13 12:28:05,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1945, Unknown=8, NotChecked=776, Total=2970 [2024-11-13 12:28:05,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:28:05,661 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:28:05,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 4.074074074074074) internal successors, (220), 55 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:28:05,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:28:05,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:28:05,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-11-13 12:28:05,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:28:05,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2024-11-13 12:28:05,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:28:11,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:28:11,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:28:11,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 12:28:11,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:28:11,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-13 12:28:11,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-13 12:28:11,259 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 12:28:11,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-13 12:28:11,446 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 12:28:11,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:28:11,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1464421783, now seen corresponding path program 2 times [2024-11-13 12:28:11,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:28:11,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648861051] [2024-11-13 12:28:11,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:28:11,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:28:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:28:12,126 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 12:28:12,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:28:12,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648861051] [2024-11-13 12:28:12,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648861051] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:28:12,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451043071] [2024-11-13 12:28:12,127 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 12:28:12,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:28:12,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/z3 [2024-11-13 12:28:12,130 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:28:12,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 12:28:12,269 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 12:28:12,270 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:28:12,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-13 12:28:12,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:28:12,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 12:28:12,336 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 12:28:12,336 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 [2024-11-13 12:28:12,639 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 15 treesize of output 11 [2024-11-13 12:28:12,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-13 12:28:12,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2024-11-13 12:28:12,794 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:28:12,794 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 40 treesize of output 42 [2024-11-13 12:28:12,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:28:12,864 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 52 treesize of output 57 [2024-11-13 12:28:12,932 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:28:12,932 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:28:14,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:28:14,627 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 1 case distinctions, treesize of input 26 treesize of output 27 [2024-11-13 12:28:14,630 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 26 treesize of output 18 [2024-11-13 12:28:14,709 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 12:28:14,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451043071] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:28:14,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:28:14,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 14] total 29 [2024-11-13 12:28:14,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288180432] [2024-11-13 12:28:14,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:28:14,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-13 12:28:14,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:28:14,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-13 12:28:14,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=686, Unknown=10, NotChecked=0, Total=812 [2024-11-13 12:28:14,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:28:14,712 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:28:14,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.344827586206897) internal successors, (126), 29 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:28:14,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:28:14,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:28:14,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-11-13 12:28:14,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:28:14,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-11-13 12:28:14,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2024-11-13 12:28:14,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:28:16,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:28:16,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:28:16,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 12:28:16,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:28:16,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-13 12:28:16,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-13 12:28:16,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-13 12:28:16,332 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-13 12:28:16,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:28:16,512 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 12:28:16,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:28:16,513 INFO L85 PathProgramCache]: Analyzing trace with hash 736491873, now seen corresponding path program 3 times [2024-11-13 12:28:16,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:28:16,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242846126] [2024-11-13 12:28:16,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:28:16,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:28:16,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:28:18,147 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:28:18,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:28:18,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242846126] [2024-11-13 12:28:18,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242846126] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:28:18,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301490197] [2024-11-13 12:28:18,148 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 12:28:18,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:28:18,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/z3 [2024-11-13 12:28:18,149 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:28:18,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 12:28:18,356 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-13 12:28:18,356 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:28:18,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-13 12:28:18,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:28:18,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 12:28:18,428 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 12:28:18,428 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 [2024-11-13 12:28:18,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 12:28:18,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-13 12:28:18,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2024-11-13 12:28:19,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-13 12:28:19,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-13 12:28:19,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-13 12:28:19,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-13 12:28:19,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-13 12:28:19,435 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 39 treesize of output 44 [2024-11-13 12:28:19,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-13 12:28: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 43 treesize of output 32 [2024-11-13 12:28:19,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-11-13 12:28:19,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:28:19,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:28:19,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:28:19,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:28:19,787 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:28:19,787 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 50 treesize of output 47 [2024-11-13 12:28:19,798 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 11 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:28:19,798 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:28:20,606 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_755 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_25 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_755))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_ArrVal_755 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_25 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_755))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))))) (forall ((v_ArrVal_755 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_755))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (< v_threadThread2of2ForFork0_~t~0.offset_25 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_755 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_25 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_755))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))))) is different from false [2024-11-13 12:28:21,502 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_755 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_751 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_751) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_755))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< v_threadThread2of2ForFork0_~t~0.offset_25 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_755 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_751 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_25 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_751) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_755))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) (forall ((v_ArrVal_755 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_751 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_751) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_755))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse1)) (< v_threadThread2of2ForFork0_~t~0.offset_25 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_755 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_751 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_751) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_755))) (store .cse4 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse4 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (< v_threadThread2of2ForFork0_~t~0.offset_25 |c_threadThread2of2ForFork0_#in~arg.offset|))))) is different from false [2024-11-13 12:28:22,143 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (and (forall ((v_ArrVal_755 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_751 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_751) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_755))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< v_threadThread2of2ForFork0_~t~0.offset_25 .cse2))) (forall ((v_ArrVal_755 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_751 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_25 .cse2) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_751) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_755))) (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) (forall ((v_ArrVal_755 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_751 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_25 .cse2) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_751) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_755))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse1)))) (forall ((v_ArrVal_755 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_751 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_751) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_755))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (< v_threadThread2of2ForFork0_~t~0.offset_25 .cse2))))) is different from false [2024-11-13 12:28:22,759 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse2 (+ (* |c_ULTIMATE.start_main_#t~post11#1| 4) |c_ULTIMATE.start_main_~ts~0#1.offset| 4))) (and (forall ((v_ArrVal_755 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_751 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_751) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_755))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))) (< v_threadThread2of2ForFork0_~t~0.offset_25 .cse2))) (forall ((v_ArrVal_755 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_751 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_751) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_755))) (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (< v_threadThread2of2ForFork0_~t~0.offset_25 .cse2))) (forall ((v_ArrVal_755 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_751 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_25 .cse2) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_751) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_755))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse1)))) (forall ((v_ArrVal_755 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_751 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_751) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_755))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< v_threadThread2of2ForFork0_~t~0.offset_25 .cse2))))) is different from false [2024-11-13 12:28:22,834 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~ts~0#1.offset| 4)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_755 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_751 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_751) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_755))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< v_threadThread2of2ForFork0_~t~0.offset_25 .cse2))) (forall ((v_ArrVal_755 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_751 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_25 .cse2) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_751) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_755))) (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse1)))) (forall ((v_ArrVal_755 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_751 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_751) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_755))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (< v_threadThread2of2ForFork0_~t~0.offset_25 .cse2))) (forall ((v_ArrVal_755 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_751 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_25 .cse2) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_751) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_755))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false [2024-11-13 12:28:23,019 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse1 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse3 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~ts~0#1.offset| 4))) (and (forall ((v_ArrVal_755 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_751 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_751) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_755))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse2)) (< v_threadThread2of2ForFork0_~t~0.offset_25 .cse3))) (forall ((v_ArrVal_755 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_751 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_751) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_755))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse5)) (< v_threadThread2of2ForFork0_~t~0.offset_25 .cse3))) (forall ((v_ArrVal_755 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_751 (Array Int Int))) (or (= (select (select (let ((.cse6 (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_751) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_755))) (store .cse6 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_25 .cse3))) (forall ((v_ArrVal_755 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_751 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_751) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_755))) (store .cse7 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< v_threadThread2of2ForFork0_~t~0.offset_25 .cse3)))))) is different from false [2024-11-13 12:28:23,077 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse6 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse1 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse4 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~ts~0#1.offset| 4))) (and (forall ((v_ArrVal_755 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_751 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_751) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_755))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse3)) (< v_threadThread2of2ForFork0_~t~0.offset_25 .cse4))) (forall ((v_ArrVal_755 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_751 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_25 .cse4) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_751) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_755))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse6)))) (forall ((v_ArrVal_755 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_751 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_751) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_755))) (store .cse7 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse2)) (< v_threadThread2of2ForFork0_~t~0.offset_25 .cse4))) (forall ((v_ArrVal_755 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_751 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse8 (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_751) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_755))) (store .cse8 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< v_threadThread2of2ForFork0_~t~0.offset_25 .cse4)))))) is different from false [2024-11-13 12:28:23,138 INFO L349 Elim1Store]: treesize reduction 23, result has 62.9 percent of original size [2024-11-13 12:28:23,139 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 785 treesize of output 621 [2024-11-13 12:28:23,157 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 268 treesize of output 252 [2024-11-13 12:28:23,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:28:23,177 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 376 treesize of output 338 [2024-11-13 12:28:23,194 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 145 treesize of output 141 [2024-11-13 12:28:23,393 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:28:23,430 INFO L349 Elim1Store]: treesize reduction 38, result has 38.7 percent of original size [2024-11-13 12:28:23,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 136 treesize of output 139 [2024-11-13 12:28:23,437 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:28:23,440 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 76 [2024-11-13 12:28:23,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:28:23,476 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:28:23,488 INFO L349 Elim1Store]: treesize reduction 61, result has 1.6 percent of original size [2024-11-13 12:28:23,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 244 treesize of output 1 [2024-11-13 12:28:23,494 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:28:23,505 INFO L349 Elim1Store]: treesize reduction 61, result has 1.6 percent of original size [2024-11-13 12:28:23,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 260 treesize of output 1 [2024-11-13 12:28:23,731 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 37 not checked. [2024-11-13 12:28:23,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301490197] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:28:23,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:28:23,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 20] total 44 [2024-11-13 12:28:23,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603965793] [2024-11-13 12:28:23,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:28:23,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-13 12:28:23,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:28:23,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-13 12:28:23,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1236, Unknown=27, NotChecked=546, Total=1980 [2024-11-13 12:28:23,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:28:23,734 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:28:23,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 3.9545454545454546) internal successors, (174), 45 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:28:23,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:28:23,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:28:23,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-11-13 12:28:23,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:28:23,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-11-13 12:28:23,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2024-11-13 12:28:23,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-11-13 12:28:23,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:28:30,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:28:30,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:28:30,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 12:28:30,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:28:30,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-13 12:28:30,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-13 12:28:30,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-13 12:28:30,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-13 12:28:30,403 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 12:28:30,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:28:30,590 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 12:28:30,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:28:30,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1862085653, now seen corresponding path program 4 times [2024-11-13 12:28:30,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:28:30,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011665552] [2024-11-13 12:28:30,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:28:30,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:28:30,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:28:32,020 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:28:32,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:28:32,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011665552] [2024-11-13 12:28:32,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011665552] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:28:32,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144355269] [2024-11-13 12:28:32,021 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 12:28:32,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:28:32,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/z3 [2024-11-13 12:28:32,023 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:28:32,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfb5c4d9-d6e0-4790-aa30-d26c1dc09fb8/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 12:28:32,262 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 12:28:32,262 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:28:32,265 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-11-13 12:28:32,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:28:32,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 12:28:32,372 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 12:28:32,372 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 [2024-11-13 12:28:32,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 12:28:32,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-13 12:28:32,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-13 12:28:33,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2024-11-13 12:28:33,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2024-11-13 12:28:33,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2024-11-13 12:28:33,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 53 [2024-11-13 12:28:34,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2024-11-13 12:28:34,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:28:34,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 67 [2024-11-13 12:28:34,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:28:34,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 70 [2024-11-13 12:28:34,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:28:34,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:28:34,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 78 [2024-11-13 12:28:43,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:28:43,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:28:43,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:28:43,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:28:43,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:28:43,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 13 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 81 [2024-11-13 12:29:01,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:29:01,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:29:01,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 13 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 88 [2024-11-13 12:29:01,830 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:29:01,830 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:30:24,332 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse0 (+ .cse9 |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse2 (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse9 3) |c_ULTIMATE.start_main_#t~nondet9#1|))) (and (forall ((v_ArrVal_863 Int) (v_threadThread2of2ForFork0_~t~0.offset_27 Int) (|v_ULTIMATE.start_main_~i~0#1_39| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_subst_3 Int) (v_ArrVal_867 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_27 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse3 (* |v_ULTIMATE.start_main_~i~0#1_39| 4))) (store (store (store (store .cse2 (+ .cse3 |c_ULTIMATE.start_main_~tids~0#1.offset|) v_ArrVal_863) (+ .cse3 |c_ULTIMATE.start_main_~tids~0#1.offset| 1) v_subst_3) (+ .cse3 |c_ULTIMATE.start_main_~tids~0#1.offset| 2) v_ArrVal_867) (+ .cse3 |c_ULTIMATE.start_main_~tids~0#1.offset| 3) v_subst_3))))) (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_27 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< |v_ULTIMATE.start_main_~i~0#1_39| .cse4))) (forall ((v_ArrVal_863 Int) (v_threadThread2of2ForFork0_~t~0.offset_27 Int) (|v_ULTIMATE.start_main_~i~0#1_39| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_867 Int) (v_subst_2 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_27 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse6 (* |v_ULTIMATE.start_main_~i~0#1_39| 4))) (store (store (store (store .cse2 (+ .cse6 |c_ULTIMATE.start_main_~tids~0#1.offset|) v_ArrVal_863) (+ .cse6 |c_ULTIMATE.start_main_~tids~0#1.offset| 1) v_subst_2) (+ .cse6 |c_ULTIMATE.start_main_~tids~0#1.offset| 2) v_ArrVal_867) (+ .cse6 |c_ULTIMATE.start_main_~tids~0#1.offset| 3) v_subst_2))))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_27 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))) (< |v_ULTIMATE.start_main_~i~0#1_39| .cse4))) (forall ((v_ArrVal_863 Int) (v_threadThread2of2ForFork0_~t~0.offset_27 Int) (|v_ULTIMATE.start_main_~i~0#1_39| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_867 Int) (v_subst_1 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_27 .cse0) (< |v_ULTIMATE.start_main_~i~0#1_39| .cse4) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse8 (* |v_ULTIMATE.start_main_~i~0#1_39| 4))) (store (store (store (store .cse2 (+ .cse8 |c_ULTIMATE.start_main_~tids~0#1.offset|) v_ArrVal_863) (+ .cse8 |c_ULTIMATE.start_main_~tids~0#1.offset| 1) v_subst_1) (+ .cse8 |c_ULTIMATE.start_main_~tids~0#1.offset| 2) v_ArrVal_867) (+ .cse8 |c_ULTIMATE.start_main_~tids~0#1.offset| 3) v_subst_1))))) (store .cse7 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_27 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))))))) is different from false [2024-11-13 12:34:36,479 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse2 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse9 |c_threadThread1of2ForFork0_#t~nondet4|)))) (let ((.cse5 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse3 (select .cse2 |c_ULTIMATE.start_main_~tids~0#1.base|))) (and (forall ((v_ArrVal_863 Int) (v_threadThread2of2ForFork0_~t~0.offset_27 Int) (v_ArrVal_861 Int) (|v_ULTIMATE.start_main_~i~0#1_39| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_857 Int) (|v_ULTIMATE.start_main_~i~0#1_40| Int) (v_subst_2 Int) (v_ArrVal_867 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~i~0#1_40| 4))) (or (< v_threadThread2of2ForFork0_~t~0.offset_27 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) (= (select (select (let ((.cse1 (store .cse2 |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse4 (* |v_ULTIMATE.start_main_~i~0#1_39| 4))) (store (store (store (store (store (store (store (store .cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0) v_ArrVal_857) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse0) v_ArrVal_861) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse0) |ULTIMATE.start_main_#t~nondet9#1|) (+ .cse4 |c_ULTIMATE.start_main_~tids~0#1.offset|) v_ArrVal_863) (+ .cse4 |c_ULTIMATE.start_main_~tids~0#1.offset| 1) v_subst_2) (+ .cse4 |c_ULTIMATE.start_main_~tids~0#1.offset| 2) v_ArrVal_867) (+ .cse4 |c_ULTIMATE.start_main_~tids~0#1.offset| 3) v_subst_2))))) (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_27 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|) (< |v_ULTIMATE.start_main_~i~0#1_39| (+ |v_ULTIMATE.start_main_~i~0#1_40| 1)) (< |v_ULTIMATE.start_main_~i~0#1_40| .cse5)))) (forall ((v_ArrVal_863 Int) (v_threadThread2of2ForFork0_~t~0.offset_27 Int) (v_ArrVal_861 Int) (|v_ULTIMATE.start_main_~i~0#1_39| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_857 Int) (|v_ULTIMATE.start_main_~i~0#1_40| Int) (v_ArrVal_867 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_subst_1 Int)) (let ((.cse6 (* |v_ULTIMATE.start_main_~i~0#1_40| 4))) (or (< v_threadThread2of2ForFork0_~t~0.offset_27 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse6)) (< |v_ULTIMATE.start_main_~i~0#1_39| (+ |v_ULTIMATE.start_main_~i~0#1_40| 1)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse8 (* |v_ULTIMATE.start_main_~i~0#1_39| 4))) (store (store (store (store (store (store (store (store .cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse6) v_ArrVal_857) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse6 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse6) v_ArrVal_861) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse6) |ULTIMATE.start_main_#t~nondet9#1|) (+ .cse8 |c_ULTIMATE.start_main_~tids~0#1.offset|) v_ArrVal_863) (+ .cse8 |c_ULTIMATE.start_main_~tids~0#1.offset| 1) v_subst_1) (+ .cse8 |c_ULTIMATE.start_main_~tids~0#1.offset| 2) v_ArrVal_867) (+ .cse8 |c_ULTIMATE.start_main_~tids~0#1.offset| 3) v_subst_1))))) (store .cse7 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_27 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse9)) (< |v_ULTIMATE.start_main_~i~0#1_40| .cse5)))) (forall ((v_ArrVal_863 Int) (v_threadThread2of2ForFork0_~t~0.offset_27 Int) (v_ArrVal_861 Int) (|v_ULTIMATE.start_main_~i~0#1_39| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_857 Int) (v_subst_3 Int) (|v_ULTIMATE.start_main_~i~0#1_40| Int) (v_ArrVal_867 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int)) (let ((.cse10 (* |v_ULTIMATE.start_main_~i~0#1_40| 4))) (or (< v_threadThread2of2ForFork0_~t~0.offset_27 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse10)) (< |v_ULTIMATE.start_main_~i~0#1_39| (+ |v_ULTIMATE.start_main_~i~0#1_40| 1)) (< |v_ULTIMATE.start_main_~i~0#1_40| .cse5) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse11 (store .cse2 |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse12 (* |v_ULTIMATE.start_main_~i~0#1_39| 4))) (store (store (store (store (store (store (store (store .cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse10) v_ArrVal_857) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse10 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse10) v_ArrVal_861) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse10) |ULTIMATE.start_main_#t~nondet9#1|) (+ .cse12 |c_ULTIMATE.start_main_~tids~0#1.offset|) v_ArrVal_863) (+ .cse12 |c_ULTIMATE.start_main_~tids~0#1.offset| 1) v_subst_3) (+ .cse12 |c_ULTIMATE.start_main_~tids~0#1.offset| 2) v_ArrVal_867) (+ .cse12 |c_ULTIMATE.start_main_~tids~0#1.offset| 3) v_subst_3))))) (store .cse11 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_27 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))))))))) is different from false [2024-11-13 12:34:39,641 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse10 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse1 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse10 |c_threadThread1of2ForFork0_#t~nondet4|)))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~tids~0#1.base|)) (.cse6 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((v_ArrVal_863 Int) (v_threadThread2of2ForFork0_~t~0.offset_27 Int) (v_ArrVal_861 Int) (|v_ULTIMATE.start_main_~i~0#1_39| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_857 Int) (|v_ULTIMATE.start_main_~i~0#1_40| Int) (v_subst_2 Int) (v_ArrVal_867 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int)) (let ((.cse3 (* |v_ULTIMATE.start_main_~i~0#1_40| 4))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse4 (* |v_ULTIMATE.start_main_~i~0#1_39| 4))) (store (store (store (store (store (store (store (store .cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3) v_ArrVal_857) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse3) v_ArrVal_861) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse3) |ULTIMATE.start_main_#t~nondet9#1|) (+ .cse4 |c_ULTIMATE.start_main_~tids~0#1.offset|) v_ArrVal_863) (+ .cse4 |c_ULTIMATE.start_main_~tids~0#1.offset| 1) v_subst_2) (+ .cse4 |c_ULTIMATE.start_main_~tids~0#1.offset| 2) v_ArrVal_867) (+ .cse4 |c_ULTIMATE.start_main_~tids~0#1.offset| 3) v_subst_2))))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_27 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse5)) (< v_threadThread2of2ForFork0_~t~0.offset_27 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse3)) (< |v_ULTIMATE.start_main_~i~0#1_39| (+ |v_ULTIMATE.start_main_~i~0#1_40| 1)) (< |v_ULTIMATE.start_main_~i~0#1_40| .cse6)))) (forall ((v_ArrVal_863 Int) (v_threadThread2of2ForFork0_~t~0.offset_27 Int) (v_ArrVal_861 Int) (|v_ULTIMATE.start_main_~i~0#1_39| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_857 Int) (|v_ULTIMATE.start_main_~i~0#1_40| Int) (v_ArrVal_867 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_subst_1 Int)) (let ((.cse7 (* |v_ULTIMATE.start_main_~i~0#1_40| 4))) (or (< v_threadThread2of2ForFork0_~t~0.offset_27 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse7)) (< |v_ULTIMATE.start_main_~i~0#1_39| (+ |v_ULTIMATE.start_main_~i~0#1_40| 1)) (< |v_ULTIMATE.start_main_~i~0#1_40| .cse6) (= (select (select (let ((.cse8 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse9 (* |v_ULTIMATE.start_main_~i~0#1_39| 4))) (store (store (store (store (store (store (store (store .cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse7) v_ArrVal_857) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse7 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse7) v_ArrVal_861) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse7) |ULTIMATE.start_main_#t~nondet9#1|) (+ .cse9 |c_ULTIMATE.start_main_~tids~0#1.offset|) v_ArrVal_863) (+ .cse9 |c_ULTIMATE.start_main_~tids~0#1.offset| 1) v_subst_1) (+ .cse9 |c_ULTIMATE.start_main_~tids~0#1.offset| 2) v_ArrVal_867) (+ .cse9 |c_ULTIMATE.start_main_~tids~0#1.offset| 3) v_subst_1))))) (store .cse8 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_27 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse10) |c_threadThread1of2ForFork0_#t~nondet4|)))) (forall ((v_ArrVal_863 Int) (v_threadThread2of2ForFork0_~t~0.offset_27 Int) (v_ArrVal_861 Int) (|v_ULTIMATE.start_main_~i~0#1_39| Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_857 Int) (v_subst_3 Int) (|v_ULTIMATE.start_main_~i~0#1_40| Int) (v_ArrVal_867 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int)) (let ((.cse11 (* |v_ULTIMATE.start_main_~i~0#1_40| 4))) (or (< v_threadThread2of2ForFork0_~t~0.offset_27 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse11)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse12 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse13 (* |v_ULTIMATE.start_main_~i~0#1_39| 4))) (store (store (store (store (store (store (store (store .cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse11) v_ArrVal_857) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse11 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse11) v_ArrVal_861) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse11) |ULTIMATE.start_main_#t~nondet9#1|) (+ .cse13 |c_ULTIMATE.start_main_~tids~0#1.offset|) v_ArrVal_863) (+ .cse13 |c_ULTIMATE.start_main_~tids~0#1.offset| 1) v_subst_3) (+ .cse13 |c_ULTIMATE.start_main_~tids~0#1.offset| 2) v_ArrVal_867) (+ .cse13 |c_ULTIMATE.start_main_~tids~0#1.offset| 3) v_subst_3))))) (store .cse12 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~ts~0#1.base|) v_threadThread2of2ForFork0_~t~0.offset_27 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< |v_ULTIMATE.start_main_~i~0#1_39| (+ |v_ULTIMATE.start_main_~i~0#1_40| 1)) (< |v_ULTIMATE.start_main_~i~0#1_40| .cse6)))))))) is different from false