./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-ptr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/config/GemCutterReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-ptr.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/config/svcomp-DataRace-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx --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 2804a3d9c88e5ebdd5cd91ad2518af39bf332bf1cb9f17b40166d15deda7338f --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 20:24:17,465 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 20:24:17,530 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2023-12-02 20:24:17,536 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 20:24:17,537 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 20:24:17,571 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 20:24:17,572 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 20:24:17,573 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 20:24:17,573 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 20:24:17,574 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 20:24:17,575 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 20:24:17,576 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 20:24:17,576 INFO L153 SettingsManager]: * Use SBE=true [2023-12-02 20:24:17,577 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 20:24:17,577 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 20:24:17,578 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 20:24:17,578 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 20:24:17,579 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 20:24:17,580 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 20:24:17,580 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 20:24:17,581 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 20:24:17,581 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 20:24:17,582 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-12-02 20:24:17,582 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 20:24:17,583 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 20:24:17,583 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 20:24:17,584 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 20:24:17,584 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 20:24:17,585 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 20:24:17,585 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-02 20:24:17,586 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 20:24:17,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 20:24:17,586 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 20:24:17,587 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 20:24:17,597 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 20:24:17,597 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-02 20:24:17,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 20:24:17,598 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 20:24:17,598 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2023-12-02 20:24:17,598 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-12-02 20:24:17,598 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 20:24:17,599 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-12-02 20:24:17,599 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-12-02 20:24:17,599 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx 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 -> 2804a3d9c88e5ebdd5cd91ad2518af39bf332bf1cb9f17b40166d15deda7338f [2023-12-02 20:24:17,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 20:24:17,848 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 20:24:17,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 20:24:17,852 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 20:24:17,853 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 20:24:17,854 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-ptr.i [2023-12-02 20:24:20,701 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 20:24:20,932 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 20:24:20,932 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/sv-benchmarks/c/pthread-race-challenges/per-thread-array-ptr.i [2023-12-02 20:24:20,951 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/data/d8858d9e3/34e57111a3664a3bbd03d065f762d66e/FLAG7b75409cb [2023-12-02 20:24:20,963 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/data/d8858d9e3/34e57111a3664a3bbd03d065f762d66e [2023-12-02 20:24:20,966 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 20:24:20,967 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 20:24:20,968 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 20:24:20,968 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 20:24:20,973 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 20:24:20,974 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:24:20" (1/1) ... [2023-12-02 20:24:20,975 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@249065fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:24:20, skipping insertion in model container [2023-12-02 20:24:20,975 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:24:20" (1/1) ... [2023-12-02 20:24:21,045 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 20:24:21,496 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 20:24:21,506 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 20:24:21,558 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 20:24:21,626 INFO L206 MainTranslator]: Completed translation [2023-12-02 20:24:21,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:24:21 WrapperNode [2023-12-02 20:24:21,627 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 20:24:21,628 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 20:24:21,628 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 20:24:21,629 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 20:24:21,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:24:21" (1/1) ... [2023-12-02 20:24:21,657 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:24:21" (1/1) ... [2023-12-02 20:24:21,688 INFO L138 Inliner]: procedures = 265, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2023-12-02 20:24:21,688 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 20:24:21,689 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 20:24:21,689 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 20:24:21,690 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 20:24:21,700 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:24:21" (1/1) ... [2023-12-02 20:24:21,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:24:21" (1/1) ... [2023-12-02 20:24:21,706 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:24:21" (1/1) ... [2023-12-02 20:24:21,706 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:24:21" (1/1) ... [2023-12-02 20:24:21,719 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:24:21" (1/1) ... [2023-12-02 20:24:21,723 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:24:21" (1/1) ... [2023-12-02 20:24:21,725 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:24:21" (1/1) ... [2023-12-02 20:24:21,727 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:24:21" (1/1) ... [2023-12-02 20:24:21,731 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 20:24:21,732 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 20:24:21,732 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 20:24:21,733 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 20:24:21,734 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:24:21" (1/1) ... [2023-12-02 20:24:21,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 20:24:21,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:24:21,768 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 20:24:21,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 20:24:21,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 20:24:21,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 20:24:21,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 20:24:21,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-12-02 20:24:21,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 20:24:21,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 20:24:21,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 20:24:21,804 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-12-02 20:24:21,804 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-12-02 20:24:21,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 20:24:21,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 20:24:21,806 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-02 20:24:21,927 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 20:24:21,929 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 20:24:22,228 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 20:24:22,238 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 20:24:22,238 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-02 20:24:22,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:24:22 BoogieIcfgContainer [2023-12-02 20:24:22,240 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 20:24:22,243 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 20:24:22,243 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 20:24:22,247 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 20:24:22,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:24:20" (1/3) ... [2023-12-02 20:24:22,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b1566d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:24:22, skipping insertion in model container [2023-12-02 20:24:22,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:24:21" (2/3) ... [2023-12-02 20:24:22,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b1566d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:24:22, skipping insertion in model container [2023-12-02 20:24:22,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:24:22" (3/3) ... [2023-12-02 20:24:22,250 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-ptr.i [2023-12-02 20:24:22,259 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-12-02 20:24:22,268 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 20:24:22,269 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-12-02 20:24:22,269 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 20:24:22,330 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-12-02 20:24:22,378 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:24:22,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-12-02 20:24:22,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:24:22,380 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-12-02 20:24:22,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-12-02 20:24:22,424 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-12-02 20:24:22,439 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of1ForFork0 ======== [2023-12-02 20:24:22,447 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1d991185, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:24:22,447 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 20:24:22,716 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-12-02 20:24:22,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:24:22,723 INFO L85 PathProgramCache]: Analyzing trace with hash -118187754, now seen corresponding path program 1 times [2023-12-02 20:24:22,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:24:22,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137042552] [2023-12-02 20:24:22,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:24:22,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:24:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:24:22,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:24:22,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:24:22,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137042552] [2023-12-02 20:24:22,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137042552] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:24:22,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:24:22,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:24:22,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250359766] [2023-12-02 20:24:22,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:24:22,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-02 20:24:22,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:24:23,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-02 20:24:23,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 20:24:23,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:24:23,018 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:24:23,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:24:23,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:24:23,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:24:23,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 20:24:23,043 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-12-02 20:24:23,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:24:23,044 INFO L85 PathProgramCache]: Analyzing trace with hash 108159104, now seen corresponding path program 1 times [2023-12-02 20:24:23,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:24:23,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711935263] [2023-12-02 20:24:23,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:24:23,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:24:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:24:23,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:24:23,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:24:23,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711935263] [2023-12-02 20:24:23,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711935263] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:24:23,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:24:23,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 20:24:23,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093812741] [2023-12-02 20:24:23,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:24:23,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 20:24:23,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:24:23,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 20:24:23,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-02 20:24:23,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:24:23,771 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:24:23,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:24:23,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:24:23,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:24:23,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:24:23,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:24:23,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 20:24:23,965 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-12-02 20:24:23,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:24:23,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1728096500, now seen corresponding path program 1 times [2023-12-02 20:24:23,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:24:23,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191089886] [2023-12-02 20:24:23,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:24:23,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:24:24,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:24:24,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:24:24,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:24:24,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191089886] [2023-12-02 20:24:24,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191089886] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:24:24,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327266256] [2023-12-02 20:24:24,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:24:24,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:24:24,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:24:24,833 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:24:24,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 20:24:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:24:24,991 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-02 20:24:25,000 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:24:25,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 20:24:25,055 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:24:25,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 20:24:25,075 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 16 treesize of output 8 [2023-12-02 20:24:25,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:24:25,159 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 [2023-12-02 20:24:25,179 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:24:25,180 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 [2023-12-02 20:24:25,209 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:24:25,209 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 [2023-12-02 20:24:25,387 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 [2023-12-02 20:24:25,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:24:25,400 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:24:25,437 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_189 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_189) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_189 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_189) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset))) (forall ((v_ArrVal_189 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_189) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_189 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_189) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-12-02 20:24:25,599 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_189 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_189) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_189 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_189) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_189 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_189) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_189 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_189) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-12-02 20:24:25,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-02 20:24:25,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-12-02 20:24:25,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327266256] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:24:25,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:24:25,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 16 [2023-12-02 20:24:25,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193709381] [2023-12-02 20:24:25,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:24:25,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-02 20:24:25,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:24:25,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-02 20:24:25,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=173, Unknown=2, NotChecked=54, Total=272 [2023-12-02 20:24:25,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:24:25,760 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:24:25,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.6875) internal successors, (75), 17 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:24:25,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:24:25,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:24:25,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:24:26,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:24:26,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:24:26,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-02 20:24:26,716 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-02 20:24:26,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-12-02 20:24:26,905 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-12-02 20:24:26,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:24:26,905 INFO L85 PathProgramCache]: Analyzing trace with hash 490517125, now seen corresponding path program 2 times [2023-12-02 20:24:26,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:24:26,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174328723] [2023-12-02 20:24:26,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:24:26,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:24:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:24:27,991 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:24:27,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:24:27,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174328723] [2023-12-02 20:24:27,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174328723] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:24:27,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384301870] [2023-12-02 20:24:27,992 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:24:27,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:24:27,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:24:27,993 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:24:27,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 20:24:28,126 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:24:28,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:24:28,128 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-02 20:24:28,134 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:24:28,241 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 14 [2023-12-02 20:24:28,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:24:28,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-12-02 20:24:28,535 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:24:28,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2023-12-02 20:24:28,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:24:28,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2023-12-02 20:24:28,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:24:28,838 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 [2023-12-02 20:24:28,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:24:28,860 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 [2023-12-02 20:24:28,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:24:28,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 43 treesize of output 32 [2023-12-02 20:24:28,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:24:28,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-12-02 20:24:29,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:24:29,022 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 [2023-12-02 20:24:29,033 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:24:29,033 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:24:29,213 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_309) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_309) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_309) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_309) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-12-02 20:24:29,392 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_309) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_309) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_309) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_309) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-12-02 20:24:29,413 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_309) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_309) c_threadThread1of1ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_309) c_threadThread1of1ForFork0_~p~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_309) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-12-02 20:24:29,590 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 14 [2023-12-02 20:24:29,665 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 5 times theorem prover too weak. 0 trivial. 6 not checked. [2023-12-02 20:24:29,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384301870] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:24:29,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:24:29,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 33 [2023-12-02 20:24:29,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595005060] [2023-12-02 20:24:29,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:24:29,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-02 20:24:29,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:24:29,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-02 20:24:29,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=808, Unknown=10, NotChecked=180, Total=1122 [2023-12-02 20:24:29,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:24:29,671 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:24:29,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 4.424242424242424) internal successors, (146), 34 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:24:29,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:24:29,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:24:29,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-12-02 20:24:29,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:24:31,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:24:31,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:24:31,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-02 20:24:31,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-02 20:24:31,246 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 20:24:31,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:24:31,442 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-12-02 20:24:31,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:24:31,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1939312127, now seen corresponding path program 1 times [2023-12-02 20:24:31,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:24:31,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530679156] [2023-12-02 20:24:31,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:24:31,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:24:31,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:24:32,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:24:32,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:24:32,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530679156] [2023-12-02 20:24:32,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530679156] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:24:32,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79869711] [2023-12-02 20:24:32,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:24:32,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:24:32,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:24:32,814 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:24:32,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 20:24:32,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:24:32,943 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 53 conjunts are in the unsatisfiable core [2023-12-02 20:24:32,955 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:24:32,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 20:24:32,990 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 20:24:32,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-02 20:24:33,114 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2023-12-02 20:24:33,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2023-12-02 20:24:33,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:24:33,196 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-02 20:24:33,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2023-12-02 20:24:33,857 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-12-02 20:24:33,857 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 2 case distinctions, treesize of input 61 treesize of output 57 [2023-12-02 20:24:34,217 INFO L349 Elim1Store]: treesize reduction 28, result has 34.9 percent of original size [2023-12-02 20:24:34,218 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 2 case distinctions, treesize of input 53 treesize of output 47 [2023-12-02 20:24:34,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2023-12-02 20:24:34,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:24:34,376 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 [2023-12-02 20:24:34,453 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:24:34,454 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 [2023-12-02 20:24:34,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:24:34,523 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 [2023-12-02 20:24:34,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-02 20:24:34,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:24:34,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-12-02 20:24:34,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:24:34,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-12-02 20:24:34,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:24:34,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-12-02 20:24:35,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:24:35,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-12-02 20:24:35,064 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 [2023-12-02 20:24:35,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:24:35,075 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:24:35,096 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_434 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_434) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_434 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_434) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_434 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_434) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_434 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_434) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-12-02 20:24:35,130 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_433) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_434) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_433) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_434) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_433) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_434) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_433) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_434) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-12-02 20:24:35,186 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_433) .cse0 v_ArrVal_434) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_433) .cse0 v_ArrVal_434) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_433) .cse0 v_ArrVal_434) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_433) .cse0 v_ArrVal_434) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)))))) is different from false [2023-12-02 20:24:35,357 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_433) .cse1 v_ArrVal_434) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)))) (forall ((v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_433) .cse1 v_ArrVal_434) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_433) .cse1 v_ArrVal_434) c_threadThread1of1ForFork0_~p~0.base) .cse2))) (forall ((v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_433) .cse1 v_ArrVal_434) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-12-02 20:24:35,381 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_433) .cse1 v_ArrVal_434) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_433) .cse1 v_ArrVal_434) c_threadThread1of1ForFork0_~p~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_433) .cse1 v_ArrVal_434) c_threadThread1of1ForFork0_~p~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_433) .cse1 v_ArrVal_434) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1))))))) is different from false [2023-12-02 20:24:36,323 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:24:36,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 105 [2023-12-02 20:24:36,332 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 67 treesize of output 65 [2023-12-02 20:24:36,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-02 20:24:36,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79869711] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:24:36,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:24:36,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 49 [2023-12-02 20:24:36,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768333049] [2023-12-02 20:24:36,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:24:36,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-12-02 20:24:36,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:24:36,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-12-02 20:24:36,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1807, Unknown=8, NotChecked=450, Total=2450 [2023-12-02 20:24:36,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:24:36,687 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:24:36,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 3.4489795918367347) internal successors, (169), 50 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:24:36,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:24:36,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:24:36,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-12-02 20:24:36,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-12-02 20:24:36,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:24:40,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:24:40,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:24:40,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-02 20:24:40,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-02 20:24:40,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-02 20:24:40,849 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 20:24:41,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:24:41,045 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-12-02 20:24:41,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:24:41,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1804082767, now seen corresponding path program 2 times [2023-12-02 20:24:41,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:24:41,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223780711] [2023-12-02 20:24:41,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:24:41,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:24:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:24:42,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:24:42,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:24:42,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223780711] [2023-12-02 20:24:42,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223780711] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:24:42,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134504168] [2023-12-02 20:24:42,049 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:24:42,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:24:42,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:24:42,050 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:24:42,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 20:24:42,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:24:42,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:24:42,176 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 76 conjunts are in the unsatisfiable core [2023-12-02 20:24:42,183 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:24:42,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 20:24:42,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:24:42,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 17 treesize of output 17 [2023-12-02 20:24:42,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:24:42,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:24:42,533 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 20:24:42,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2023-12-02 20:24:42,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:24:42,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:24:42,633 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-02 20:24:42,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 22 [2023-12-02 20:24:42,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 20:24:43,547 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-12-02 20:24:43,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 66 [2023-12-02 20:24:44,009 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-12-02 20:24:44,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 52 [2023-12-02 20:24:44,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:24:44,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-12-02 20:24:44,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:24:44,355 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 1 case distinctions, treesize of input 26 treesize of output 28 [2023-12-02 20:24:45,173 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-12-02 20:24:45,174 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 63 treesize of output 40 [2023-12-02 20:24:45,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:24:45,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-12-02 20:24:45,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-12-02 20:24:45,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:24:45,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-12-02 20:24:45,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:24:45,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-12-02 20:24:45,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:24:45,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-12-02 20:24:45,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-12-02 20:24:45,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:24:45,676 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:24:45,869 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_558) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_559) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_558) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_559) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_558) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_559) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_558) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_559) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-12-02 20:24:45,914 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_558) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_559) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_558) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_559) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_558) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_559) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_558) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_559) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-12-02 20:24:45,936 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_553 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_553) c_threadThread1of1ForFork0_~p~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_558) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_559) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset))) (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_553 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_553) c_threadThread1of1ForFork0_~p~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_558) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_559) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_553 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_553) c_threadThread1of1ForFork0_~p~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_558) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_559) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_553 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_553) c_threadThread1of1ForFork0_~p~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_558) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_559) c_threadThread1of1ForFork0_~p~0.base) .cse0) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false [2023-12-02 20:24:45,958 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_553 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_553) c_threadThread1of1ForFork0_~p~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_558) .cse1 v_ArrVal_559) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_553 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_553) c_threadThread1of1ForFork0_~p~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_558) .cse1 v_ArrVal_559) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_553 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_553) c_threadThread1of1ForFork0_~p~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_558) .cse1 v_ArrVal_559) c_threadThread1of1ForFork0_~p~0.base) .cse0) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_553 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_553) c_threadThread1of1ForFork0_~p~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_558) .cse1 v_ArrVal_559) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false [2023-12-02 20:24:46,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:24:46,853 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 3 case distinctions, treesize of input 97 treesize of output 107 [2023-12-02 20:24:46,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:24:46,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 95 [2023-12-02 20:24:46,869 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 36 treesize of output 32 [2023-12-02 20:24:46,875 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 54 treesize of output 46 [2023-12-02 20:24:46,894 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:24:46,895 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:24:46,897 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:24:46,898 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:24:46,903 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-12-02 20:24:46,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 1 [2023-12-02 20:24:46,906 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:24:46,907 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:24:46,912 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-12-02 20:24:46,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 1 [2023-12-02 20:24:47,547 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 8 treesize of output 4 [2023-12-02 20:24:48,069 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:24:48,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 103 [2023-12-02 20:24:48,075 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 65 treesize of output 63 [2023-12-02 20:24:48,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:24:48,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134504168] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:24:48,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:24:48,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25, 23] total 65 [2023-12-02 20:24:48,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890498111] [2023-12-02 20:24:48,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:24:48,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2023-12-02 20:24:48,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:24:48,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2023-12-02 20:24:48,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=3474, Unknown=26, NotChecked=492, Total=4290 [2023-12-02 20:24:48,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:24:48,482 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:24:48,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 2.876923076923077) internal successors, (187), 66 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:24:48,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:24:48,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:24:48,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-12-02 20:24:48,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2023-12-02 20:24:48,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-12-02 20:24:48,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:24:57,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:24:57,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:24:57,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-02 20:24:57,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-02 20:24:57,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-02 20:24:57,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-12-02 20:24:57,280 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 20:24:57,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:24:57,475 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-12-02 20:24:57,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:24:57,475 INFO L85 PathProgramCache]: Analyzing trace with hash -2115809315, now seen corresponding path program 3 times [2023-12-02 20:24:57,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:24:57,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064482381] [2023-12-02 20:24:57,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:24:57,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:24:57,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:24:58,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:24:58,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:24:58,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064482381] [2023-12-02 20:24:58,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064482381] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:24:58,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919726634] [2023-12-02 20:24:58,453 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 20:24:58,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:24:58,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:24:58,454 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:24:58,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 20:24:58,570 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 20:24:58,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:24:58,572 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 88 conjunts are in the unsatisfiable core [2023-12-02 20:24:58,578 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:24:58,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 20:24:58,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:24:58,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 17 treesize of output 17 [2023-12-02 20:24:58,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:24:58,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:24:58,856 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 20:24:58,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 33 [2023-12-02 20:24:58,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:24:58,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:24:58,937 INFO L349 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2023-12-02 20:24:58,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 29 [2023-12-02 20:24:59,981 INFO L349 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2023-12-02 20:24:59,982 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 2 case distinctions, treesize of input 69 treesize of output 55 [2023-12-02 20:24:59,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:24:59,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:24:59,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2023-12-02 20:25:00,504 INFO L349 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2023-12-02 20:25:00,504 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 2 case distinctions, treesize of input 62 treesize of output 50 [2023-12-02 20:25:00,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:25:00,512 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 23 treesize of output 21 [2023-12-02 20:25:00,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:25:00,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-12-02 20:25:01,563 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 0 case distinctions, treesize of input 61 treesize of output 29 [2023-12-02 20:25:01,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2023-12-02 20:25:01,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-12-02 20:25:01,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-12-02 20:25:01,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-12-02 20:25:01,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-12-02 20:25:01,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-12-02 20:25:01,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-12-02 20:25:01,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2023-12-02 20:25:02,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:25:02,052 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:25:02,222 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem14#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_687 Int) (v_ArrVal_685 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_685))) (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_687))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_687 Int) (v_ArrVal_685 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_685))) (store .cse2 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_687))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_687 Int) (v_ArrVal_685 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_685))) (store .cse3 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_687))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_687 Int) (v_ArrVal_685 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_685))) (store .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_687))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)))))) is different from false [2023-12-02 20:25:02,736 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem14#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse6 |c_threadThread1of1ForFork0_#t~nondet4|) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_687 Int) (v_ArrVal_685 (Array Int Int))) (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_685))) (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_687))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_687 Int) (v_ArrVal_685 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse3 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_685))) (store .cse3 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_687))) c_threadThread1of1ForFork0_~p~0.base) .cse4))) (forall ((v_ArrVal_687 Int) (v_ArrVal_685 (Array Int Int))) (= (select (select (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_685))) (store .cse5 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_687))) c_threadThread1of1ForFork0_~p~0.base) .cse6) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_687 Int) (v_ArrVal_685 (Array Int Int))) (= (select (select (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_685))) (store .cse7 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse7 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_687))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-12-02 20:25:02,770 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem14#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((v_ArrVal_687 Int) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_685 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_679) c_threadThread1of1ForFork0_~p~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_685))) (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_687))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_687 Int) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_685 (Array Int Int))) (= (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_679) c_threadThread1of1ForFork0_~p~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_685))) (store .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_687))) c_threadThread1of1ForFork0_~p~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_687 Int) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_685 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_679) c_threadThread1of1ForFork0_~p~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_685))) (store .cse5 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_687))) c_threadThread1of1ForFork0_~p~0.base) .cse2))) (forall ((v_ArrVal_687 Int) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_685 (Array Int Int))) (= (select (select (let ((.cse6 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_679) c_threadThread1of1ForFork0_~p~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_685))) (store .cse6 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_687))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false [2023-12-02 20:25:02,807 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (and (forall ((v_ArrVal_687 Int) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_685 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_679) c_threadThread1of1ForFork0_~p~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_685))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_687))) c_threadThread1of1ForFork0_~p~0.base) .cse4) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_687 Int) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_685 (Array Int Int))) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_679) c_threadThread1of1ForFork0_~p~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_685))) (store .cse5 .cse1 (store (select .cse5 .cse1) .cse2 v_ArrVal_687))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_687 Int) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_685 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_679) c_threadThread1of1ForFork0_~p~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_685))) (store .cse6 .cse1 (store (select .cse6 .cse1) .cse2 v_ArrVal_687))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset))) (forall ((v_ArrVal_687 Int) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_685 (Array Int Int))) (= (select (select (let ((.cse7 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_679) c_threadThread1of1ForFork0_~p~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_685))) (store .cse7 .cse1 (store (select .cse7 .cse1) .cse2 v_ArrVal_687))) c_threadThread1of1ForFork0_~p~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false [2023-12-02 20:25:04,149 INFO L349 Elim1Store]: treesize reduction 26, result has 63.9 percent of original size [2023-12-02 20:25:04,149 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 514 treesize of output 469 [2023-12-02 20:25:04,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:25:04,172 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 449 treesize of output 401 [2023-12-02 20:25:04,185 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 266 treesize of output 258 [2023-12-02 20:25:04,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 178 treesize of output 176 [2023-12-02 20:25:04,392 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:25:04,416 INFO L349 Elim1Store]: treesize reduction 53, result has 26.4 percent of original size [2023-12-02 20:25:04,416 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 316 treesize of output 263 [2023-12-02 20:25:04,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 113 [2023-12-02 20:25:04,434 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:25:04,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 127 [2023-12-02 20:25:04,469 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:25:04,496 INFO L349 Elim1Store]: treesize reduction 49, result has 31.9 percent of original size [2023-12-02 20:25:04,497 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 212 treesize of output 215 [2023-12-02 20:25:04,538 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:25:04,541 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 136 treesize of output 92 [2023-12-02 20:25:04,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:25:04,566 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:25:04,595 INFO L349 Elim1Store]: treesize reduction 49, result has 31.9 percent of original size [2023-12-02 20:25:04,595 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 212 treesize of output 215 [2023-12-02 20:25:04,604 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:25:04,607 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 136 treesize of output 92 [2023-12-02 20:25:04,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:25:10,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:25:10,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 383 treesize of output 456 [2023-12-02 20:25:10,962 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 286 treesize of output 284 [2023-12-02 20:25:10,982 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 284 treesize of output 282 [2023-12-02 20:25:11,179 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:25:11,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 343 treesize of output 468 [2023-12-02 20:25:11,233 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 298 treesize of output 296 [2023-12-02 20:25:11,263 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 296 treesize of output 294 [2023-12-02 20:25:11,305 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 294 treesize of output 292 [2023-12-02 20:25:11,347 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 292 treesize of output 290 [2023-12-02 20:25:11,377 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 290 treesize of output 288 [2023-12-02 20:25:11,409 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 288 treesize of output 286 [2023-12-02 20:28:38,303 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2023-12-02 20:28:38,303 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-12-02 20:28:38,304 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-12-02 20:28:38,309 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 20:28:38,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:28:38,505 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:268) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:410) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:394) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:500) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 69 more [2023-12-02 20:28:38,509 INFO L158 Benchmark]: Toolchain (without parser) took 257541.81ms. Allocated memory was 136.3MB in the beginning and 553.6MB in the end (delta: 417.3MB). Free memory was 88.1MB in the beginning and 413.2MB in the end (delta: -325.0MB). Peak memory consumption was 340.7MB. Max. memory is 16.1GB. [2023-12-02 20:28:38,509 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 136.3MB. Free memory is still 102.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 20:28:38,509 INFO L158 Benchmark]: CACSL2BoogieTranslator took 659.38ms. Allocated memory is still 136.3MB. Free memory was 88.1MB in the beginning and 60.0MB in the end (delta: 28.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-12-02 20:28:38,509 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.23ms. Allocated memory is still 136.3MB. Free memory was 60.0MB in the beginning and 57.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 20:28:38,510 INFO L158 Benchmark]: Boogie Preprocessor took 42.28ms. Allocated memory is still 136.3MB. Free memory was 57.4MB in the beginning and 55.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 20:28:38,510 INFO L158 Benchmark]: RCFGBuilder took 508.01ms. Allocated memory was 136.3MB in the beginning and 182.5MB in the end (delta: 46.1MB). Free memory was 55.3MB in the beginning and 144.1MB in the end (delta: -88.8MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. [2023-12-02 20:28:38,510 INFO L158 Benchmark]: TraceAbstraction took 256265.28ms. Allocated memory was 182.5MB in the beginning and 553.6MB in the end (delta: 371.2MB). Free memory was 144.1MB in the beginning and 413.2MB in the end (delta: -269.1MB). Peak memory consumption was 349.0MB. Max. memory is 16.1GB. [2023-12-02 20:28:38,512 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 136.3MB. Free memory is still 102.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 659.38ms. Allocated memory is still 136.3MB. Free memory was 88.1MB in the beginning and 60.0MB in the end (delta: 28.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.23ms. Allocated memory is still 136.3MB. Free memory was 60.0MB in the beginning and 57.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.28ms. Allocated memory is still 136.3MB. Free memory was 57.4MB in the beginning and 55.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 508.01ms. Allocated memory was 136.3MB in the beginning and 182.5MB in the end (delta: 46.1MB). Free memory was 55.3MB in the beginning and 144.1MB in the end (delta: -88.8MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. * TraceAbstraction took 256265.28ms. Allocated memory was 182.5MB in the beginning and 553.6MB in the end (delta: 371.2MB). Free memory was 144.1MB in the beginning and 413.2MB in the end (delta: -269.1MB). Peak memory consumption was 349.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-12-02 20:28:38,523 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/config/GemCutterReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-ptr.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/config/svcomp-DataRace-32bit-GemCutter_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx --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 2804a3d9c88e5ebdd5cd91ad2518af39bf332bf1cb9f17b40166d15deda7338f --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 20:28:40,434 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 20:28:40,512 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/config/svcomp-DataRace-32bit-GemCutter_Bitvector.epf [2023-12-02 20:28:40,518 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 20:28:40,519 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 20:28:40,547 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 20:28:40,547 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 20:28:40,548 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 20:28:40,549 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 20:28:40,549 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 20:28:40,550 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 20:28:40,551 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 20:28:40,551 INFO L153 SettingsManager]: * Use SBE=true [2023-12-02 20:28:40,552 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 20:28:40,552 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 20:28:40,553 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 20:28:40,553 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 20:28:40,554 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 20:28:40,555 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 20:28:40,555 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 20:28:40,556 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 20:28:40,556 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-12-02 20:28:40,557 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 20:28:40,557 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 20:28:40,558 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 20:28:40,558 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 20:28:40,559 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 20:28:40,559 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 20:28:40,560 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 20:28:40,560 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 20:28:40,561 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 20:28:40,561 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 20:28:40,561 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 20:28:40,562 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 20:28:40,562 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 20:28:40,562 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-02 20:28:40,562 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 20:28:40,563 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 20:28:40,563 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2023-12-02 20:28:40,563 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-12-02 20:28:40,563 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 20:28:40,564 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-12-02 20:28:40,564 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-12-02 20:28:40,564 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 20:28:40,565 INFO L153 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx 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 -> 2804a3d9c88e5ebdd5cd91ad2518af39bf332bf1cb9f17b40166d15deda7338f [2023-12-02 20:28:40,840 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 20:28:40,859 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 20:28:40,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 20:28:40,863 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 20:28:40,863 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 20:28:40,864 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-ptr.i [2023-12-02 20:28:43,691 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 20:28:43,925 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 20:28:43,925 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/sv-benchmarks/c/pthread-race-challenges/per-thread-array-ptr.i [2023-12-02 20:28:43,944 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/data/bfd78e5ac/d657b20e95874af6bcbfa8f5a808b58e/FLAGe5b258f84 [2023-12-02 20:28:43,959 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/data/bfd78e5ac/d657b20e95874af6bcbfa8f5a808b58e [2023-12-02 20:28:43,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 20:28:43,964 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 20:28:43,965 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 20:28:43,965 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 20:28:43,971 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 20:28:43,972 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:28:43" (1/1) ... [2023-12-02 20:28:43,973 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@431d250f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:28:43, skipping insertion in model container [2023-12-02 20:28:43,973 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:28:43" (1/1) ... [2023-12-02 20:28:44,043 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 20:28:44,596 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 20:28:44,609 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 20:28:44,658 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 20:28:44,732 INFO L206 MainTranslator]: Completed translation [2023-12-02 20:28:44,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:28:44 WrapperNode [2023-12-02 20:28:44,732 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 20:28:44,733 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 20:28:44,734 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 20:28:44,734 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 20:28:44,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:28:44" (1/1) ... [2023-12-02 20:28:44,764 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:28:44" (1/1) ... [2023-12-02 20:28:44,793 INFO L138 Inliner]: procedures = 266, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2023-12-02 20:28:44,794 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 20:28:44,795 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 20:28:44,795 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 20:28:44,795 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 20:28:44,806 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:28:44" (1/1) ... [2023-12-02 20:28:44,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:28:44" (1/1) ... [2023-12-02 20:28:44,814 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:28:44" (1/1) ... [2023-12-02 20:28:44,815 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:28:44" (1/1) ... [2023-12-02 20:28:44,831 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:28:44" (1/1) ... [2023-12-02 20:28:44,835 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:28:44" (1/1) ... [2023-12-02 20:28:44,839 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:28:44" (1/1) ... [2023-12-02 20:28:44,842 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:28:44" (1/1) ... [2023-12-02 20:28:44,847 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 20:28:44,848 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 20:28:44,849 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 20:28:44,849 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 20:28:44,850 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:28:44" (1/1) ... [2023-12-02 20:28:44,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 20:28:44,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:28:44,885 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 20:28:44,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 20:28:44,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-12-02 20:28:44,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 20:28:44,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 20:28:44,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 20:28:44,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-12-02 20:28:44,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-12-02 20:28:44,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 20:28:44,924 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-12-02 20:28:44,924 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-12-02 20:28:44,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 20:28:44,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 20:28:44,927 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-02 20:28:45,099 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 20:28:45,101 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 20:28:45,442 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 20:28:45,453 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 20:28:45,453 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-02 20:28:45,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:28:45 BoogieIcfgContainer [2023-12-02 20:28:45,455 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 20:28:45,458 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 20:28:45,458 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 20:28:45,462 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 20:28:45,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:28:43" (1/3) ... [2023-12-02 20:28:45,463 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@753a35c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:28:45, skipping insertion in model container [2023-12-02 20:28:45,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:28:44" (2/3) ... [2023-12-02 20:28:45,463 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@753a35c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:28:45, skipping insertion in model container [2023-12-02 20:28:45,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:28:45" (3/3) ... [2023-12-02 20:28:45,465 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-ptr.i [2023-12-02 20:28:45,474 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-12-02 20:28:45,484 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 20:28:45,484 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-12-02 20:28:45,484 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 20:28:45,558 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-12-02 20:28:45,600 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:28:45,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-12-02 20:28:45,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:28:45,602 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-12-02 20:28:45,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-12-02 20:28:45,643 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-12-02 20:28:45,652 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of1ForFork0 ======== [2023-12-02 20:28:45,657 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@74dc1dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:28:45,658 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 20:28:45,937 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-12-02 20:28:45,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:28:45,943 INFO L85 PathProgramCache]: Analyzing trace with hash 2053799419, now seen corresponding path program 1 times [2023-12-02 20:28:45,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-02 20:28:45,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1952399101] [2023-12-02 20:28:45,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:28:45,957 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:28:45,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/mathsat [2023-12-02 20:28:45,977 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 20:28:45,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-02 20:28:46,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:28:46,115 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-02 20:28:46,119 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:28:46,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:28:46,133 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 20:28:46,134 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-02 20:28:46,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1952399101] [2023-12-02 20:28:46,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1952399101] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:28:46,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:28:46,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:28:46,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046902432] [2023-12-02 20:28:46,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:28:46,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-02 20:28:46,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-02 20:28:46,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-02 20:28:46,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 20:28:46,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:28:46,192 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:28:46,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:28:46,193 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:28:46,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:28:46,238 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-02 20:28:46,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:28:46,437 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-12-02 20:28:46,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:28:46,438 INFO L85 PathProgramCache]: Analyzing trace with hash -45782364, now seen corresponding path program 1 times [2023-12-02 20:28:46,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-02 20:28:46,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2064125427] [2023-12-02 20:28:46,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:28:46,439 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:28:46,439 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/mathsat [2023-12-02 20:28:46,440 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 20:28:46,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-02 20:28:46,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:28:46,577 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-02 20:28:46,581 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:28:46,615 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 9 [2023-12-02 20:28:46,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2023-12-02 20:28:46,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:28:46,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 42 [2023-12-02 20:28:46,741 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:28:46,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 58 [2023-12-02 20:28:46,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:28:46,797 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 20:28:46,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-02 20:28:46,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2064125427] [2023-12-02 20:28:46,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2064125427] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:28:46,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:28:46,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 20:28:46,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318432470] [2023-12-02 20:28:46,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:28:46,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 20:28:46,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-02 20:28:46,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 20:28:46,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-02 20:28:46,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:28:46,802 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:28:46,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:28:46,803 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:28:46,803 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:28:47,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:28:47,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:28:47,163 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-02 20:28:47,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:28:47,359 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-12-02 20:28:47,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:28:47,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1377495761, now seen corresponding path program 1 times [2023-12-02 20:28:47,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-02 20:28:47,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1696405691] [2023-12-02 20:28:47,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:28:47,361 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:28:47,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/mathsat [2023-12-02 20:28:47,363 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 20:28:47,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-02 20:28:47,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:28:47,545 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-02 20:28:47,551 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:28:47,560 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 7 [2023-12-02 20:28:47,580 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 20:28:47,581 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 13 treesize of output 13 [2023-12-02 20:28:47,618 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 16 treesize of output 8 [2023-12-02 20:28:47,729 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 9 [2023-12-02 20:28:47,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2023-12-02 20:28:47,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:28:47,834 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 34 treesize of output 42 [2023-12-02 20:28:47,921 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:28:47,922 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 45 treesize of output 58 [2023-12-02 20:28:48,326 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 51 treesize of output 40 [2023-12-02 20:28:48,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:28:48,410 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:28:48,483 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_150 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_150) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv2 32) c_threadThread1of1ForFork0_~p~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|) (_ bv0 1))) (forall ((v_ArrVal_150 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_150) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)))) (forall ((v_ArrVal_150 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_150) c_threadThread1of1ForFork0_~p~0.base) (bvadd c_threadThread1of1ForFork0_~p~0.offset (_ bv1 32)))))) (forall ((v_ArrVal_150 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_150) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv3 32) c_threadThread1of1ForFork0_~p~0.offset)))))) is different from false [2023-12-02 20:28:48,695 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv3 32) c_threadThread1of1ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_150 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_150) c_threadThread1of1ForFork0_~p~0.base) .cse1)) (_ bv0 1))) (forall ((v_ArrVal_150 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_150) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)))) (forall ((v_ArrVal_150 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_150) c_threadThread1of1ForFork0_~p~0.base) (bvadd c_threadThread1of1ForFork0_~p~0.offset (_ bv1 32)))))) (forall ((v_ArrVal_150 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_150) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv2 32) c_threadThread1of1ForFork0_~p~0.offset)))))))) is different from false [2023-12-02 20:28:48,730 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv2 32) c_threadThread1of1ForFork0_~p~0.offset)) (.cse1 (bvadd (_ bv3 32) c_threadThread1of1ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_150 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_150) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)))) (forall ((v_ArrVal_150 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_150) c_threadThread1of1ForFork0_~p~0.base) .cse1)) (_ bv0 1))) (forall ((v_ArrVal_150 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_150) c_threadThread1of1ForFork0_~p~0.base) (bvadd c_threadThread1of1ForFork0_~p~0.offset (_ bv1 32)))) (_ bv0 1))) (forall ((v_ArrVal_150 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_150) c_threadThread1of1ForFork0_~p~0.base) .cse2)) (_ bv0 1)))))) is different from false [2023-12-02 20:28:48,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-02 20:28:48,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-12-02 20:28:48,915 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-02 20:28:48,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1696405691] [2023-12-02 20:28:48,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1696405691] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:28:48,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 20:28:48,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 16 [2023-12-02 20:28:48,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978985494] [2023-12-02 20:28:48,917 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 20:28:48,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-02 20:28:48,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-02 20:28:48,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-02 20:28:48,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=149, Unknown=3, NotChecked=78, Total=272 [2023-12-02 20:28:48,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:28:48,921 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:28:48,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.5625) internal successors, (73), 17 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:28:48,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:28:48,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:28:48,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:28:50,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:28:50,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:28:50,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-02 20:28:50,578 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-02 20:28:50,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:28:50,777 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-12-02 20:28:50,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:28:50,777 INFO L85 PathProgramCache]: Analyzing trace with hash -368462238, now seen corresponding path program 2 times [2023-12-02 20:28:50,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-02 20:28:50,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [135037780] [2023-12-02 20:28:50,778 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:28:50,778 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:28:50,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/mathsat [2023-12-02 20:28:50,779 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 20:28:50,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-02 20:28:50,940 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:28:50,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:28:50,947 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-02 20:28:50,952 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:28:50,976 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 7 [2023-12-02 20:28:51,016 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 20:28:51,016 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 13 treesize of output 13 [2023-12-02 20:28:51,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 20:28:51,535 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 9 [2023-12-02 20:28:51,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2023-12-02 20:28:51,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:28:51,742 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 34 treesize of output 42 [2023-12-02 20:28:51,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:28:51,873 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 45 treesize of output 58 [2023-12-02 20:28:52,380 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 51 treesize of output 40 [2023-12-02 20:28:52,423 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 51 treesize of output 40 [2023-12-02 20:28:52,454 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 51 treesize of output 40 [2023-12-02 20:28:52,490 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 51 treesize of output 40 [2023-12-02 20:28:52,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:28:52,769 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 51 treesize of output 40 [2023-12-02 20:28:52,913 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:28:52,914 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:28:53,042 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_217 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_217) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv2 32) c_threadThread1of1ForFork0_~p~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))) (forall ((v_ArrVal_217 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_217) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv3 32) c_threadThread1of1ForFork0_~p~0.offset))) (_ bv0 1))) (forall ((v_ArrVal_217 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_217) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))) (forall ((v_ArrVal_217 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_217) c_threadThread1of1ForFork0_~p~0.base) (bvadd c_threadThread1of1ForFork0_~p~0.offset (_ bv1 32)))) (_ bv0 1)))) is different from false [2023-12-02 20:28:53,140 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_216 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_217 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_216) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_217) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)) (_ bv0 1))) (forall ((v_ArrVal_216 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_217 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_216) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_217) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv3 32) c_threadThread1of1ForFork0_~p~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))) (forall ((v_ArrVal_216 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_217 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_216) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_217) c_threadThread1of1ForFork0_~p~0.base) (bvadd c_threadThread1of1ForFork0_~p~0.offset (_ bv1 32)))))) (forall ((v_ArrVal_216 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_217 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_216) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_217) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv2 32) c_threadThread1of1ForFork0_~p~0.offset)))))) is different from false [2023-12-02 20:28:53,390 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv3 32) c_threadThread1of1ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_216 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_217 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_216) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_217) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv2 32) c_threadThread1of1ForFork0_~p~0.offset))))) (forall ((v_ArrVal_216 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_217 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_216) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_217) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|) (_ bv0 1))) (forall ((v_ArrVal_216 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_217 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_216) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_217) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)) (_ bv0 1))) (forall ((v_ArrVal_216 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_217 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_216) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_217) c_threadThread1of1ForFork0_~p~0.base) (bvadd c_threadThread1of1ForFork0_~p~0.offset (_ bv1 32))))))))) is different from false [2023-12-02 20:28:53,422 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv2 32) c_threadThread1of1ForFork0_~p~0.offset)) (.cse1 (bvadd (_ bv3 32) c_threadThread1of1ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_216 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_217 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_216) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_217) c_threadThread1of1ForFork0_~p~0.base) .cse1)))) (forall ((v_ArrVal_216 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_217 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_216) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_217) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)) (_ bv0 1))) (forall ((v_ArrVal_216 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_217 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_216) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_217) c_threadThread1of1ForFork0_~p~0.base) .cse2)) (_ bv0 1))) (forall ((v_ArrVal_216 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_217 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_216) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_217) c_threadThread1of1ForFork0_~p~0.base) (bvadd c_threadThread1of1ForFork0_~p~0.offset (_ bv1 32)))) (_ bv0 1)))))) is different from false [2023-12-02 20:28:53,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:28:53,628 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 38 treesize of output 62 [2023-12-02 20:28:53,637 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:28:53,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 110 treesize of output 68 [2023-12-02 20:28:53,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2023-12-02 20:28:53,650 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 26 treesize of output 24 [2023-12-02 20:28:53,686 INFO L349 Elim1Store]: treesize reduction 46, result has 2.1 percent of original size [2023-12-02 20:28:53,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 1 [2023-12-02 20:28:53,697 INFO L349 Elim1Store]: treesize reduction 46, result has 2.1 percent of original size [2023-12-02 20:28:53,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 1 [2023-12-02 20:28:53,710 INFO L349 Elim1Store]: treesize reduction 46, result has 2.1 percent of original size [2023-12-02 20:28:53,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 1 [2023-12-02 20:28:54,259 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 14 [2023-12-02 20:28:54,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-12-02 20:28:54,531 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2023-12-02 20:28:54,531 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-02 20:28:54,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [135037780] [2023-12-02 20:28:54,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [135037780] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:28:54,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 20:28:54,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2023-12-02 20:28:54,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437472359] [2023-12-02 20:28:54,532 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 20:28:54,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-02 20:28:54,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-02 20:28:54,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-02 20:28:54,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=570, Unknown=4, NotChecked=204, Total=870 [2023-12-02 20:28:54,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:28:54,537 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:28:54,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 4.206896551724138) internal successors, (122), 30 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:28:54,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:28:54,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:28:54,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-12-02 20:28:54,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:31:19,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:31:19,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:31:19,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-02 20:31:19,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-02 20:31:19,988 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-02 20:31:20,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:31:20,184 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-12-02 20:31:20,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:31:20,185 INFO L85 PathProgramCache]: Analyzing trace with hash -2075374539, now seen corresponding path program 1 times [2023-12-02 20:31:20,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-02 20:31:20,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [767115516] [2023-12-02 20:31:20,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:31:20,186 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:31:20,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/mathsat [2023-12-02 20:31:20,187 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 20:31:20,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-02 20:31:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:31:20,376 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-02 20:31:20,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:31:20,387 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 7 [2023-12-02 20:31:20,423 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 20:31:20,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-02 20:31:20,522 INFO L349 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-12-02 20:31:20,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 25 treesize of output 36 [2023-12-02 20:31:20,608 INFO L349 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2023-12-02 20:31:20,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 35 [2023-12-02 20:31:21,479 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-12-02 20:31:21,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 59 [2023-12-02 20:31:21,490 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 21 treesize of output 15 [2023-12-02 20:31:21,879 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 20:31:21,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 22 [2023-12-02 20:31:21,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 20:31:22,011 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 9 [2023-12-02 20:31:22,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2023-12-02 20:31:22,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:31:22,236 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 34 treesize of output 42 [2023-12-02 20:31:22,432 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:31:22,433 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 45 treesize of output 58 [2023-12-02 20:31:23,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-02 20:31:23,403 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 20:31:23,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 44 [2023-12-02 20:31:23,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 21 [2023-12-02 20:31:23,610 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 20:31:23,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 44 [2023-12-02 20:31:23,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:31:23,618 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 35 treesize of output 21 [2023-12-02 20:31:23,791 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 20:31:23,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 44 [2023-12-02 20:31:23,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 21 [2023-12-02 20:31:23,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:31:23,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 40 [2023-12-02 20:31:24,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 40 [2023-12-02 20:31:24,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:31:24,508 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:31:24,644 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_288) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv2 32) c_threadThread1of1ForFork0_~p~0.offset))))) (forall ((v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_288) c_threadThread1of1ForFork0_~p~0.base) (bvadd c_threadThread1of1ForFork0_~p~0.offset (_ bv1 32)))) (_ bv0 1))) (forall ((v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_288) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv3 32) c_threadThread1of1ForFork0_~p~0.offset))))) (forall ((v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_288) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)) (_ bv0 1)))) is different from false [2023-12-02 20:31:24,700 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_288) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv2 32) c_threadThread1of1ForFork0_~p~0.offset))))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_288) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_288) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv3 32) c_threadThread1of1ForFork0_~p~0.offset))) (_ bv0 1))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_288) c_threadThread1of1ForFork0_~p~0.base) (bvadd c_threadThread1of1ForFork0_~p~0.offset (_ bv1 32))))))) is different from false [2023-12-02 20:31:24,782 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_287) .cse0 v_ArrVal_288) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_287) .cse0 v_ArrVal_288) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv3 32) c_threadThread1of1ForFork0_~p~0.offset))) (_ bv0 1))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_287) .cse0 v_ArrVal_288) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv2 32) c_threadThread1of1ForFork0_~p~0.offset))) (_ bv0 1))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_287) .cse0 v_ArrVal_288) c_threadThread1of1ForFork0_~p~0.base) (bvadd c_threadThread1of1ForFork0_~p~0.offset (_ bv1 32)))))))) is different from false [2023-12-02 20:31:25,026 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv3 32) c_threadThread1of1ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_287) .cse1 v_ArrVal_288) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv2 32) c_threadThread1of1ForFork0_~p~0.offset))) (_ bv0 1))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_287) .cse1 v_ArrVal_288) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)) (_ bv0 1))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_287) .cse1 v_ArrVal_288) c_threadThread1of1ForFork0_~p~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|) (_ bv0 1))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_287) .cse1 v_ArrVal_288) c_threadThread1of1ForFork0_~p~0.base) (bvadd c_threadThread1of1ForFork0_~p~0.offset (_ bv1 32))) |c_threadThread1of1ForFork0_#t~nondet4|)))))) is different from false [2023-12-02 20:31:25,058 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv2 32) c_threadThread1of1ForFork0_~p~0.offset)) (.cse3 (bvadd (_ bv3 32) c_threadThread1of1ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_287) .cse1 v_ArrVal_288) c_threadThread1of1ForFork0_~p~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_287) .cse1 v_ArrVal_288) c_threadThread1of1ForFork0_~p~0.base) .cse3)) (_ bv0 1))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_287) .cse1 v_ArrVal_288) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_287) .cse1 v_ArrVal_288) c_threadThread1of1ForFork0_~p~0.base) (bvadd c_threadThread1of1ForFork0_~p~0.offset (_ bv1 32))))))))) is different from false [2023-12-02 20:31:25,280 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:31:25,281 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 44 treesize of output 68 [2023-12-02 20:31:25,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:31:25,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 250 treesize of output 176 [2023-12-02 20:31:25,300 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 36 treesize of output 28 [2023-12-02 20:31:25,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2023-12-02 20:31:25,328 INFO L349 Elim1Store]: treesize reduction 46, result has 2.1 percent of original size [2023-12-02 20:31:25,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1 [2023-12-02 20:31:25,338 INFO L349 Elim1Store]: treesize reduction 46, result has 2.1 percent of original size [2023-12-02 20:31:25,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 1 [2023-12-02 20:31:25,348 INFO L349 Elim1Store]: treesize reduction 46, result has 2.1 percent of original size [2023-12-02 20:31:25,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 1 [2023-12-02 20:31:26,857 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:31:26,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 91 [2023-12-02 20:31:26,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 53 treesize of output 51 [2023-12-02 20:31:28,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-02 20:31:28,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-02 20:31:28,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [767115516] [2023-12-02 20:31:28,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [767115516] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:31:28,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 20:31:28,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2023-12-02 20:31:28,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224323948] [2023-12-02 20:31:28,469 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 20:31:28,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-12-02 20:31:28,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-02 20:31:28,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-12-02 20:31:28,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1069, Unknown=7, NotChecked=350, Total=1560 [2023-12-02 20:31:28,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:31:28,473 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:31:28,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 3.1794871794871793) internal successors, (124), 40 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:31:28,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:31:28,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:31:28,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-12-02 20:31:28,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-12-02 20:31:28,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:31:33,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:35:16,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:16,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:35:16,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-02 20:35:16,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-02 20:35:16,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-12-02 20:35:16,490 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-02 20:35:16,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:35:16,687 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-12-02 20:35:16,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:35:16,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1384085133, now seen corresponding path program 2 times [2023-12-02 20:35:16,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-02 20:35:16,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1984496037] [2023-12-02 20:35:16,689 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:35:16,689 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:35:16,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/mathsat [2023-12-02 20:35:16,690 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 20:35:16,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-02 20:35:16,878 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:35:16,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:35:16,884 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-02 20:35:16,889 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:35:16,896 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 7 [2023-12-02 20:35:16,931 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 20:35:16,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-02 20:35:17,055 INFO L349 Elim1Store]: treesize reduction 60, result has 34.1 percent of original size [2023-12-02 20:35:17,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 44 [2023-12-02 20:35:17,170 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-12-02 20:35:17,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2023-12-02 20:35:18,282 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-12-02 20:35:18,283 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 2 case distinctions, treesize of input 59 treesize of output 55 [2023-12-02 20:35:18,852 INFO L349 Elim1Store]: treesize reduction 28, result has 34.9 percent of original size [2023-12-02 20:35:18,852 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 2 case distinctions, treesize of input 51 treesize of output 45 [2023-12-02 20:35:18,870 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 21 treesize of output 15 [2023-12-02 20:35:19,249 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 9 [2023-12-02 20:35:19,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2023-12-02 20:35:19,711 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:35:19,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 42 [2023-12-02 20:35:21,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:35:21,130 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 74 treesize of output 54 [2023-12-02 20:35:21,423 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 20:35:21,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 35 [2023-12-02 20:35:21,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2023-12-02 20:35:21,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:35:21,658 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 45 treesize of output 58 [2023-12-02 20:35:21,937 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 20:35:21,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 44 [2023-12-02 20:35:21,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:35:21,944 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 35 treesize of output 21 [2023-12-02 20:35:22,313 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 20:35:22,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 44 [2023-12-02 20:35:22,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:35:22,321 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 35 treesize of output 21 [2023-12-02 20:35:22,650 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 20:35:22,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 44 [2023-12-02 20:35:22,659 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:35:22,660 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 35 treesize of output 21 [2023-12-02 20:35:23,378 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 51 treesize of output 40 [2023-12-02 20:35:23,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:35:23,621 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:35:23,767 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_359) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv3 32) c_threadThread1of1ForFork0_~p~0.offset))) (_ bv0 1))) (forall ((v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_359) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv2 32) c_threadThread1of1ForFork0_~p~0.offset))))) (forall ((v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_359) c_threadThread1of1ForFork0_~p~0.base) (bvadd c_threadThread1of1ForFork0_~p~0.offset (_ bv1 32)))))) (forall ((v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_359) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false [2023-12-02 20:35:24,086 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv3 32) c_threadThread1of1ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_358 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_359) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv2 32) c_threadThread1of1ForFork0_~p~0.offset))))) (forall ((v_ArrVal_358 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_359) c_threadThread1of1ForFork0_~p~0.base) (bvadd c_threadThread1of1ForFork0_~p~0.offset (_ bv1 32)))))) (forall ((v_ArrVal_358 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_359) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)) (_ bv0 1))) (forall ((v_ArrVal_358 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_359) c_threadThread1of1ForFork0_~p~0.base) .cse1))))))) is different from false [2023-12-02 20:35:24,118 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv3 32) c_threadThread1of1ForFork0_~p~0.offset))) (and (forall ((v_ArrVal_358 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_354 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_354) c_threadThread1of1ForFork0_~p~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_359) c_threadThread1of1ForFork0_~p~0.base) .cse0) |c_threadThread1of1ForFork0_#t~nondet4|))) (forall ((v_ArrVal_358 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_354 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_354) c_threadThread1of1ForFork0_~p~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_359) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)) (_ bv0 1))) (forall ((v_ArrVal_358 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_354 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_354) c_threadThread1of1ForFork0_~p~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_359) c_threadThread1of1ForFork0_~p~0.base) (bvadd c_threadThread1of1ForFork0_~p~0.offset (_ bv1 32)))))) (forall ((v_ArrVal_358 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_354 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_354) c_threadThread1of1ForFork0_~p~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_359) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv2 32) c_threadThread1of1ForFork0_~p~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|) (_ bv0 1))))) is different from false [2023-12-02 20:35:24,152 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv3 32) c_threadThread1of1ForFork0_~p~0.offset)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_358 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_354 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_354) c_threadThread1of1ForFork0_~p~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_358) .cse1 v_ArrVal_359) c_threadThread1of1ForFork0_~p~0.base) .cse0)) (_ bv0 1))) (forall ((v_ArrVal_358 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_354 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_354) c_threadThread1of1ForFork0_~p~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_358) .cse1 v_ArrVal_359) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)))) (forall ((v_ArrVal_358 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_354 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_354) c_threadThread1of1ForFork0_~p~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_358) .cse1 v_ArrVal_359) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv2 32) c_threadThread1of1ForFork0_~p~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|) (_ bv0 1))) (forall ((v_ArrVal_358 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_354 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_354) c_threadThread1of1ForFork0_~p~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_358) .cse1 v_ArrVal_359) c_threadThread1of1ForFork0_~p~0.base) (bvadd c_threadThread1of1ForFork0_~p~0.offset (_ bv1 32))) |c_threadThread1of1ForFork0_#t~nondet4|) (_ bv0 1))))) is different from false [2023-12-02 20:35:24,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:35:24,898 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 3 case distinctions, treesize of input 105 treesize of output 121 [2023-12-02 20:35:24,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:35:24,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 155 treesize of output 109 [2023-12-02 20:35:24,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2023-12-02 20:35:24,918 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 60 treesize of output 52 [2023-12-02 20:35:24,933 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:35:24,933 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:35:24,939 INFO L349 Elim1Store]: treesize reduction 34, result has 2.9 percent of original size [2023-12-02 20:35:24,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 1 [2023-12-02 20:35:24,941 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:35:24,942 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:35:24,944 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:35:24,945 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:35:24,950 INFO L349 Elim1Store]: treesize reduction 34, result has 2.9 percent of original size [2023-12-02 20:35:24,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 1 [2023-12-02 20:35:26,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:35:26,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 103 [2023-12-02 20:35:26,852 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 65 treesize of output 63 [2023-12-02 20:35:31,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-02 20:35:31,807 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-02 20:35:31,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1984496037] [2023-12-02 20:35:31,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1984496037] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:35:31,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 20:35:31,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 40 [2023-12-02 20:35:31,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712862891] [2023-12-02 20:35:31,807 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 20:35:31,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-02 20:35:31,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-02 20:35:31,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-02 20:35:31,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1190, Unknown=26, NotChecked=292, Total=1640 [2023-12-02 20:35:31,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:31,811 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:35:31,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 3.1) internal successors, (124), 41 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:35:31,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:31,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:35:31,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-12-02 20:35:31,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-12-02 20:35:31,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2023-12-02 20:35:31,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:56,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:36:00,208 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)) (_ bv0 1)) (not (= |c_ULTIMATE.start_main_~#tids~0#1.base| |c_threadThread1of1ForFork0_#in~arg.base|)) (= (bvadd (_ bv1 1) (select |c_#valid| .cse0)) (_ bv0 1)) (not (= |c_ULTIMATE.start_main_~#tids~0#1.base| |c_ULTIMATE.start_main_~#datas~0#1.base|)) (not (= |c_threadThread1of1ForFork0_#in~arg.base| .cse0)) (not (= |c_ULTIMATE.start_main_~#tids~0#1.base| |c_ULTIMATE.start_main_#t~mem9#1.base|)) (bvult |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#tids~0#1.base|) (not (= |c_ULTIMATE.start_main_~#datas~0#1.base| .cse0)) (not (= c_threadThread1of1ForFork0_~arg.base .cse0)) (forall ((v_ArrVal_346 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_346) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_#t~mem9#1.base|))) (not (= |c_ULTIMATE.start_main_~#tids~0#1.base| .cse0)) (or (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |c_ULTIMATE.start_main_~#tids~0#1.base|) (exists ((|ULTIMATE.start_main_~#datas~0#1.base| (_ BitVec 32))) (and (not (= |c_ULTIMATE.start_main_~#tids~0#1.base| |ULTIMATE.start_main_~#datas~0#1.base|)) (exists ((|ULTIMATE.start_main_~#datas~0#1.offset| (_ BitVec 32))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#datas~0#1.base|) |ULTIMATE.start_main_~#datas~0#1.offset|))) (and (not (= .cse1 .cse0)) (= .cse1 c_threadThread1of1ForFork0_~p~0.base) (bvult .cse1 |#StackHeapBarrier|)))) (not (= |ULTIMATE.start_main_~#datas~0#1.base| .cse0)))))) (and (not (= c_threadThread1of1ForFork0_~p~0.base .cse0)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |c_ULTIMATE.start_main_~#tids~0#1.base|) (bvult c_threadThread1of1ForFork0_~p~0.base |#StackHeapBarrier|))))) (= (bvadd (select |c_#valid| |c_ULTIMATE.start_main_~#tids~0#1.base|) (_ bv1 1)) (_ bv0 1)) (forall ((v_ArrVal_346 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_346) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_#t~mem9#1.base|))) (not (= |c_ULTIMATE.start_main_~#tids~0#1.base| c_threadThread1of1ForFork0_~arg.base)))) is different from false [2023-12-02 20:36:05,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:36:09,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:36:12,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:36:15,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:37:01,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:37:01,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:37:01,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-02 20:37:01,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-02 20:37:01,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-12-02 20:37:01,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-02 20:37:01,712 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-02 20:37:01,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:37:01,909 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-12-02 20:37:01,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:37:01,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1022550739, now seen corresponding path program 3 times [2023-12-02 20:37:01,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-02 20:37:01,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [128225350] [2023-12-02 20:37:01,910 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 20:37:01,910 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 20:37:01,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/mathsat [2023-12-02 20:37:01,911 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 20:37:01,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01ca5dc3-6314-403e-b518-24f9697dce54/bin/ugemcutter-verify-Bi2udmvEmx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-02 20:37:02,079 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 20:37:02,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:37:02,084 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-02 20:37:02,088 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:37:02,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 20:37:02,132 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 20:37:02,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-02 20:37:02,238 INFO L349 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-12-02 20:37:02,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 25 treesize of output 36 [2023-12-02 20:37:02,331 INFO L349 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2023-12-02 20:37:02,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 35 [2023-12-02 20:37:03,326 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-12-02 20:37:03,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 59 [2023-12-02 20:37:03,348 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 21 treesize of output 15 [2023-12-02 20:37:03,744 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 20:37:03,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 22 [2023-12-02 20:37:03,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 20:37:03,902 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 9 [2023-12-02 20:37:04,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2023-12-02 20:37:04,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-02 20:37:04,641 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 20:37:04,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 26 [2023-12-02 20:37:04,646 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:37:04,647 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 17 treesize of output 11 [2023-12-02 20:37:04,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:37:04,771 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 34 treesize of output 42 [2023-12-02 20:37:04,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:37:04,936 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 45 treesize of output 58 [2023-12-02 20:37:05,183 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 20:37:05,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 44 [2023-12-02 20:37:05,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 21 [2023-12-02 20:37:05,441 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 20:37:05,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 44 [2023-12-02 20:37:05,449 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:37:05,450 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 35 treesize of output 21 [2023-12-02 20:37:05,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:37:05,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 40 [2023-12-02 20:37:06,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 40 [2023-12-02 20:37:06,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:37:06,263 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:37:07,115 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv3 32) c_threadThread1of1ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_429 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_430 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_429) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_430) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)))) (forall ((v_ArrVal_429 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_430 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_429) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_430) c_threadThread1of1ForFork0_~p~0.base) .cse1)) (_ bv0 1))) (forall ((v_ArrVal_429 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_430 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_429) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_430) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv2 32) c_threadThread1of1ForFork0_~p~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|) (_ bv0 1))) (forall ((v_ArrVal_429 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_430 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_429) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_430) c_threadThread1of1ForFork0_~p~0.base) (bvadd c_threadThread1of1ForFork0_~p~0.offset (_ bv1 32))))))))) is different from false [2023-12-02 20:37:07,151 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv2 32) c_threadThread1of1ForFork0_~p~0.offset)) (.cse1 (bvadd (_ bv3 32) c_threadThread1of1ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_429 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_430 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_429) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_430) c_threadThread1of1ForFork0_~p~0.base) .cse1)))) (forall ((v_ArrVal_429 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_430 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_429) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_430) c_threadThread1of1ForFork0_~p~0.base) (bvadd c_threadThread1of1ForFork0_~p~0.offset (_ bv1 32)))) (_ bv0 1))) (forall ((v_ArrVal_429 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_430 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_429) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_430) c_threadThread1of1ForFork0_~p~0.base) .cse2)))) (forall ((v_ArrVal_429 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_430 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_429) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_430) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset))))))) is different from false [2023-12-02 20:37:07,186 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv2 32) c_threadThread1of1ForFork0_~p~0.offset)) (.cse1 (bvadd (_ bv3 32) c_threadThread1of1ForFork0_~p~0.offset))) (and (forall ((v_ArrVal_429 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_430 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_423 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_423) c_threadThread1of1ForFork0_~p~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_429) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_430) c_threadThread1of1ForFork0_~p~0.base) (bvadd c_threadThread1of1ForFork0_~p~0.offset (_ bv1 32)))) (_ bv0 1))) (forall ((v_ArrVal_429 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_430 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_423 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_423) c_threadThread1of1ForFork0_~p~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_429) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_430) c_threadThread1of1ForFork0_~p~0.base) .cse1)) (_ bv0 1))) (forall ((v_ArrVal_429 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_430 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_423 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_423) c_threadThread1of1ForFork0_~p~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_429) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_430) c_threadThread1of1ForFork0_~p~0.base) .cse0)))) (forall ((v_ArrVal_429 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_430 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_423 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_423) c_threadThread1of1ForFork0_~p~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_429) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_430) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-12-02 20:37:07,223 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv2 32) c_threadThread1of1ForFork0_~p~0.offset)) (.cse1 (bvadd (_ bv3 32) c_threadThread1of1ForFork0_~p~0.offset)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_429 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_430 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_423 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_423) c_threadThread1of1ForFork0_~p~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_429) .cse2 v_ArrVal_430) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)))) (forall ((v_ArrVal_429 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_430 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_423 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_423) c_threadThread1of1ForFork0_~p~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_429) .cse2 v_ArrVal_430) c_threadThread1of1ForFork0_~p~0.base) .cse0)))) (forall ((v_ArrVal_429 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_430 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_423 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_423) c_threadThread1of1ForFork0_~p~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_429) .cse2 v_ArrVal_430) c_threadThread1of1ForFork0_~p~0.base) .cse1)))) (forall ((v_ArrVal_429 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_430 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_423 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_423) c_threadThread1of1ForFork0_~p~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_429) .cse2 v_ArrVal_430) c_threadThread1of1ForFork0_~p~0.base) (bvadd c_threadThread1of1ForFork0_~p~0.offset (_ bv1 32)))))))) is different from false [2023-12-02 20:37:07,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:37:07,731 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 2 case distinctions, treesize of input 100 treesize of output 109 [2023-12-02 20:37:07,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:37:07,739 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 131 treesize of output 97 [2023-12-02 20:37:07,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2023-12-02 20:37:07,748 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 60 treesize of output 52 [2023-12-02 20:37:07,765 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:37:07,765 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:37:07,768 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:37:07,769 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:37:07,771 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:37:07,772 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:37:07,777 INFO L349 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2023-12-02 20:37:07,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2023-12-02 20:37:09,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:37:09,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 91 [2023-12-02 20:37:09,501 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 53 treesize of output 51 [2023-12-02 20:37:12,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-02 20:37:12,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-02 20:37:12,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [128225350] [2023-12-02 20:37:12,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [128225350] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:37:12,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 20:37:12,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 40 [2023-12-02 20:37:12,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67599250] [2023-12-02 20:37:12,345 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 20:37:12,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-02 20:37:12,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-02 20:37:12,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-02 20:37:12,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1180, Unknown=39, NotChecked=292, Total=1640 [2023-12-02 20:37:12,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:37:12,348 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:37:12,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 3.1) internal successors, (124), 41 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:37:12,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:37:12,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:37:12,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-12-02 20:37:12,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-12-02 20:37:12,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2023-12-02 20:37:12,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-12-02 20:37:12,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.