./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c --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_f5273826-5ad2-407e-a3b8-6b0915f9518a/bin/ugemcutter-verify-Bi2udmvEmx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/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_f5273826-5ad2-407e-a3b8-6b0915f9518a/bin/ugemcutter-verify-Bi2udmvEmx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/bin/ugemcutter-verify-Bi2udmvEmx/config/GemCutterReach.xml -i ../../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/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_f5273826-5ad2-407e-a3b8-6b0915f9518a/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 c1d27b7f98ac68d2da6120346c107c87df7f6f708200f0d5d2c806741122116e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 20:45:38,736 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 20:45:38,817 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/bin/ugemcutter-verify-Bi2udmvEmx/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2023-12-02 20:45:38,821 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 20:45:38,822 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 20:45:38,845 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 20:45:38,845 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 20:45:38,846 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 20:45:38,847 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 20:45:38,847 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 20:45:38,848 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 20:45:38,849 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 20:45:38,849 INFO L153 SettingsManager]: * Use SBE=true [2023-12-02 20:45:38,850 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 20:45:38,850 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 20:45:38,851 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 20:45:38,851 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 20:45:38,852 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 20:45:38,852 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 20:45:38,853 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 20:45:38,853 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 20:45:38,854 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 20:45:38,854 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-12-02 20:45:38,855 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 20:45:38,855 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 20:45:38,856 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 20:45:38,856 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 20:45:38,857 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 20:45:38,857 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 20:45:38,857 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-02 20:45:38,858 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 20:45:38,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 20:45:38,858 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 20:45:38,859 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 20:45:38,859 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 20:45:38,859 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-02 20:45:38,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 20:45:38,859 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 20:45:38,860 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2023-12-02 20:45:38,860 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-12-02 20:45:38,860 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 20:45:38,860 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-12-02 20:45:38,861 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-12-02 20:45:38,861 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_f5273826-5ad2-407e-a3b8-6b0915f9518a/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_f5273826-5ad2-407e-a3b8-6b0915f9518a/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 -> c1d27b7f98ac68d2da6120346c107c87df7f6f708200f0d5d2c806741122116e [2023-12-02 20:45:39,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 20:45:39,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 20:45:39,118 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 20:45:39,119 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 20:45:39,120 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 20:45:39,121 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/bin/ugemcutter-verify-Bi2udmvEmx/../../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c [2023-12-02 20:45:41,821 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 20:45:41,985 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 20:45:41,985 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c [2023-12-02 20:45:41,993 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/bin/ugemcutter-verify-Bi2udmvEmx/data/bd5115684/9d134f6531344c719e58543fa78f549a/FLAG5746c303e [2023-12-02 20:45:42,005 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/bin/ugemcutter-verify-Bi2udmvEmx/data/bd5115684/9d134f6531344c719e58543fa78f549a [2023-12-02 20:45:42,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 20:45:42,008 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 20:45:42,009 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 20:45:42,009 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 20:45:42,013 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 20:45:42,014 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:45:42" (1/1) ... [2023-12-02 20:45:42,015 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23620084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:45:42, skipping insertion in model container [2023-12-02 20:45:42,015 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:45:42" (1/1) ... [2023-12-02 20:45:42,036 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 20:45:42,205 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 20:45:42,215 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 20:45:42,249 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 20:45:42,258 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 20:45:42,259 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 20:45:42,266 INFO L206 MainTranslator]: Completed translation [2023-12-02 20:45:42,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:45:42 WrapperNode [2023-12-02 20:45:42,267 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 20:45:42,268 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 20:45:42,268 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 20:45:42,268 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 20:45:42,274 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:45:42" (1/1) ... [2023-12-02 20:45:42,286 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:45:42" (1/1) ... [2023-12-02 20:45:42,319 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 222 [2023-12-02 20:45:42,319 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 20:45:42,320 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 20:45:42,320 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 20:45:42,320 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 20:45:42,330 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:45:42" (1/1) ... [2023-12-02 20:45:42,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:45:42" (1/1) ... [2023-12-02 20:45:42,337 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:45:42" (1/1) ... [2023-12-02 20:45:42,337 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:45:42" (1/1) ... [2023-12-02 20:45:42,356 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:45:42" (1/1) ... [2023-12-02 20:45:42,362 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:45:42" (1/1) ... [2023-12-02 20:45:42,365 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:45:42" (1/1) ... [2023-12-02 20:45:42,367 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:45:42" (1/1) ... [2023-12-02 20:45:42,373 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 20:45:42,374 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 20:45:42,374 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 20:45:42,374 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 20:45:42,375 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:45:42" (1/1) ... [2023-12-02 20:45:42,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 20:45:42,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:45:42,405 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/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:45:42,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/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:45:42,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 20:45:42,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 20:45:42,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 20:45:42,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 20:45:42,440 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-02 20:45:42,441 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-02 20:45:42,441 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-02 20:45:42,441 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-02 20:45:42,441 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-12-02 20:45:42,441 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-12-02 20:45:42,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 20:45:42,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-02 20:45:42,442 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-02 20:45:42,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 20:45:42,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 20:45:42,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 20:45:42,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 20:45:42,444 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:45:42,575 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 20:45:42,577 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 20:45:43,083 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 20:45:43,211 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 20:45:43,211 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-12-02 20:45:43,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:45:43 BoogieIcfgContainer [2023-12-02 20:45:43,213 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 20:45:43,215 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 20:45:43,215 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 20:45:43,218 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 20:45:43,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:45:42" (1/3) ... [2023-12-02 20:45:43,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6644a348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:45:43, skipping insertion in model container [2023-12-02 20:45:43,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:45:42" (2/3) ... [2023-12-02 20:45:43,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6644a348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:45:43, skipping insertion in model container [2023-12-02 20:45:43,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:45:43" (3/3) ... [2023-12-02 20:45:43,221 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-three-array-sum.wvr.c [2023-12-02 20:45:43,228 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-12-02 20:45:43,236 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 20:45:43,236 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2023-12-02 20:45:43,236 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 20:45:43,363 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-02 20:45:43,413 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:45:43,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-12-02 20:45:43,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:45:43,415 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-12-02 20:45:43,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-12-02 20:45:43,459 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-12-02 20:45:43,470 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thread2Thread1of1ForFork1 ======== [2023-12-02 20:45:43,475 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;@7d130a43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:45:43,476 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-12-02 20:45:43,767 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err2ASSERT_VIOLATIONDATA_RACE, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-12-02 20:45:43,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:45:43,772 INFO L85 PathProgramCache]: Analyzing trace with hash -77108874, now seen corresponding path program 1 times [2023-12-02 20:45:43,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:45:43,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470386194] [2023-12-02 20:45:43,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:45:43,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:45:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:45:44,007 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:45:44,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:45:44,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470386194] [2023-12-02 20:45:44,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470386194] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:45:44,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:45:44,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:45:44,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736972969] [2023-12-02 20:45:44,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:45:44,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-02 20:45:44,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:45:44,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-02 20:45:44,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 20:45:44,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:44,041 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:45:44,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 74.5) internal successors, (149), 2 states have internal predecessors, (149), 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:45:44,042 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:44,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:44,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 20:45:44,086 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err2ASSERT_VIOLATIONDATA_RACE, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-12-02 20:45:44,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:45:44,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1313541827, now seen corresponding path program 1 times [2023-12-02 20:45:44,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:45:44,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803901029] [2023-12-02 20:45:44,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:45:44,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:45:44,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:45:44,309 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:45:44,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:45:44,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803901029] [2023-12-02 20:45:44,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803901029] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:45:44,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:45:44,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:45:44,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361342229] [2023-12-02 20:45:44,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:45:44,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:45:44,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:45:44,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:45:44,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:45:44,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:44,315 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:45:44,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 71.5) internal successors, (143), 3 states have internal predecessors, (143), 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:45:44,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:44,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:50,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:50,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:50,260 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (7 of 8 remaining) [2023-12-02 20:45:50,261 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2023-12-02 20:45:50,262 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2023-12-02 20:45:50,262 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2023-12-02 20:45:50,262 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2023-12-02 20:45:50,262 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2023-12-02 20:45:50,262 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2023-12-02 20:45:50,263 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2023-12-02 20:45:50,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 20:45:50,274 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-12-02 20:45:50,276 INFO L307 ceAbstractionStarter]: Result for error location thread2Thread1of1ForFork1 was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/4) [2023-12-02 20:45:50,284 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:45:50,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-12-02 20:45:50,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:45:50,323 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-12-02 20:45:50,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2023-12-02 20:45:50,328 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-12-02 20:45:50,329 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thread1Thread1of1ForFork0 ======== [2023-12-02 20:45:50,329 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;@7d130a43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:45:50,329 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-12-02 20:45:50,454 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-12-02 20:45:50,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:45:50,454 INFO L85 PathProgramCache]: Analyzing trace with hash 485676949, now seen corresponding path program 1 times [2023-12-02 20:45:50,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:45:50,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399538389] [2023-12-02 20:45:50,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:45:50,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:45:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:45:50,517 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:45:50,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:45:50,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399538389] [2023-12-02 20:45:50,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399538389] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:45:50,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:45:50,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:45:50,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147386872] [2023-12-02 20:45:50,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:45:50,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-02 20:45:50,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:45:50,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-02 20:45:50,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 20:45:50,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:50,522 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:45:50,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 71.5) internal successors, (143), 2 states have internal predecessors, (143), 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:45:50,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:50,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:50,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 20:45:50,536 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-12-02 20:45:50,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:45:50,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1591181468, now seen corresponding path program 1 times [2023-12-02 20:45:50,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:45:50,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588227880] [2023-12-02 20:45:50,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:45:50,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:45:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:45:50,678 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:45:50,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:45:50,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588227880] [2023-12-02 20:45:50,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588227880] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:45:50,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:45:50,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:45:50,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73765206] [2023-12-02 20:45:50,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:45:50,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:45:50,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:45:50,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:45:50,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:45:50,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:50,683 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:45:50,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 68.5) internal successors, (137), 3 states have internal predecessors, (137), 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:45:50,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:50,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:50,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:50,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:50,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 20:45:50,719 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-12-02 20:45:50,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:45:50,720 INFO L85 PathProgramCache]: Analyzing trace with hash -665932747, now seen corresponding path program 1 times [2023-12-02 20:45:50,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:45:50,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003678790] [2023-12-02 20:45:50,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:45:50,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:45:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:45:50,784 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:45:50,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:45:50,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003678790] [2023-12-02 20:45:50,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003678790] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:45:50,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:45:50,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:45:50,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737624993] [2023-12-02 20:45:50,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:45:50,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:45:50,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:45:50,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:45:50,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:45:50,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:50,788 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:45:50,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 70.0) internal successors, (140), 3 states have internal predecessors, (140), 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:45:50,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:50,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:50,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:50,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:50,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:50,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:50,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 20:45:50,838 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-12-02 20:45:50,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:45:50,838 INFO L85 PathProgramCache]: Analyzing trace with hash -11210377, now seen corresponding path program 1 times [2023-12-02 20:45:50,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:45:50,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386789477] [2023-12-02 20:45:50,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:45:50,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:45:50,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:45:50,895 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:45:50,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:45:50,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386789477] [2023-12-02 20:45:50,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386789477] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:45:50,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:45:50,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:45:50,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032324278] [2023-12-02 20:45:50,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:45:50,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:45:50,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:45:50,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:45:50,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:45:50,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:50,898 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:45:50,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 71.0) internal successors, (142), 3 states have internal predecessors, (142), 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:45:50,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:50,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:50,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:50,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:51,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:51,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:51,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:51,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:51,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 20:45:51,043 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-12-02 20:45:51,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:45:51,043 INFO L85 PathProgramCache]: Analyzing trace with hash -2097963813, now seen corresponding path program 1 times [2023-12-02 20:45:51,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:45:51,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800215376] [2023-12-02 20:45:51,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:45:51,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:45:51,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:45:51,224 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:45:51,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:45:51,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800215376] [2023-12-02 20:45:51,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800215376] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:45:51,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:45:51,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 20:45:51,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920600845] [2023-12-02 20:45:51,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:45:51,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 20:45:51,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:45:51,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 20:45:51,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-02 20:45:51,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:51,227 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:45:51,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 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:45:51,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:51,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:51,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:51,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:51,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:51,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:51,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:51,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:51,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:51,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:45:51,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 20:45:51,544 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-12-02 20:45:51,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:45:51,545 INFO L85 PathProgramCache]: Analyzing trace with hash 682748274, now seen corresponding path program 1 times [2023-12-02 20:45:51,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:45:51,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913846603] [2023-12-02 20:45:51,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:45:51,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:45:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:45:52,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 20:45:52,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:45:52,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913846603] [2023-12-02 20:45:52,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913846603] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:45:52,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:45:52,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 20:45:52,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237746872] [2023-12-02 20:45:52,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:45:52,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 20:45:52,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:45:52,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 20:45:52,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-02 20:45:52,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:52,289 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:45:52,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 38.0) internal successors, (190), 6 states have internal predecessors, (190), 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:45:52,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:52,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:52,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:52,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:52,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:45:52,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:53,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:53,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:53,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:53,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:53,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:45:53,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:45:53,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-02 20:45:53,233 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-12-02 20:45:53,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:45:53,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1136391157, now seen corresponding path program 1 times [2023-12-02 20:45:53,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:45:53,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984168392] [2023-12-02 20:45:53,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:45:53,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:45:53,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:45:53,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 20:45:53,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:45:53,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984168392] [2023-12-02 20:45:53,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984168392] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:45:53,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:45:53,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:45:53,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640047115] [2023-12-02 20:45:53,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:45:53,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:45:53,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:45:53,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:45:53,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:45:53,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:53,314 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:45:53,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 97.0) internal successors, (194), 3 states have internal predecessors, (194), 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:45:53,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:53,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:53,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:53,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:53,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:45:53,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:45:53,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:53,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:53,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:53,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:53,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:53,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:45:53,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:45:53,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:53,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-02 20:45:53,339 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-12-02 20:45:53,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:45:53,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1575575096, now seen corresponding path program 1 times [2023-12-02 20:45:53,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:45:53,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821625483] [2023-12-02 20:45:53,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:45:53,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:45:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:45:53,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 20:45:53,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:45:53,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821625483] [2023-12-02 20:45:53,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821625483] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:45:53,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:45:53,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:45:53,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329159827] [2023-12-02 20:45:53,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:45:53,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:45:53,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:45:53,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:45:53,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:45:53,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:53,416 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:45:53,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 99.0) internal successors, (198), 3 states have internal predecessors, (198), 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:45:53,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:53,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:53,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:53,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:53,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:45:53,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:45:53,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:53,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:53,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:53,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:53,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:53,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:53,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:45:53,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:45:53,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:53,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:53,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-02 20:45:53,472 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-12-02 20:45:53,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:45:53,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1995755206, now seen corresponding path program 1 times [2023-12-02 20:45:53,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:45:53,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994519747] [2023-12-02 20:45:53,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:45:53,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:45:53,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:45:53,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 20:45:53,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:45:53,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994519747] [2023-12-02 20:45:53,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994519747] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:45:53,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:45:53,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:45:53,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272141362] [2023-12-02 20:45:53,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:45:53,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:45:53,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:45:53,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:45:53,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:45:53,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:53,547 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:45:53,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 100.0) internal successors, (200), 3 states have internal predecessors, (200), 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:45:53,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:53,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:53,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:53,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:53,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:45:53,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:45:53,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:53,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:53,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:55,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:55,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:55,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:55,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:55,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:45:55,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:45:55,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:55,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:55,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:55,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-02 20:45:55,180 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-12-02 20:45:55,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:45:55,181 INFO L85 PathProgramCache]: Analyzing trace with hash -2090736162, now seen corresponding path program 1 times [2023-12-02 20:45:55,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:45:55,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251914134] [2023-12-02 20:45:55,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:45:55,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:45:55,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:45:55,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 20:45:55,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:45:55,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251914134] [2023-12-02 20:45:55,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251914134] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:45:55,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:45:55,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 20:45:55,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372467018] [2023-12-02 20:45:55,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:45:55,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 20:45:55,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:45:55,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 20:45:55,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-02 20:45:55,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:55,940 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:45:55,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 41.2) internal successors, (206), 6 states have internal predecessors, (206), 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:45:55,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:55,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:55,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:55,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:55,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:45:55,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:45:55,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:55,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:55,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:55,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:57,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:57,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:57,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:57,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:57,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:45:57,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:45:57,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:57,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:57,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:57,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:45:57,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-02 20:45:57,730 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-12-02 20:45:57,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:45:57,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1811333279, now seen corresponding path program 1 times [2023-12-02 20:45:57,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:45:57,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357228716] [2023-12-02 20:45:57,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:45:57,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:45:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:45:57,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 20:45:57,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:45:57,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357228716] [2023-12-02 20:45:57,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357228716] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:45:57,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:45:57,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:45:57,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438277096] [2023-12-02 20:45:57,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:45:57,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:45:57,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:45:57,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:45:57,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:45:57,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:57,840 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:45:57,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 105.0) internal successors, (210), 3 states have internal predecessors, (210), 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:45:57,840 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:57,840 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:57,840 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:57,840 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:57,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:45:57,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:45:57,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:57,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:57,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:57,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:45:57,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:01,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:01,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:01,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:01,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:01,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:01,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:01,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:01,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:01,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:01,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:01,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:01,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-02 20:46:01,360 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-12-02 20:46:01,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:46:01,360 INFO L85 PathProgramCache]: Analyzing trace with hash -158353768, now seen corresponding path program 1 times [2023-12-02 20:46:01,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:46:01,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073102428] [2023-12-02 20:46:01,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:01,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:46:01,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:01,856 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 174 proven. 4 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2023-12-02 20:46:01,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:46:01,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073102428] [2023-12-02 20:46:01,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073102428] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:46:01,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7771838] [2023-12-02 20:46:01,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:01,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:46:01,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:46:01,860 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:46:01,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 20:46:02,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:02,155 INFO L262 TraceCheckSpWp]: Trace formula consists of 1061 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 20:46:02,172 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:46:02,617 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 177 proven. 1 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2023-12-02 20:46:02,618 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:46:03,001 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 177 proven. 1 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2023-12-02 20:46:03,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7771838] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:46:03,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:46:03,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2023-12-02 20:46:03,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160328190] [2023-12-02 20:46:03,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:46:03,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-02 20:46:03,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:46:03,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-02 20:46:03,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2023-12-02 20:46:03,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:03,006 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:46:03,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 17.25) internal successors, (414), 24 states have internal predecessors, (414), 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:46:03,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:03,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:03,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:03,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:03,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:03,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:03,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:03,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:03,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:03,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:03,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:03,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:03,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:03,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:03,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:03,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:03,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:03,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:03,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:03,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:03,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:03,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:03,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:03,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:46:03,892 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-02 20:46:04,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:46:04,087 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-12-02 20:46:04,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:46:04,088 INFO L85 PathProgramCache]: Analyzing trace with hash -558789521, now seen corresponding path program 2 times [2023-12-02 20:46:04,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:46:04,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994777543] [2023-12-02 20:46:04,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:04,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:46:04,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:05,298 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 294 proven. 167 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-02 20:46:05,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:46:05,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994777543] [2023-12-02 20:46:05,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994777543] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:46:05,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603257125] [2023-12-02 20:46:05,299 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:46:05,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:46:05,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:46:05,300 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:46:05,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 20:46:05,522 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-02 20:46:05,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:46:05,525 INFO L262 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 59 conjunts are in the unsatisfiable core [2023-12-02 20:46:05,538 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:46:05,622 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:46:05,771 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-02 20:46:05,772 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 16 [2023-12-02 20:46:06,084 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:46:06,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 20:46:06,974 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-02 20:46:07,013 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 28 treesize of output 27 [2023-12-02 20:46:07,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:46:07,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2023-12-02 20:46:07,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:46:07,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 52 treesize of output 57 [2023-12-02 20:46:07,398 INFO L349 Elim1Store]: treesize reduction 83, result has 36.6 percent of original size [2023-12-02 20:46:07,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 164 treesize of output 162 [2023-12-02 20:46:07,422 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 20:46:07,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 113 [2023-12-02 20:46:07,449 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:46:07,449 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 21 treesize of output 7 [2023-12-02 20:46:11,591 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 473 trivial. 0 not checked. [2023-12-02 20:46:11,592 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:48:23,583 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse11 (+ c_~A~0.offset 2 .cse3)) (.cse6 (+ c_~A~0.offset 3 .cse3))) (let ((.cse2 (store (store (select |c_#race| c_~A~0.base) .cse11 0) .cse6 0))) (and (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (< v_thread2Thread1of1ForFork1_~i~1_25 0) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse1 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset 1 .cse1) 0) (+ c_~A~0.offset 2 .cse1) 0) (+ c_~A~0.offset 3 .cse1) 0)))) (store .cse0 c_~B~0.base (store (store (store (store (select .cse0 c_~B~0.base) (+ ~B~0.offset .cse1) v_ArrVal_1155) (+ ~B~0.offset 1 .cse1) 0) (+ 2 ~B~0.offset .cse1) 0) (+ 3 ~B~0.offset .cse1) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) (+ c_~A~0.offset .cse3)) 0)))) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse5 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse4 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset 1 .cse5) 0) (+ c_~A~0.offset 2 .cse5) 0) (+ c_~A~0.offset 3 .cse5) 0)))) (store .cse4 c_~B~0.base (store (store (store (store (select .cse4 c_~B~0.base) (+ ~B~0.offset .cse5) v_ArrVal_1155) (+ ~B~0.offset 1 .cse5) 0) (+ 2 ~B~0.offset .cse5) 0) (+ 3 ~B~0.offset .cse5) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse6) 0)) (< v_thread2Thread1of1ForFork1_~i~1_25 0))) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (< v_thread2Thread1of1ForFork1_~i~1_25 0) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse8 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse7 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse8) 0) (+ c_~A~0.offset 1 .cse8) 0) (+ c_~A~0.offset 2 .cse8) 0) (+ c_~A~0.offset 3 .cse8) 0)))) (store .cse7 c_~B~0.base (store (store (store (store (select .cse7 c_~B~0.base) (+ ~B~0.offset .cse8) v_ArrVal_1155) (+ ~B~0.offset 1 .cse8) 0) (+ 2 ~B~0.offset .cse8) 0) (+ 3 ~B~0.offset .cse8) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) (+ c_~A~0.offset .cse3 1)) 0)))) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (< v_thread2Thread1of1ForFork1_~i~1_25 0) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse10 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse9 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse10) 0) (+ c_~A~0.offset 1 .cse10) 0) (+ c_~A~0.offset 2 .cse10) 0) (+ c_~A~0.offset 3 .cse10) 0)))) (store .cse9 c_~B~0.base (store (store (store (store (select .cse9 c_~B~0.base) (+ ~B~0.offset .cse10) v_ArrVal_1155) (+ ~B~0.offset 1 .cse10) 0) (+ 2 ~B~0.offset .cse10) 0) (+ 3 ~B~0.offset .cse10) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse11) 0)))))))) is different from true [2023-12-02 20:48:25,817 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse9 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse3 (+ c_~A~0.offset .cse9 1)) (.cse6 (+ c_~A~0.offset 2 .cse9)) (.cse12 (+ c_~A~0.offset 3 .cse9))) (let ((.cse2 (store (store (store (select |c_#race| c_~A~0.base) .cse3 0) .cse6 0) .cse12 0))) (and (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= 0 (select (select (store (let ((.cse1 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset 1 .cse1) 0) (+ c_~A~0.offset 2 .cse1) 0) (+ c_~A~0.offset 3 .cse1) 0)))) (store .cse0 c_~B~0.base (store (store (store (store (select .cse0 c_~B~0.base) (+ ~B~0.offset .cse1) v_ArrVal_1155) (+ ~B~0.offset 1 .cse1) 0) (+ 2 ~B~0.offset .cse1) 0) (+ 3 ~B~0.offset .cse1) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse3))) (< v_thread2Thread1of1ForFork1_~i~1_25 0))) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse5 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse4 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset 1 .cse5) 0) (+ c_~A~0.offset 2 .cse5) 0) (+ c_~A~0.offset 3 .cse5) 0)))) (store .cse4 c_~B~0.base (store (store (store (store (select .cse4 c_~B~0.base) (+ ~B~0.offset .cse5) v_ArrVal_1155) (+ ~B~0.offset 1 .cse5) 0) (+ 2 ~B~0.offset .cse5) 0) (+ 3 ~B~0.offset .cse5) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse6) 0)) (< v_thread2Thread1of1ForFork1_~i~1_25 0))) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (< v_thread2Thread1of1ForFork1_~i~1_25 0) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse8 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse7 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse8) 0) (+ c_~A~0.offset 1 .cse8) 0) (+ c_~A~0.offset 2 .cse8) 0) (+ c_~A~0.offset 3 .cse8) 0)))) (store .cse7 c_~B~0.base (store (store (store (store (select .cse7 c_~B~0.base) (+ ~B~0.offset .cse8) v_ArrVal_1155) (+ ~B~0.offset 1 .cse8) 0) (+ 2 ~B~0.offset .cse8) 0) (+ 3 ~B~0.offset .cse8) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) (+ c_~A~0.offset .cse9)) 0)))) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse11 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse10 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse11) 0) (+ c_~A~0.offset 1 .cse11) 0) (+ c_~A~0.offset 2 .cse11) 0) (+ c_~A~0.offset 3 .cse11) 0)))) (store .cse10 c_~B~0.base (store (store (store (store (select .cse10 c_~B~0.base) (+ ~B~0.offset .cse11) v_ArrVal_1155) (+ ~B~0.offset 1 .cse11) 0) (+ 2 ~B~0.offset .cse11) 0) (+ 3 ~B~0.offset .cse11) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse12) 0)) (< v_thread2Thread1of1ForFork1_~i~1_25 0))))))) is different from true [2023-12-02 20:48:26,422 INFO L349 Elim1Store]: treesize reduction 2067, result has 15.8 percent of original size [2023-12-02 20:48:26,422 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 12 case distinctions, treesize of input 185 treesize of output 403 [2023-12-02 20:48:26,557 INFO L349 Elim1Store]: treesize reduction 258, result has 11.3 percent of original size [2023-12-02 20:48:26,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 394 treesize of output 329 [2023-12-02 20:48:26,588 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 14 treesize of output 7 [2023-12-02 20:48:26,776 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:48:26,800 INFO L349 Elim1Store]: treesize reduction 240, result has 0.4 percent of original size [2023-12-02 20:48:26,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 12 case distinctions, treesize of input 184 treesize of output 1 [2023-12-02 20:48:26,805 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:48:26,826 INFO L349 Elim1Store]: treesize reduction 240, result has 0.4 percent of original size [2023-12-02 20:48:26,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 12 case distinctions, treesize of input 185 treesize of output 1 [2023-12-02 20:48:26,831 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:48:26,855 INFO L349 Elim1Store]: treesize reduction 240, result has 0.4 percent of original size [2023-12-02 20:48:26,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 12 case distinctions, treesize of input 185 treesize of output 1 [2023-12-02 20:49:19,474 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 473 trivial. 10 not checked. [2023-12-02 20:49:19,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603257125] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:49:19,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:49:19,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 26, 23] total 66 [2023-12-02 20:49:19,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401738280] [2023-12-02 20:49:19,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:49:19,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2023-12-02 20:49:19,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:49:19,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2023-12-02 20:49:19,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=3783, Unknown=39, NotChecked=250, Total=4290 [2023-12-02 20:49:19,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:49:19,480 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:49:19,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 12.757575757575758) internal successors, (842), 66 states have internal predecessors, (842), 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:49:19,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:49:19,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:49:19,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:49:19,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:49:19,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:49:19,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:49:19,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:49:19,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:49:19,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:49:19,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:49:19,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:49:19,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:49:19,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:49:22,241 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse29 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse6 (select |c_#race| c_~A~0.base)) (.cse19 (+ c_~A~0.offset 3 .cse29))) (let ((.cse7 (+ c_~A~0.offset .cse29)) (.cse2 (not (= c_~B~0.base c_~A~0.base))) (.cse1 (not (= |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| c_~A~0.base))) (.cse3 (not (= |c_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base| c_~A~0.base))) (.cse16 (not (= c_~A~0.base |c_ULTIMATE.start_create_fresh_uint_array_#res#1.base|))) (.cse10 (store .cse6 .cse19 0)) (.cse24 (+ c_~A~0.offset .cse29 1)) (.cse0 (< c_~N~0 1)) (.cse11 (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30|) 0)))) (.cse12 (not (= (select |c_#valid| c_~A~0.base) 0))) (.cse15 (+ c_~A~0.offset 2 .cse29))) (and (<= c_~N~0 2) (or .cse0 (and .cse1 .cse2)) (or (and .cse3 .cse2) .cse0) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse5 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse4 (store |c_#race| c_~A~0.base (store (store (store (store .cse6 (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset 1 .cse5) 0) (+ c_~A~0.offset 2 .cse5) 0) (+ c_~A~0.offset 3 .cse5) 0)))) (store .cse4 c_~B~0.base (store (store (store (store (select .cse4 c_~B~0.base) (+ ~B~0.offset .cse5) v_ArrVal_1155) (+ ~B~0.offset 1 .cse5) 0) (+ 2 ~B~0.offset .cse5) 0) (+ 3 ~B~0.offset .cse5) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse7) 0)) (< v_thread2Thread1of1ForFork1_~i~1_25 0))) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (< v_thread2Thread1of1ForFork1_~i~1_25 0) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= 0 (select (select (store (let ((.cse9 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse8 (store |c_#race| c_~A~0.base (store (store (store (store .cse10 (+ c_~A~0.offset .cse9) 0) (+ c_~A~0.offset 1 .cse9) 0) (+ c_~A~0.offset 2 .cse9) 0) (+ c_~A~0.offset 3 .cse9) 0)))) (store .cse8 c_~B~0.base (store (store (store (store (select .cse8 c_~B~0.base) (+ ~B~0.offset .cse9) v_ArrVal_1155) (+ ~B~0.offset 1 .cse9) 0) (+ 2 ~B~0.offset .cse9) 0) (+ 3 ~B~0.offset .cse9) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse7))))) (or (and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| Int)) (or (forall ((v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| v_ArrVal_1144) |c_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base|) 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34|) 0)))) (or (not (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base|) 0)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30| Int) (v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base| v_ArrVal_1144) |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30|) 0))))) .cse0) (or (and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34|) 0)) (forall ((v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| v_ArrVal_1144) |c_ULTIMATE.start_main_#t~ret16#1.base|) 0))))) (or (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30| Int) (v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_main_#t~ret16#1.base| v_ArrVal_1144) |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30|) 0))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_#t~ret16#1.base|) 0)))) .cse0) (or .cse0 (and (or .cse2 .cse11) .cse12)) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (< v_thread2Thread1of1ForFork1_~i~1_25 0) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse14 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse13 (store |c_#race| c_~A~0.base (store (store (store (store .cse10 (+ c_~A~0.offset .cse14) 0) (+ c_~A~0.offset 1 .cse14) 0) (+ c_~A~0.offset 2 .cse14) 0) (+ c_~A~0.offset 3 .cse14) 0)))) (store .cse13 c_~B~0.base (store (store (store (store (select .cse13 c_~B~0.base) (+ ~B~0.offset .cse14) v_ArrVal_1155) (+ ~B~0.offset 1 .cse14) 0) (+ 2 ~B~0.offset .cse14) 0) (+ 3 ~B~0.offset .cse14) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse15) 0)))) (or .cse0 (and .cse2 .cse16)) (or .cse0 (and (or (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30| Int) (v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_#res#1.base| v_ArrVal_1144) |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30|) 0))) (not (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_#res#1.base|) 0))) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34|) 0)) (forall ((v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| v_ArrVal_1144) |c_ULTIMATE.start_create_fresh_uint_array_#res#1.base|) 0))))))) (or (and (not (= |c_ULTIMATE.start_main_#t~ret20#1.base| c_~A~0.base)) .cse2) .cse0) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (< v_thread2Thread1of1ForFork1_~i~1_25 0) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= 0 (select (select (store (let ((.cse18 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse17 (store |c_#race| c_~A~0.base (store (store (store (store .cse10 (+ c_~A~0.offset .cse18) 0) (+ c_~A~0.offset 1 .cse18) 0) (+ c_~A~0.offset 2 .cse18) 0) (+ c_~A~0.offset 3 .cse18) 0)))) (store .cse17 c_~B~0.base (store (store (store (store (select .cse17 c_~B~0.base) (+ ~B~0.offset .cse18) v_ArrVal_1155) (+ ~B~0.offset 1 .cse18) 0) (+ 2 ~B~0.offset .cse18) 0) (+ 3 ~B~0.offset .cse18) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse19))))) (or .cse0 (and (or .cse1 .cse11) .cse12)) (or .cse0 (and (or .cse3 .cse11) .cse12)) (or (and (or .cse11 .cse16) .cse12) .cse0) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse21 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse20 (store |c_#race| c_~A~0.base (store (store (store (store .cse6 (+ c_~A~0.offset .cse21) 0) (+ c_~A~0.offset 1 .cse21) 0) (+ c_~A~0.offset 2 .cse21) 0) (+ c_~A~0.offset 3 .cse21) 0)))) (store .cse20 c_~B~0.base (store (store (store (store (select .cse20 c_~B~0.base) (+ ~B~0.offset .cse21) v_ArrVal_1155) (+ ~B~0.offset 1 .cse21) 0) (+ 2 ~B~0.offset .cse21) 0) (+ 3 ~B~0.offset .cse21) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse19) 0)) (< v_thread2Thread1of1ForFork1_~i~1_25 0))) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (< v_thread2Thread1of1ForFork1_~i~1_25 0) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse23 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse22 (store |c_#race| c_~A~0.base (store (store (store (store .cse10 (+ c_~A~0.offset .cse23) 0) (+ c_~A~0.offset 1 .cse23) 0) (+ c_~A~0.offset 2 .cse23) 0) (+ c_~A~0.offset 3 .cse23) 0)))) (store .cse22 c_~B~0.base (store (store (store (store (select .cse22 c_~B~0.base) (+ ~B~0.offset .cse23) v_ArrVal_1155) (+ ~B~0.offset 1 .cse23) 0) (+ 2 ~B~0.offset .cse23) 0) (+ 3 ~B~0.offset .cse23) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse24) 0)))) (or (and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34|) 0)) (forall ((v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| v_ArrVal_1144) |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 0))))) (or (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30| Int) (v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| v_ArrVal_1144) |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30|) 0))) (not (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 0)))) .cse0) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse26 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse25 (store |c_#race| c_~A~0.base (store (store (store (store .cse6 (+ c_~A~0.offset .cse26) 0) (+ c_~A~0.offset 1 .cse26) 0) (+ c_~A~0.offset 2 .cse26) 0) (+ c_~A~0.offset 3 .cse26) 0)))) (store .cse25 c_~B~0.base (store (store (store (store (select .cse25 c_~B~0.base) (+ ~B~0.offset .cse26) v_ArrVal_1155) (+ ~B~0.offset 1 .cse26) 0) (+ 2 ~B~0.offset .cse26) 0) (+ 3 ~B~0.offset .cse26) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse24) 0)) (< v_thread2Thread1of1ForFork1_~i~1_25 0))) (or .cse0 (and (or .cse11 (not (= |c_ULTIMATE.start_main_#t~ret18#1.base| c_~A~0.base))) .cse12)) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse28 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse27 (store |c_#race| c_~A~0.base (store (store (store (store .cse6 (+ c_~A~0.offset .cse28) 0) (+ c_~A~0.offset 1 .cse28) 0) (+ c_~A~0.offset 2 .cse28) 0) (+ c_~A~0.offset 3 .cse28) 0)))) (store .cse27 c_~B~0.base (store (store (store (store (select .cse27 c_~B~0.base) (+ ~B~0.offset .cse28) v_ArrVal_1155) (+ ~B~0.offset 1 .cse28) 0) (+ 2 ~B~0.offset .cse28) 0) (+ 3 ~B~0.offset .cse28) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse15) 0)) (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (< v_thread2Thread1of1ForFork1_~i~1_25 0))))))) is different from true [2023-12-02 20:49:34,101 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse30 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse7 (select |c_#race| c_~A~0.base)) (.cse20 (+ c_~A~0.offset 3 .cse30))) (let ((.cse8 (+ c_~A~0.offset .cse30)) (.cse0 (<= (+ c_~N~0 1) 0)) (.cse3 (not (= c_~B~0.base c_~A~0.base))) (.cse2 (not (= |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| c_~A~0.base))) (.cse4 (not (= |c_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base| c_~A~0.base))) (.cse17 (not (= c_~A~0.base |c_ULTIMATE.start_create_fresh_uint_array_#res#1.base|))) (.cse11 (store .cse7 .cse20 0)) (.cse25 (+ c_~A~0.offset .cse30 1)) (.cse1 (< c_~N~0 1)) (.cse12 (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30|) 0)))) (.cse13 (not (= (select |c_#valid| c_~A~0.base) 0))) (.cse16 (+ c_~A~0.offset 2 .cse30))) (and (<= c_~N~0 2) (<= c_~N~0 |c_ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (or (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (and .cse0 (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))) (or .cse1 (and .cse2 .cse3)) (or (and .cse4 .cse3) .cse1) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse6 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse5 (store |c_#race| c_~A~0.base (store (store (store (store .cse7 (+ c_~A~0.offset .cse6) 0) (+ c_~A~0.offset 1 .cse6) 0) (+ c_~A~0.offset 2 .cse6) 0) (+ c_~A~0.offset 3 .cse6) 0)))) (store .cse5 c_~B~0.base (store (store (store (store (select .cse5 c_~B~0.base) (+ ~B~0.offset .cse6) v_ArrVal_1155) (+ ~B~0.offset 1 .cse6) 0) (+ 2 ~B~0.offset .cse6) 0) (+ 3 ~B~0.offset .cse6) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse8) 0)) (< v_thread2Thread1of1ForFork1_~i~1_25 0))) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (< v_thread2Thread1of1ForFork1_~i~1_25 0) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= 0 (select (select (store (let ((.cse10 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse9 (store |c_#race| c_~A~0.base (store (store (store (store .cse11 (+ c_~A~0.offset .cse10) 0) (+ c_~A~0.offset 1 .cse10) 0) (+ c_~A~0.offset 2 .cse10) 0) (+ c_~A~0.offset 3 .cse10) 0)))) (store .cse9 c_~B~0.base (store (store (store (store (select .cse9 c_~B~0.base) (+ ~B~0.offset .cse10) v_ArrVal_1155) (+ ~B~0.offset 1 .cse10) 0) (+ 2 ~B~0.offset .cse10) 0) (+ 3 ~B~0.offset .cse10) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse8))))) (or (and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| Int)) (or (forall ((v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| v_ArrVal_1144) |c_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base|) 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34|) 0)))) (or (not (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base|) 0)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30| Int) (v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base| v_ArrVal_1144) |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30|) 0))))) .cse1) (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (and .cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0))) (or (and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34|) 0)) (forall ((v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| v_ArrVal_1144) |c_ULTIMATE.start_main_#t~ret16#1.base|) 0))))) (or (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30| Int) (v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_main_#t~ret16#1.base| v_ArrVal_1144) |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30|) 0))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_#t~ret16#1.base|) 0)))) .cse1) (or .cse1 (and (or .cse3 .cse12) .cse13)) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (< v_thread2Thread1of1ForFork1_~i~1_25 0) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse15 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse14 (store |c_#race| c_~A~0.base (store (store (store (store .cse11 (+ c_~A~0.offset .cse15) 0) (+ c_~A~0.offset 1 .cse15) 0) (+ c_~A~0.offset 2 .cse15) 0) (+ c_~A~0.offset 3 .cse15) 0)))) (store .cse14 c_~B~0.base (store (store (store (store (select .cse14 c_~B~0.base) (+ ~B~0.offset .cse15) v_ArrVal_1155) (+ ~B~0.offset 1 .cse15) 0) (+ 2 ~B~0.offset .cse15) 0) (+ 3 ~B~0.offset .cse15) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse16) 0)))) (or .cse1 (and .cse3 .cse17)) (or .cse1 (and (or (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30| Int) (v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_#res#1.base| v_ArrVal_1144) |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30|) 0))) (not (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_#res#1.base|) 0))) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34|) 0)) (forall ((v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| v_ArrVal_1144) |c_ULTIMATE.start_create_fresh_uint_array_#res#1.base|) 0))))))) (or (and (not (= |c_ULTIMATE.start_main_#t~ret20#1.base| c_~A~0.base)) .cse3) .cse1) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (< v_thread2Thread1of1ForFork1_~i~1_25 0) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= 0 (select (select (store (let ((.cse19 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse18 (store |c_#race| c_~A~0.base (store (store (store (store .cse11 (+ c_~A~0.offset .cse19) 0) (+ c_~A~0.offset 1 .cse19) 0) (+ c_~A~0.offset 2 .cse19) 0) (+ c_~A~0.offset 3 .cse19) 0)))) (store .cse18 c_~B~0.base (store (store (store (store (select .cse18 c_~B~0.base) (+ ~B~0.offset .cse19) v_ArrVal_1155) (+ ~B~0.offset 1 .cse19) 0) (+ 2 ~B~0.offset .cse19) 0) (+ 3 ~B~0.offset .cse19) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse20))))) (or .cse1 (and (or .cse2 .cse12) .cse13)) (or .cse1 (and (or .cse4 .cse12) .cse13)) (or (and (or .cse12 .cse17) .cse13) .cse1) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse22 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse21 (store |c_#race| c_~A~0.base (store (store (store (store .cse7 (+ c_~A~0.offset .cse22) 0) (+ c_~A~0.offset 1 .cse22) 0) (+ c_~A~0.offset 2 .cse22) 0) (+ c_~A~0.offset 3 .cse22) 0)))) (store .cse21 c_~B~0.base (store (store (store (store (select .cse21 c_~B~0.base) (+ ~B~0.offset .cse22) v_ArrVal_1155) (+ ~B~0.offset 1 .cse22) 0) (+ 2 ~B~0.offset .cse22) 0) (+ 3 ~B~0.offset .cse22) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse20) 0)) (< v_thread2Thread1of1ForFork1_~i~1_25 0))) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (< v_thread2Thread1of1ForFork1_~i~1_25 0) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse24 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse23 (store |c_#race| c_~A~0.base (store (store (store (store .cse11 (+ c_~A~0.offset .cse24) 0) (+ c_~A~0.offset 1 .cse24) 0) (+ c_~A~0.offset 2 .cse24) 0) (+ c_~A~0.offset 3 .cse24) 0)))) (store .cse23 c_~B~0.base (store (store (store (store (select .cse23 c_~B~0.base) (+ ~B~0.offset .cse24) v_ArrVal_1155) (+ ~B~0.offset 1 .cse24) 0) (+ 2 ~B~0.offset .cse24) 0) (+ 3 ~B~0.offset .cse24) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse25) 0)))) (or (and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34|) 0)) (forall ((v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| v_ArrVal_1144) |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 0))))) (or (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30| Int) (v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| v_ArrVal_1144) |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30|) 0))) (not (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 0)))) .cse1) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse27 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse26 (store |c_#race| c_~A~0.base (store (store (store (store .cse7 (+ c_~A~0.offset .cse27) 0) (+ c_~A~0.offset 1 .cse27) 0) (+ c_~A~0.offset 2 .cse27) 0) (+ c_~A~0.offset 3 .cse27) 0)))) (store .cse26 c_~B~0.base (store (store (store (store (select .cse26 c_~B~0.base) (+ ~B~0.offset .cse27) v_ArrVal_1155) (+ ~B~0.offset 1 .cse27) 0) (+ 2 ~B~0.offset .cse27) 0) (+ 3 ~B~0.offset .cse27) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse25) 0)) (< v_thread2Thread1of1ForFork1_~i~1_25 0))) (or .cse1 (and (or .cse12 (not (= |c_ULTIMATE.start_main_#t~ret18#1.base| c_~A~0.base))) .cse13)) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse29 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse28 (store |c_#race| c_~A~0.base (store (store (store (store .cse7 (+ c_~A~0.offset .cse29) 0) (+ c_~A~0.offset 1 .cse29) 0) (+ c_~A~0.offset 2 .cse29) 0) (+ c_~A~0.offset 3 .cse29) 0)))) (store .cse28 c_~B~0.base (store (store (store (store (select .cse28 c_~B~0.base) (+ ~B~0.offset .cse29) v_ArrVal_1155) (+ ~B~0.offset 1 .cse29) 0) (+ 2 ~B~0.offset .cse29) 0) (+ 3 ~B~0.offset .cse29) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse16) 0)) (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (< v_thread2Thread1of1ForFork1_~i~1_25 0))) (<= c_~N~0 |c_ULTIMATE.start_create_fresh_uint_array_~size#1|))))) is different from true [2023-12-02 20:49:49,785 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse29 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse6 (select |c_#race| c_~A~0.base)) (.cse19 (+ c_~A~0.offset 3 .cse29))) (let ((.cse7 (+ c_~A~0.offset .cse29)) (.cse2 (not (= c_~B~0.base c_~A~0.base))) (.cse1 (not (= |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| c_~A~0.base))) (.cse3 (not (= |c_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base| c_~A~0.base))) (.cse16 (not (= c_~A~0.base |c_ULTIMATE.start_create_fresh_uint_array_#res#1.base|))) (.cse10 (store .cse6 .cse19 0)) (.cse24 (+ c_~A~0.offset .cse29 1)) (.cse0 (< c_~N~0 1)) (.cse11 (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30|) 0)))) (.cse12 (not (= (select |c_#valid| c_~A~0.base) 0))) (.cse15 (+ c_~A~0.offset 2 .cse29))) (and (= |c_ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= c_~N~0 2) (<= c_~N~0 |c_ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (or .cse0 (and .cse1 .cse2)) (or (and .cse3 .cse2) .cse0) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse5 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse4 (store |c_#race| c_~A~0.base (store (store (store (store .cse6 (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset 1 .cse5) 0) (+ c_~A~0.offset 2 .cse5) 0) (+ c_~A~0.offset 3 .cse5) 0)))) (store .cse4 c_~B~0.base (store (store (store (store (select .cse4 c_~B~0.base) (+ ~B~0.offset .cse5) v_ArrVal_1155) (+ ~B~0.offset 1 .cse5) 0) (+ 2 ~B~0.offset .cse5) 0) (+ 3 ~B~0.offset .cse5) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse7) 0)) (< v_thread2Thread1of1ForFork1_~i~1_25 0))) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (< v_thread2Thread1of1ForFork1_~i~1_25 0) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= 0 (select (select (store (let ((.cse9 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse8 (store |c_#race| c_~A~0.base (store (store (store (store .cse10 (+ c_~A~0.offset .cse9) 0) (+ c_~A~0.offset 1 .cse9) 0) (+ c_~A~0.offset 2 .cse9) 0) (+ c_~A~0.offset 3 .cse9) 0)))) (store .cse8 c_~B~0.base (store (store (store (store (select .cse8 c_~B~0.base) (+ ~B~0.offset .cse9) v_ArrVal_1155) (+ ~B~0.offset 1 .cse9) 0) (+ 2 ~B~0.offset .cse9) 0) (+ 3 ~B~0.offset .cse9) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse7))))) (or (and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| Int)) (or (forall ((v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| v_ArrVal_1144) |c_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base|) 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34|) 0)))) (or (not (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base|) 0)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30| Int) (v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base| v_ArrVal_1144) |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30|) 0))))) .cse0) (or (and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34|) 0)) (forall ((v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| v_ArrVal_1144) |c_ULTIMATE.start_main_#t~ret16#1.base|) 0))))) (or (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30| Int) (v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_main_#t~ret16#1.base| v_ArrVal_1144) |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30|) 0))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_#t~ret16#1.base|) 0)))) .cse0) (or .cse0 (and (or .cse2 .cse11) .cse12)) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (< v_thread2Thread1of1ForFork1_~i~1_25 0) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse14 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse13 (store |c_#race| c_~A~0.base (store (store (store (store .cse10 (+ c_~A~0.offset .cse14) 0) (+ c_~A~0.offset 1 .cse14) 0) (+ c_~A~0.offset 2 .cse14) 0) (+ c_~A~0.offset 3 .cse14) 0)))) (store .cse13 c_~B~0.base (store (store (store (store (select .cse13 c_~B~0.base) (+ ~B~0.offset .cse14) v_ArrVal_1155) (+ ~B~0.offset 1 .cse14) 0) (+ 2 ~B~0.offset .cse14) 0) (+ 3 ~B~0.offset .cse14) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse15) 0)))) (or .cse0 (and .cse2 .cse16)) (or .cse0 (and (or (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30| Int) (v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_#res#1.base| v_ArrVal_1144) |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30|) 0))) (not (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_#res#1.base|) 0))) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34|) 0)) (forall ((v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| v_ArrVal_1144) |c_ULTIMATE.start_create_fresh_uint_array_#res#1.base|) 0))))))) (or (and (not (= |c_ULTIMATE.start_main_#t~ret20#1.base| c_~A~0.base)) .cse2) .cse0) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (< v_thread2Thread1of1ForFork1_~i~1_25 0) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= 0 (select (select (store (let ((.cse18 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse17 (store |c_#race| c_~A~0.base (store (store (store (store .cse10 (+ c_~A~0.offset .cse18) 0) (+ c_~A~0.offset 1 .cse18) 0) (+ c_~A~0.offset 2 .cse18) 0) (+ c_~A~0.offset 3 .cse18) 0)))) (store .cse17 c_~B~0.base (store (store (store (store (select .cse17 c_~B~0.base) (+ ~B~0.offset .cse18) v_ArrVal_1155) (+ ~B~0.offset 1 .cse18) 0) (+ 2 ~B~0.offset .cse18) 0) (+ 3 ~B~0.offset .cse18) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse19))))) (or .cse0 (and (or .cse1 .cse11) .cse12)) (or .cse0 (and (or .cse3 .cse11) .cse12)) (or (and (or .cse11 .cse16) .cse12) .cse0) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse21 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse20 (store |c_#race| c_~A~0.base (store (store (store (store .cse6 (+ c_~A~0.offset .cse21) 0) (+ c_~A~0.offset 1 .cse21) 0) (+ c_~A~0.offset 2 .cse21) 0) (+ c_~A~0.offset 3 .cse21) 0)))) (store .cse20 c_~B~0.base (store (store (store (store (select .cse20 c_~B~0.base) (+ ~B~0.offset .cse21) v_ArrVal_1155) (+ ~B~0.offset 1 .cse21) 0) (+ 2 ~B~0.offset .cse21) 0) (+ 3 ~B~0.offset .cse21) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse19) 0)) (< v_thread2Thread1of1ForFork1_~i~1_25 0))) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (< v_thread2Thread1of1ForFork1_~i~1_25 0) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse23 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse22 (store |c_#race| c_~A~0.base (store (store (store (store .cse10 (+ c_~A~0.offset .cse23) 0) (+ c_~A~0.offset 1 .cse23) 0) (+ c_~A~0.offset 2 .cse23) 0) (+ c_~A~0.offset 3 .cse23) 0)))) (store .cse22 c_~B~0.base (store (store (store (store (select .cse22 c_~B~0.base) (+ ~B~0.offset .cse23) v_ArrVal_1155) (+ ~B~0.offset 1 .cse23) 0) (+ 2 ~B~0.offset .cse23) 0) (+ 3 ~B~0.offset .cse23) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse24) 0)))) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse26 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse25 (store |c_#race| c_~A~0.base (store (store (store (store .cse6 (+ c_~A~0.offset .cse26) 0) (+ c_~A~0.offset 1 .cse26) 0) (+ c_~A~0.offset 2 .cse26) 0) (+ c_~A~0.offset 3 .cse26) 0)))) (store .cse25 c_~B~0.base (store (store (store (store (select .cse25 c_~B~0.base) (+ ~B~0.offset .cse26) v_ArrVal_1155) (+ ~B~0.offset 1 .cse26) 0) (+ 2 ~B~0.offset .cse26) 0) (+ 3 ~B~0.offset .cse26) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse24) 0)) (< v_thread2Thread1of1ForFork1_~i~1_25 0))) (or .cse0 (and (or .cse11 (not (= |c_ULTIMATE.start_main_#t~ret18#1.base| c_~A~0.base))) .cse12)) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse28 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse27 (store |c_#race| c_~A~0.base (store (store (store (store .cse6 (+ c_~A~0.offset .cse28) 0) (+ c_~A~0.offset 1 .cse28) 0) (+ c_~A~0.offset 2 .cse28) 0) (+ c_~A~0.offset 3 .cse28) 0)))) (store .cse27 c_~B~0.base (store (store (store (store (select .cse27 c_~B~0.base) (+ ~B~0.offset .cse28) v_ArrVal_1155) (+ ~B~0.offset 1 .cse28) 0) (+ 2 ~B~0.offset .cse28) 0) (+ 3 ~B~0.offset .cse28) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse15) 0)) (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (< v_thread2Thread1of1ForFork1_~i~1_25 0))) (<= c_~N~0 |c_ULTIMATE.start_create_fresh_uint_array_~size#1|))))) is different from true [2023-12-02 20:50:57,441 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse31 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse21 (select |c_#valid| c_~A~0.base)) (.cse7 (select |c_#race| c_~A~0.base)) (.cse20 (+ c_~A~0.offset 3 .cse31))) (let ((.cse8 (+ c_~A~0.offset .cse31)) (.cse0 (<= (+ c_~N~0 1) 0)) (.cse3 (not (= c_~B~0.base c_~A~0.base))) (.cse2 (not (= |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| c_~A~0.base))) (.cse4 (not (= |c_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base| c_~A~0.base))) (.cse17 (not (= c_~A~0.base |c_ULTIMATE.start_create_fresh_uint_array_#res#1.base|))) (.cse11 (store .cse7 .cse20 0)) (.cse26 (+ c_~A~0.offset .cse31 1)) (.cse1 (< c_~N~0 1)) (.cse12 (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30|) 0)))) (.cse13 (not (= .cse21 0))) (.cse16 (+ c_~A~0.offset 2 .cse31))) (and (<= c_~N~0 2) (<= c_~N~0 |c_ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (or (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (and .cse0 (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))) (or .cse1 (and .cse2 .cse3)) (or (and .cse4 .cse3) .cse1) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse6 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse5 (store |c_#race| c_~A~0.base (store (store (store (store .cse7 (+ c_~A~0.offset .cse6) 0) (+ c_~A~0.offset 1 .cse6) 0) (+ c_~A~0.offset 2 .cse6) 0) (+ c_~A~0.offset 3 .cse6) 0)))) (store .cse5 c_~B~0.base (store (store (store (store (select .cse5 c_~B~0.base) (+ ~B~0.offset .cse6) v_ArrVal_1155) (+ ~B~0.offset 1 .cse6) 0) (+ 2 ~B~0.offset .cse6) 0) (+ 3 ~B~0.offset .cse6) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse8) 0)) (< v_thread2Thread1of1ForFork1_~i~1_25 0))) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (< v_thread2Thread1of1ForFork1_~i~1_25 0) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= 0 (select (select (store (let ((.cse10 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse9 (store |c_#race| c_~A~0.base (store (store (store (store .cse11 (+ c_~A~0.offset .cse10) 0) (+ c_~A~0.offset 1 .cse10) 0) (+ c_~A~0.offset 2 .cse10) 0) (+ c_~A~0.offset 3 .cse10) 0)))) (store .cse9 c_~B~0.base (store (store (store (store (select .cse9 c_~B~0.base) (+ ~B~0.offset .cse10) v_ArrVal_1155) (+ ~B~0.offset 1 .cse10) 0) (+ 2 ~B~0.offset .cse10) 0) (+ 3 ~B~0.offset .cse10) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse8))))) (or (and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| Int)) (or (forall ((v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| v_ArrVal_1144) |c_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base|) 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34|) 0)))) (or (not (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base|) 0)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30| Int) (v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base| v_ArrVal_1144) |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30|) 0))))) .cse1) (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (and .cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0))) (or (and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34|) 0)) (forall ((v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| v_ArrVal_1144) |c_ULTIMATE.start_main_#t~ret16#1.base|) 0))))) (or (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30| Int) (v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_main_#t~ret16#1.base| v_ArrVal_1144) |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30|) 0))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_#t~ret16#1.base|) 0)))) .cse1) (or .cse1 (and (or .cse3 .cse12) .cse13)) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (< v_thread2Thread1of1ForFork1_~i~1_25 0) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse15 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse14 (store |c_#race| c_~A~0.base (store (store (store (store .cse11 (+ c_~A~0.offset .cse15) 0) (+ c_~A~0.offset 1 .cse15) 0) (+ c_~A~0.offset 2 .cse15) 0) (+ c_~A~0.offset 3 .cse15) 0)))) (store .cse14 c_~B~0.base (store (store (store (store (select .cse14 c_~B~0.base) (+ ~B~0.offset .cse15) v_ArrVal_1155) (+ ~B~0.offset 1 .cse15) 0) (+ 2 ~B~0.offset .cse15) 0) (+ 3 ~B~0.offset .cse15) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse16) 0)))) (or .cse1 (and .cse3 .cse17)) (or .cse1 (and (or (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30| Int) (v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_#res#1.base| v_ArrVal_1144) |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30|) 0))) (not (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_#res#1.base|) 0))) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34|) 0)) (forall ((v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| v_ArrVal_1144) |c_ULTIMATE.start_create_fresh_uint_array_#res#1.base|) 0))))))) (or (and (not (= |c_ULTIMATE.start_main_#t~ret20#1.base| c_~A~0.base)) .cse3) .cse1) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (< v_thread2Thread1of1ForFork1_~i~1_25 0) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= 0 (select (select (store (let ((.cse19 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse18 (store |c_#race| c_~A~0.base (store (store (store (store .cse11 (+ c_~A~0.offset .cse19) 0) (+ c_~A~0.offset 1 .cse19) 0) (+ c_~A~0.offset 2 .cse19) 0) (+ c_~A~0.offset 3 .cse19) 0)))) (store .cse18 c_~B~0.base (store (store (store (store (select .cse18 c_~B~0.base) (+ ~B~0.offset .cse19) v_ArrVal_1155) (+ ~B~0.offset 1 .cse19) 0) (+ 2 ~B~0.offset .cse19) 0) (+ 3 ~B~0.offset .cse19) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse20))))) (or .cse1 (and (or .cse2 .cse12) .cse13)) (= .cse21 1) (or .cse1 (and (or .cse4 .cse12) .cse13)) (or (and (or .cse12 .cse17) .cse13) .cse1) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse23 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse22 (store |c_#race| c_~A~0.base (store (store (store (store .cse7 (+ c_~A~0.offset .cse23) 0) (+ c_~A~0.offset 1 .cse23) 0) (+ c_~A~0.offset 2 .cse23) 0) (+ c_~A~0.offset 3 .cse23) 0)))) (store .cse22 c_~B~0.base (store (store (store (store (select .cse22 c_~B~0.base) (+ ~B~0.offset .cse23) v_ArrVal_1155) (+ ~B~0.offset 1 .cse23) 0) (+ 2 ~B~0.offset .cse23) 0) (+ 3 ~B~0.offset .cse23) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse20) 0)) (< v_thread2Thread1of1ForFork1_~i~1_25 0))) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (< v_thread2Thread1of1ForFork1_~i~1_25 0) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse25 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse24 (store |c_#race| c_~A~0.base (store (store (store (store .cse11 (+ c_~A~0.offset .cse25) 0) (+ c_~A~0.offset 1 .cse25) 0) (+ c_~A~0.offset 2 .cse25) 0) (+ c_~A~0.offset 3 .cse25) 0)))) (store .cse24 c_~B~0.base (store (store (store (store (select .cse24 c_~B~0.base) (+ ~B~0.offset .cse25) v_ArrVal_1155) (+ ~B~0.offset 1 .cse25) 0) (+ 2 ~B~0.offset .cse25) 0) (+ 3 ~B~0.offset .cse25) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse26) 0)))) (or (and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34|) 0)) (forall ((v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| v_ArrVal_1144) |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 0))))) (or (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30| Int) (v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| v_ArrVal_1144) |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30|) 0))) (not (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 0)))) .cse1) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse28 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse27 (store |c_#race| c_~A~0.base (store (store (store (store .cse7 (+ c_~A~0.offset .cse28) 0) (+ c_~A~0.offset 1 .cse28) 0) (+ c_~A~0.offset 2 .cse28) 0) (+ c_~A~0.offset 3 .cse28) 0)))) (store .cse27 c_~B~0.base (store (store (store (store (select .cse27 c_~B~0.base) (+ ~B~0.offset .cse28) v_ArrVal_1155) (+ ~B~0.offset 1 .cse28) 0) (+ 2 ~B~0.offset .cse28) 0) (+ 3 ~B~0.offset .cse28) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse26) 0)) (< v_thread2Thread1of1ForFork1_~i~1_25 0))) (or .cse1 (and (or .cse12 (not (= |c_ULTIMATE.start_main_#t~ret18#1.base| c_~A~0.base))) .cse13)) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse30 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse29 (store |c_#race| c_~A~0.base (store (store (store (store .cse7 (+ c_~A~0.offset .cse30) 0) (+ c_~A~0.offset 1 .cse30) 0) (+ c_~A~0.offset 2 .cse30) 0) (+ c_~A~0.offset 3 .cse30) 0)))) (store .cse29 c_~B~0.base (store (store (store (store (select .cse29 c_~B~0.base) (+ ~B~0.offset .cse30) v_ArrVal_1155) (+ ~B~0.offset 1 .cse30) 0) (+ 2 ~B~0.offset .cse30) 0) (+ 3 ~B~0.offset .cse30) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse16) 0)) (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (< v_thread2Thread1of1ForFork1_~i~1_25 0))) (<= c_~N~0 |c_ULTIMATE.start_create_fresh_uint_array_~size#1|))))) is different from true [2023-12-02 20:51:12,139 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse30 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse20 (select |c_#valid| c_~A~0.base)) (.cse6 (select |c_#race| c_~A~0.base)) (.cse19 (+ c_~A~0.offset 3 .cse30))) (let ((.cse7 (+ c_~A~0.offset .cse30)) (.cse1 (not (= |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| c_~A~0.base))) (.cse2 (not (= c_~B~0.base c_~A~0.base))) (.cse3 (not (= |c_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base| c_~A~0.base))) (.cse16 (not (= c_~A~0.base |c_ULTIMATE.start_create_fresh_uint_array_#res#1.base|))) (.cse10 (store .cse6 .cse19 0)) (.cse25 (+ c_~A~0.offset .cse30 1)) (.cse0 (< c_~N~0 1)) (.cse11 (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30|) 0)))) (.cse12 (not (= .cse20 0))) (.cse15 (+ c_~A~0.offset 2 .cse30))) (and (= |c_ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= c_~N~0 2) (<= c_~N~0 |c_ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (or .cse0 (and .cse1 .cse2)) (or (and .cse3 .cse2) .cse0) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse5 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse4 (store |c_#race| c_~A~0.base (store (store (store (store .cse6 (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset 1 .cse5) 0) (+ c_~A~0.offset 2 .cse5) 0) (+ c_~A~0.offset 3 .cse5) 0)))) (store .cse4 c_~B~0.base (store (store (store (store (select .cse4 c_~B~0.base) (+ ~B~0.offset .cse5) v_ArrVal_1155) (+ ~B~0.offset 1 .cse5) 0) (+ 2 ~B~0.offset .cse5) 0) (+ 3 ~B~0.offset .cse5) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse7) 0)) (< v_thread2Thread1of1ForFork1_~i~1_25 0))) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (< v_thread2Thread1of1ForFork1_~i~1_25 0) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= 0 (select (select (store (let ((.cse9 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse8 (store |c_#race| c_~A~0.base (store (store (store (store .cse10 (+ c_~A~0.offset .cse9) 0) (+ c_~A~0.offset 1 .cse9) 0) (+ c_~A~0.offset 2 .cse9) 0) (+ c_~A~0.offset 3 .cse9) 0)))) (store .cse8 c_~B~0.base (store (store (store (store (select .cse8 c_~B~0.base) (+ ~B~0.offset .cse9) v_ArrVal_1155) (+ ~B~0.offset 1 .cse9) 0) (+ 2 ~B~0.offset .cse9) 0) (+ 3 ~B~0.offset .cse9) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse7))))) (or (and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| Int)) (or (forall ((v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| v_ArrVal_1144) |c_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base|) 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34|) 0)))) (or (not (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base|) 0)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30| Int) (v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base| v_ArrVal_1144) |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30|) 0))))) .cse0) (or (and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34|) 0)) (forall ((v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| v_ArrVal_1144) |c_ULTIMATE.start_main_#t~ret16#1.base|) 0))))) (or (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30| Int) (v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_main_#t~ret16#1.base| v_ArrVal_1144) |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30|) 0))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_#t~ret16#1.base|) 0)))) .cse0) (or .cse0 (and (or .cse2 .cse11) .cse12)) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (< v_thread2Thread1of1ForFork1_~i~1_25 0) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse14 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse13 (store |c_#race| c_~A~0.base (store (store (store (store .cse10 (+ c_~A~0.offset .cse14) 0) (+ c_~A~0.offset 1 .cse14) 0) (+ c_~A~0.offset 2 .cse14) 0) (+ c_~A~0.offset 3 .cse14) 0)))) (store .cse13 c_~B~0.base (store (store (store (store (select .cse13 c_~B~0.base) (+ ~B~0.offset .cse14) v_ArrVal_1155) (+ ~B~0.offset 1 .cse14) 0) (+ 2 ~B~0.offset .cse14) 0) (+ 3 ~B~0.offset .cse14) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse15) 0)))) (or .cse0 (and .cse2 .cse16)) .cse1 (or .cse0 (and (or (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30| Int) (v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_#res#1.base| v_ArrVal_1144) |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30|) 0))) (not (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_#res#1.base|) 0))) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34|) 0)) (forall ((v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| v_ArrVal_1144) |c_ULTIMATE.start_create_fresh_uint_array_#res#1.base|) 0))))))) (or (and (not (= |c_ULTIMATE.start_main_#t~ret20#1.base| c_~A~0.base)) .cse2) .cse0) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (< v_thread2Thread1of1ForFork1_~i~1_25 0) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= 0 (select (select (store (let ((.cse18 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse17 (store |c_#race| c_~A~0.base (store (store (store (store .cse10 (+ c_~A~0.offset .cse18) 0) (+ c_~A~0.offset 1 .cse18) 0) (+ c_~A~0.offset 2 .cse18) 0) (+ c_~A~0.offset 3 .cse18) 0)))) (store .cse17 c_~B~0.base (store (store (store (store (select .cse17 c_~B~0.base) (+ ~B~0.offset .cse18) v_ArrVal_1155) (+ ~B~0.offset 1 .cse18) 0) (+ 2 ~B~0.offset .cse18) 0) (+ 3 ~B~0.offset .cse18) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse19))))) (= .cse20 1) (or .cse0 (and (or .cse3 .cse11) .cse12)) (or (and (or .cse11 .cse16) .cse12) .cse0) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse22 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse21 (store |c_#race| c_~A~0.base (store (store (store (store .cse6 (+ c_~A~0.offset .cse22) 0) (+ c_~A~0.offset 1 .cse22) 0) (+ c_~A~0.offset 2 .cse22) 0) (+ c_~A~0.offset 3 .cse22) 0)))) (store .cse21 c_~B~0.base (store (store (store (store (select .cse21 c_~B~0.base) (+ ~B~0.offset .cse22) v_ArrVal_1155) (+ ~B~0.offset 1 .cse22) 0) (+ 2 ~B~0.offset .cse22) 0) (+ 3 ~B~0.offset .cse22) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse19) 0)) (< v_thread2Thread1of1ForFork1_~i~1_25 0))) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (< v_thread2Thread1of1ForFork1_~i~1_25 0) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse24 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse23 (store |c_#race| c_~A~0.base (store (store (store (store .cse10 (+ c_~A~0.offset .cse24) 0) (+ c_~A~0.offset 1 .cse24) 0) (+ c_~A~0.offset 2 .cse24) 0) (+ c_~A~0.offset 3 .cse24) 0)))) (store .cse23 c_~B~0.base (store (store (store (store (select .cse23 c_~B~0.base) (+ ~B~0.offset .cse24) v_ArrVal_1155) (+ ~B~0.offset 1 .cse24) 0) (+ 2 ~B~0.offset .cse24) 0) (+ 3 ~B~0.offset .cse24) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse25) 0)))) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse27 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse26 (store |c_#race| c_~A~0.base (store (store (store (store .cse6 (+ c_~A~0.offset .cse27) 0) (+ c_~A~0.offset 1 .cse27) 0) (+ c_~A~0.offset 2 .cse27) 0) (+ c_~A~0.offset 3 .cse27) 0)))) (store .cse26 c_~B~0.base (store (store (store (store (select .cse26 c_~B~0.base) (+ ~B~0.offset .cse27) v_ArrVal_1155) (+ ~B~0.offset 1 .cse27) 0) (+ 2 ~B~0.offset .cse27) 0) (+ 3 ~B~0.offset .cse27) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse25) 0)) (< v_thread2Thread1of1ForFork1_~i~1_25 0))) (or .cse0 (and (or .cse11 (not (= |c_ULTIMATE.start_main_#t~ret18#1.base| c_~A~0.base))) .cse12)) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse29 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse28 (store |c_#race| c_~A~0.base (store (store (store (store .cse6 (+ c_~A~0.offset .cse29) 0) (+ c_~A~0.offset 1 .cse29) 0) (+ c_~A~0.offset 2 .cse29) 0) (+ c_~A~0.offset 3 .cse29) 0)))) (store .cse28 c_~B~0.base (store (store (store (store (select .cse28 c_~B~0.base) (+ ~B~0.offset .cse29) v_ArrVal_1155) (+ ~B~0.offset 1 .cse29) 0) (+ 2 ~B~0.offset .cse29) 0) (+ 3 ~B~0.offset .cse29) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse15) 0)) (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (< v_thread2Thread1of1ForFork1_~i~1_25 0))) (<= c_~N~0 |c_ULTIMATE.start_create_fresh_uint_array_~size#1|))))) is different from true [2023-12-02 20:52:08,501 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse31 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse21 (select |c_#valid| c_~A~0.base)) (.cse7 (select |c_#race| c_~A~0.base)) (.cse18 (+ c_~A~0.offset 3 .cse31))) (let ((.cse8 (+ c_~A~0.offset .cse31)) (.cse0 (<= (+ c_~N~0 1) 0)) (.cse3 (not (= c_~B~0.base c_~A~0.base))) (.cse2 (not (= |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| c_~A~0.base))) (.cse4 (not (= |c_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base| c_~A~0.base))) (.cse15 (not (= c_~A~0.base |c_ULTIMATE.start_create_fresh_uint_array_#res#1.base|))) (.cse11 (store .cse7 .cse18 0)) (.cse26 (+ c_~A~0.offset .cse31 1)) (.cse1 (< c_~N~0 1)) (.cse19 (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30|) 0)))) (.cse20 (not (= .cse21 0))) (.cse14 (+ c_~A~0.offset 2 .cse31))) (and (<= c_~N~0 2) (<= c_~N~0 |c_ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (or (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (and .cse0 (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))) (or .cse1 (and .cse2 .cse3)) (or (and .cse4 .cse3) .cse1) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse6 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse5 (store |c_#race| c_~A~0.base (store (store (store (store .cse7 (+ c_~A~0.offset .cse6) 0) (+ c_~A~0.offset 1 .cse6) 0) (+ c_~A~0.offset 2 .cse6) 0) (+ c_~A~0.offset 3 .cse6) 0)))) (store .cse5 c_~B~0.base (store (store (store (store (select .cse5 c_~B~0.base) (+ ~B~0.offset .cse6) v_ArrVal_1155) (+ ~B~0.offset 1 .cse6) 0) (+ 2 ~B~0.offset .cse6) 0) (+ 3 ~B~0.offset .cse6) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse8) 0)) (< v_thread2Thread1of1ForFork1_~i~1_25 0))) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (< v_thread2Thread1of1ForFork1_~i~1_25 0) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= 0 (select (select (store (let ((.cse10 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse9 (store |c_#race| c_~A~0.base (store (store (store (store .cse11 (+ c_~A~0.offset .cse10) 0) (+ c_~A~0.offset 1 .cse10) 0) (+ c_~A~0.offset 2 .cse10) 0) (+ c_~A~0.offset 3 .cse10) 0)))) (store .cse9 c_~B~0.base (store (store (store (store (select .cse9 c_~B~0.base) (+ ~B~0.offset .cse10) v_ArrVal_1155) (+ ~B~0.offset 1 .cse10) 0) (+ 2 ~B~0.offset .cse10) 0) (+ 3 ~B~0.offset .cse10) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse8))))) (or (and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| Int)) (or (forall ((v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| v_ArrVal_1144) |c_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base|) 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34|) 0)))) (or (not (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base|) 0)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30| Int) (v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base| v_ArrVal_1144) |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30|) 0))))) .cse1) (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (and .cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0))) (or (and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34|) 0)) (forall ((v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| v_ArrVal_1144) |c_ULTIMATE.start_main_#t~ret16#1.base|) 0))))) (or (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30| Int) (v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_main_#t~ret16#1.base| v_ArrVal_1144) |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30|) 0))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_#t~ret16#1.base|) 0)))) .cse1) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (< v_thread2Thread1of1ForFork1_~i~1_25 0) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse13 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse12 (store |c_#race| c_~A~0.base (store (store (store (store .cse11 (+ c_~A~0.offset .cse13) 0) (+ c_~A~0.offset 1 .cse13) 0) (+ c_~A~0.offset 2 .cse13) 0) (+ c_~A~0.offset 3 .cse13) 0)))) (store .cse12 c_~B~0.base (store (store (store (store (select .cse12 c_~B~0.base) (+ ~B~0.offset .cse13) v_ArrVal_1155) (+ ~B~0.offset 1 .cse13) 0) (+ 2 ~B~0.offset .cse13) 0) (+ 3 ~B~0.offset .cse13) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse14) 0)))) (or .cse1 (and .cse3 .cse15)) (or .cse1 (and (or (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30| Int) (v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_#res#1.base| v_ArrVal_1144) |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30|) 0))) (not (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_#res#1.base|) 0))) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34|) 0)) (forall ((v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| v_ArrVal_1144) |c_ULTIMATE.start_create_fresh_uint_array_#res#1.base|) 0))))))) (or (and (not (= |c_ULTIMATE.start_main_#t~ret20#1.base| c_~A~0.base)) .cse3) .cse1) .cse3 (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (< v_thread2Thread1of1ForFork1_~i~1_25 0) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= 0 (select (select (store (let ((.cse17 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse16 (store |c_#race| c_~A~0.base (store (store (store (store .cse11 (+ c_~A~0.offset .cse17) 0) (+ c_~A~0.offset 1 .cse17) 0) (+ c_~A~0.offset 2 .cse17) 0) (+ c_~A~0.offset 3 .cse17) 0)))) (store .cse16 c_~B~0.base (store (store (store (store (select .cse16 c_~B~0.base) (+ ~B~0.offset .cse17) v_ArrVal_1155) (+ ~B~0.offset 1 .cse17) 0) (+ 2 ~B~0.offset .cse17) 0) (+ 3 ~B~0.offset .cse17) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse18))))) (or .cse1 (and (or .cse2 .cse19) .cse20)) (= .cse21 1) (or .cse1 (and (or .cse4 .cse19) .cse20)) (or (and (or .cse19 .cse15) .cse20) .cse1) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse23 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse22 (store |c_#race| c_~A~0.base (store (store (store (store .cse7 (+ c_~A~0.offset .cse23) 0) (+ c_~A~0.offset 1 .cse23) 0) (+ c_~A~0.offset 2 .cse23) 0) (+ c_~A~0.offset 3 .cse23) 0)))) (store .cse22 c_~B~0.base (store (store (store (store (select .cse22 c_~B~0.base) (+ ~B~0.offset .cse23) v_ArrVal_1155) (+ ~B~0.offset 1 .cse23) 0) (+ 2 ~B~0.offset .cse23) 0) (+ 3 ~B~0.offset .cse23) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse18) 0)) (< v_thread2Thread1of1ForFork1_~i~1_25 0))) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (< v_thread2Thread1of1ForFork1_~i~1_25 0) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse25 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse24 (store |c_#race| c_~A~0.base (store (store (store (store .cse11 (+ c_~A~0.offset .cse25) 0) (+ c_~A~0.offset 1 .cse25) 0) (+ c_~A~0.offset 2 .cse25) 0) (+ c_~A~0.offset 3 .cse25) 0)))) (store .cse24 c_~B~0.base (store (store (store (store (select .cse24 c_~B~0.base) (+ ~B~0.offset .cse25) v_ArrVal_1155) (+ ~B~0.offset 1 .cse25) 0) (+ 2 ~B~0.offset .cse25) 0) (+ 3 ~B~0.offset .cse25) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse26) 0)))) (or (and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34|) 0)) (forall ((v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| v_ArrVal_1144) |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 0))))) (or (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30| Int) (v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| v_ArrVal_1144) |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30|) 0))) (not (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 0)))) .cse1) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse28 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse27 (store |c_#race| c_~A~0.base (store (store (store (store .cse7 (+ c_~A~0.offset .cse28) 0) (+ c_~A~0.offset 1 .cse28) 0) (+ c_~A~0.offset 2 .cse28) 0) (+ c_~A~0.offset 3 .cse28) 0)))) (store .cse27 c_~B~0.base (store (store (store (store (select .cse27 c_~B~0.base) (+ ~B~0.offset .cse28) v_ArrVal_1155) (+ ~B~0.offset 1 .cse28) 0) (+ 2 ~B~0.offset .cse28) 0) (+ 3 ~B~0.offset .cse28) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse26) 0)) (< v_thread2Thread1of1ForFork1_~i~1_25 0))) (or .cse1 (and (or .cse19 (not (= |c_ULTIMATE.start_main_#t~ret18#1.base| c_~A~0.base))) .cse20)) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse30 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse29 (store |c_#race| c_~A~0.base (store (store (store (store .cse7 (+ c_~A~0.offset .cse30) 0) (+ c_~A~0.offset 1 .cse30) 0) (+ c_~A~0.offset 2 .cse30) 0) (+ c_~A~0.offset 3 .cse30) 0)))) (store .cse29 c_~B~0.base (store (store (store (store (select .cse29 c_~B~0.base) (+ ~B~0.offset .cse30) v_ArrVal_1155) (+ ~B~0.offset 1 .cse30) 0) (+ 2 ~B~0.offset .cse30) 0) (+ 3 ~B~0.offset .cse30) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse14) 0)) (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (< v_thread2Thread1of1ForFork1_~i~1_25 0))) (<= c_~N~0 |c_ULTIMATE.start_create_fresh_uint_array_~size#1|))))) is different from true [2023-12-02 20:52:19,617 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse29 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse17 (select |c_#valid| c_~A~0.base)) (.cse5 (select |c_#race| c_~A~0.base)) (.cse16 (+ c_~A~0.offset 3 .cse29))) (let ((.cse6 (+ c_~A~0.offset .cse29)) (.cse1 (not (= c_~B~0.base c_~A~0.base))) (.cse0 (not (= |c_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base| c_~A~0.base))) (.cse13 (not (= c_~A~0.base |c_ULTIMATE.start_create_fresh_uint_array_#res#1.base|))) (.cse9 (store .cse5 .cse16 0)) (.cse24 (+ c_~A~0.offset .cse29 1)) (.cse2 (< c_~N~0 1)) (.cse18 (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30|) 0)))) (.cse19 (not (= .cse17 0))) (.cse12 (+ c_~A~0.offset 2 .cse29))) (and (= |c_ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= c_~N~0 2) (<= c_~N~0 |c_ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (or (and .cse0 .cse1) .cse2) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse4 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse3 (store |c_#race| c_~A~0.base (store (store (store (store .cse5 (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset 1 .cse4) 0) (+ c_~A~0.offset 2 .cse4) 0) (+ c_~A~0.offset 3 .cse4) 0)))) (store .cse3 c_~B~0.base (store (store (store (store (select .cse3 c_~B~0.base) (+ ~B~0.offset .cse4) v_ArrVal_1155) (+ ~B~0.offset 1 .cse4) 0) (+ 2 ~B~0.offset .cse4) 0) (+ 3 ~B~0.offset .cse4) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse6) 0)) (< v_thread2Thread1of1ForFork1_~i~1_25 0))) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (< v_thread2Thread1of1ForFork1_~i~1_25 0) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= 0 (select (select (store (let ((.cse8 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse7 (store |c_#race| c_~A~0.base (store (store (store (store .cse9 (+ c_~A~0.offset .cse8) 0) (+ c_~A~0.offset 1 .cse8) 0) (+ c_~A~0.offset 2 .cse8) 0) (+ c_~A~0.offset 3 .cse8) 0)))) (store .cse7 c_~B~0.base (store (store (store (store (select .cse7 c_~B~0.base) (+ ~B~0.offset .cse8) v_ArrVal_1155) (+ ~B~0.offset 1 .cse8) 0) (+ 2 ~B~0.offset .cse8) 0) (+ 3 ~B~0.offset .cse8) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse6))))) (or (and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| Int)) (or (forall ((v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| v_ArrVal_1144) |c_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base|) 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34|) 0)))) (or (not (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base|) 0)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30| Int) (v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base| v_ArrVal_1144) |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30|) 0))))) .cse2) (or (and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34|) 0)) (forall ((v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| v_ArrVal_1144) |c_ULTIMATE.start_main_#t~ret16#1.base|) 0))))) (or (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30| Int) (v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_main_#t~ret16#1.base| v_ArrVal_1144) |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30|) 0))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_#t~ret16#1.base|) 0)))) .cse2) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (< v_thread2Thread1of1ForFork1_~i~1_25 0) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse11 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse10 (store |c_#race| c_~A~0.base (store (store (store (store .cse9 (+ c_~A~0.offset .cse11) 0) (+ c_~A~0.offset 1 .cse11) 0) (+ c_~A~0.offset 2 .cse11) 0) (+ c_~A~0.offset 3 .cse11) 0)))) (store .cse10 c_~B~0.base (store (store (store (store (select .cse10 c_~B~0.base) (+ ~B~0.offset .cse11) v_ArrVal_1155) (+ ~B~0.offset 1 .cse11) 0) (+ 2 ~B~0.offset .cse11) 0) (+ 3 ~B~0.offset .cse11) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse12) 0)))) (or .cse2 (and .cse1 .cse13)) (not (= |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| c_~A~0.base)) (or .cse2 (and (or (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30| Int) (v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_#res#1.base| v_ArrVal_1144) |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_30|) 0))) (not (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_#res#1.base|) 0))) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34|) 0)) (forall ((v_ArrVal_1144 Int)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc31#1.base_34| v_ArrVal_1144) |c_ULTIMATE.start_create_fresh_uint_array_#res#1.base|) 0))))))) (or (and (not (= |c_ULTIMATE.start_main_#t~ret20#1.base| c_~A~0.base)) .cse1) .cse2) .cse1 (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (< v_thread2Thread1of1ForFork1_~i~1_25 0) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= 0 (select (select (store (let ((.cse15 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse14 (store |c_#race| c_~A~0.base (store (store (store (store .cse9 (+ c_~A~0.offset .cse15) 0) (+ c_~A~0.offset 1 .cse15) 0) (+ c_~A~0.offset 2 .cse15) 0) (+ c_~A~0.offset 3 .cse15) 0)))) (store .cse14 c_~B~0.base (store (store (store (store (select .cse14 c_~B~0.base) (+ ~B~0.offset .cse15) v_ArrVal_1155) (+ ~B~0.offset 1 .cse15) 0) (+ 2 ~B~0.offset .cse15) 0) (+ 3 ~B~0.offset .cse15) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse16))))) (= .cse17 1) (or .cse2 (and (or .cse0 .cse18) .cse19)) (or (and (or .cse18 .cse13) .cse19) .cse2) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse21 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse20 (store |c_#race| c_~A~0.base (store (store (store (store .cse5 (+ c_~A~0.offset .cse21) 0) (+ c_~A~0.offset 1 .cse21) 0) (+ c_~A~0.offset 2 .cse21) 0) (+ c_~A~0.offset 3 .cse21) 0)))) (store .cse20 c_~B~0.base (store (store (store (store (select .cse20 c_~B~0.base) (+ ~B~0.offset .cse21) v_ArrVal_1155) (+ ~B~0.offset 1 .cse21) 0) (+ 2 ~B~0.offset .cse21) 0) (+ 3 ~B~0.offset .cse21) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse16) 0)) (< v_thread2Thread1of1ForFork1_~i~1_25 0))) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (< v_thread2Thread1of1ForFork1_~i~1_25 0) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse23 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse22 (store |c_#race| c_~A~0.base (store (store (store (store .cse9 (+ c_~A~0.offset .cse23) 0) (+ c_~A~0.offset 1 .cse23) 0) (+ c_~A~0.offset 2 .cse23) 0) (+ c_~A~0.offset 3 .cse23) 0)))) (store .cse22 c_~B~0.base (store (store (store (store (select .cse22 c_~B~0.base) (+ ~B~0.offset .cse23) v_ArrVal_1155) (+ ~B~0.offset 1 .cse23) 0) (+ 2 ~B~0.offset .cse23) 0) (+ 3 ~B~0.offset .cse23) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse24) 0)))) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse26 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse25 (store |c_#race| c_~A~0.base (store (store (store (store .cse5 (+ c_~A~0.offset .cse26) 0) (+ c_~A~0.offset 1 .cse26) 0) (+ c_~A~0.offset 2 .cse26) 0) (+ c_~A~0.offset 3 .cse26) 0)))) (store .cse25 c_~B~0.base (store (store (store (store (select .cse25 c_~B~0.base) (+ ~B~0.offset .cse26) v_ArrVal_1155) (+ ~B~0.offset 1 .cse26) 0) (+ 2 ~B~0.offset .cse26) 0) (+ 3 ~B~0.offset .cse26) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse24) 0)) (< v_thread2Thread1of1ForFork1_~i~1_25 0))) (or .cse2 (and (or .cse18 (not (= |c_ULTIMATE.start_main_#t~ret18#1.base| c_~A~0.base))) .cse19)) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse28 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse27 (store |c_#race| c_~A~0.base (store (store (store (store .cse5 (+ c_~A~0.offset .cse28) 0) (+ c_~A~0.offset 1 .cse28) 0) (+ c_~A~0.offset 2 .cse28) 0) (+ c_~A~0.offset 3 .cse28) 0)))) (store .cse27 c_~B~0.base (store (store (store (store (select .cse27 c_~B~0.base) (+ ~B~0.offset .cse28) v_ArrVal_1155) (+ ~B~0.offset 1 .cse28) 0) (+ 2 ~B~0.offset .cse28) 0) (+ 3 ~B~0.offset .cse28) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse12) 0)) (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (< v_thread2Thread1of1ForFork1_~i~1_25 0))) (<= c_~N~0 |c_ULTIMATE.start_create_fresh_uint_array_~size#1|))))) is different from true [2023-12-02 20:52:57,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:53:00,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:53:03,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:53:06,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:53:08,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:53:13,346 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse14 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse7 (select |c_#race| c_~A~0.base)) (.cse3 (+ c_~A~0.offset .cse14 1)) (.cse6 (+ c_~A~0.offset 2 .cse14)) (.cse13 (+ c_~A~0.offset 3 .cse14))) (let ((.cse8 (+ c_~A~0.offset .cse14)) (.cse2 (store (store (store .cse7 .cse3 0) .cse6 0) .cse13 0))) (and (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= 0 (select (select (store (let ((.cse1 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset 1 .cse1) 0) (+ c_~A~0.offset 2 .cse1) 0) (+ c_~A~0.offset 3 .cse1) 0)))) (store .cse0 c_~B~0.base (store (store (store (store (select .cse0 c_~B~0.base) (+ ~B~0.offset .cse1) v_ArrVal_1155) (+ ~B~0.offset 1 .cse1) 0) (+ 2 ~B~0.offset .cse1) 0) (+ 3 ~B~0.offset .cse1) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse3))) (< v_thread2Thread1of1ForFork1_~i~1_25 0))) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse5 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse4 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset 1 .cse5) 0) (+ c_~A~0.offset 2 .cse5) 0) (+ c_~A~0.offset 3 .cse5) 0)))) (store .cse4 c_~B~0.base (store (store (store (store (select .cse4 c_~B~0.base) (+ ~B~0.offset .cse5) v_ArrVal_1155) (+ ~B~0.offset 1 .cse5) 0) (+ 2 ~B~0.offset .cse5) 0) (+ 3 ~B~0.offset .cse5) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse6) 0)) (< v_thread2Thread1of1ForFork1_~i~1_25 0))) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_#res#1.base|) 1) (= (select .cse7 .cse8) 0) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (< v_thread2Thread1of1ForFork1_~i~1_25 0) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse10 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse9 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse10) 0) (+ c_~A~0.offset 1 .cse10) 0) (+ c_~A~0.offset 2 .cse10) 0) (+ c_~A~0.offset 3 .cse10) 0)))) (store .cse9 c_~B~0.base (store (store (store (store (select .cse9 c_~B~0.base) (+ ~B~0.offset .cse10) v_ArrVal_1155) (+ ~B~0.offset 1 .cse10) 0) (+ 2 ~B~0.offset .cse10) 0) (+ 3 ~B~0.offset .cse10) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse8) 0)))) (not (= c_~C~0.base c_~A~0.base)) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse12 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse11 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse12) 0) (+ c_~A~0.offset 1 .cse12) 0) (+ c_~A~0.offset 2 .cse12) 0) (+ c_~A~0.offset 3 .cse12) 0)))) (store .cse11 c_~B~0.base (store (store (store (store (select .cse11 c_~B~0.base) (+ ~B~0.offset .cse12) v_ArrVal_1155) (+ ~B~0.offset 1 .cse12) 0) (+ 2 ~B~0.offset .cse12) 0) (+ 3 ~B~0.offset .cse12) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse13) 0)) (< v_thread2Thread1of1ForFork1_~i~1_25 0))) (not (= c_~B~0.base c_~A~0.base)) (= (select |c_#valid| c_~A~0.base) 1) (not (= c_~A~0.base |c_ULTIMATE.start_create_fresh_uint_array_#res#1.base|)))))) is different from true [2023-12-02 20:53:15,514 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse14 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse4 (select |c_#race| c_~A~0.base)) (.cse13 (+ c_~A~0.offset 2 .cse14)) (.cse7 (+ c_~A~0.offset 3 .cse14))) (let ((.cse3 (+ c_~A~0.offset .cse14)) (.cse10 (+ c_~A~0.offset .cse14 1)) (.cse2 (store (store .cse4 .cse13 0) .cse7 0))) (and (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (< v_thread2Thread1of1ForFork1_~i~1_25 0) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse1 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset 1 .cse1) 0) (+ c_~A~0.offset 2 .cse1) 0) (+ c_~A~0.offset 3 .cse1) 0)))) (store .cse0 c_~B~0.base (store (store (store (store (select .cse0 c_~B~0.base) (+ ~B~0.offset .cse1) v_ArrVal_1155) (+ ~B~0.offset 1 .cse1) 0) (+ 2 ~B~0.offset .cse1) 0) (+ 3 ~B~0.offset .cse1) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse3) 0)))) (= (select .cse4 .cse3) 0) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse6 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse5 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse6) 0) (+ c_~A~0.offset 1 .cse6) 0) (+ c_~A~0.offset 2 .cse6) 0) (+ c_~A~0.offset 3 .cse6) 0)))) (store .cse5 c_~B~0.base (store (store (store (store (select .cse5 c_~B~0.base) (+ ~B~0.offset .cse6) v_ArrVal_1155) (+ ~B~0.offset 1 .cse6) 0) (+ 2 ~B~0.offset .cse6) 0) (+ 3 ~B~0.offset .cse6) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse7) 0)) (< v_thread2Thread1of1ForFork1_~i~1_25 0))) (not (= c_~C~0.base c_~A~0.base)) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (< v_thread2Thread1of1ForFork1_~i~1_25 0) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse9 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse8 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse9) 0) (+ c_~A~0.offset 1 .cse9) 0) (+ c_~A~0.offset 2 .cse9) 0) (+ c_~A~0.offset 3 .cse9) 0)))) (store .cse8 c_~B~0.base (store (store (store (store (select .cse8 c_~B~0.base) (+ ~B~0.offset .cse9) v_ArrVal_1155) (+ ~B~0.offset 1 .cse9) 0) (+ 2 ~B~0.offset .cse9) 0) (+ 3 ~B~0.offset .cse9) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse10) 0)))) (= (select .cse4 .cse10) 0) (not (= c_~B~0.base c_~A~0.base)) (forall ((v_thread2Thread1of1ForFork1_~i~1_25 Int)) (or (< c_~N~0 (+ v_thread2Thread1of1ForFork1_~i~1_25 1)) (< v_thread2Thread1of1ForFork1_~i~1_25 0) (forall ((v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (~B~0.offset Int) (v_ArrVal_1152 (Array Int Int))) (= (select (select (store (let ((.cse12 (* v_thread2Thread1of1ForFork1_~i~1_25 4))) (let ((.cse11 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse12) 0) (+ c_~A~0.offset 1 .cse12) 0) (+ c_~A~0.offset 2 .cse12) 0) (+ c_~A~0.offset 3 .cse12) 0)))) (store .cse11 c_~B~0.base (store (store (store (store (select .cse11 c_~B~0.base) (+ ~B~0.offset .cse12) v_ArrVal_1155) (+ ~B~0.offset 1 .cse12) 0) (+ 2 ~B~0.offset .cse12) 0) (+ 3 ~B~0.offset .cse12) v_ArrVal_1156)))) c_~C~0.base v_ArrVal_1152) c_~A~0.base) .cse13) 0)))))))) is different from true [2023-12-02 20:53:17,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:53:19,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:53:21,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:53:23,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:53:25,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:53:28,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:53:30,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:53:32,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:53:34,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:53:36,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:53:38,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:53:40,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:53:42,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:53:44,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:53:46,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:53:48,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:53:51,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:53:53,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:53:55,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:53:57,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:53:59,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:54:01,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:54:03,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:54:05,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:54:07,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:54:09,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:54:17,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:54:19,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:54:21,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:54:23,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:54:25,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:54:27,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:54:29,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:54:31,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:54:33,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:54:35,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:54:37,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:54:39,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:54:41,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:54:43,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:54:46,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:54:47,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:54:48,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:54:50,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:54:52,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:54:54,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:54:55,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:54:57,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:55:00,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:55:02,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:55:04,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:55:06,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:55:09,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:55:11,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:55:12,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:55:14,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:55:17,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:55:19,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:55:21,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:55:23,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:55:25,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:55:27,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:55:29,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:55:31,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:55:33,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:55:35,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:55:37,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:55:39,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:55:41,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:55:43,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:55:45,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:55:47,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:55:49,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:55:52,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:55:54,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:55:56,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:55:58,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:56:00,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:56:02,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:56:04,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:56:06,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:56:08,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:56:10,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:56:12,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:56:14,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:56:17,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:56:19,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:56:21,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:56:23,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:56:25,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:56:27,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:56:29,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:56:31,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:56:33,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:56:36,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:56:38,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:56:40,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:56:42,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:56:44,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:56:46,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:56:48,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:56:50,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:56:52,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:56:54,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:56:56,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:56:58,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:57:00,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:57:02,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:57:04,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:57:06,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:57:08,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:57:10,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:57:12,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:57:14,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:57:16,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:57:18,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:57:20,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:57:22,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:57:24,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:57:26,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:57:28,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:57:30,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:57:32,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:57:34,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:57:35,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:57:38,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:57:40,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:57:42,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:57:49,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:57:51,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:57:53,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:57:55,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:57:57,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:57:59,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:58:01,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:58:03,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:58:05,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:58:05,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:58:05,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:58:05,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:58:05,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:58:05,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:58:05,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:58:05,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:58:05,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:58:05,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:58:05,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:58:05,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:58:05,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:58:05,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2023-12-02 20:58:05,991 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 20:58:06,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-02 20:58:06,187 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-12-02 20:58:06,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:58:06,188 INFO L85 PathProgramCache]: Analyzing trace with hash 655481194, now seen corresponding path program 1 times [2023-12-02 20:58:06,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:58:06,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970072662] [2023-12-02 20:58:06,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:58:06,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:58:06,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:58:07,602 INFO L134 CoverageAnalysis]: Checked inductivity of 883 backedges. 560 proven. 233 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2023-12-02 20:58:07,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:58:07,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970072662] [2023-12-02 20:58:07,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970072662] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:58:07,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524553308] [2023-12-02 20:58:07,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:58:07,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:58:07,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:58:07,604 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:58:07,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 20:58:07,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:58:07,939 INFO L262 TraceCheckSpWp]: Trace formula consists of 1484 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-02 20:58:07,947 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:58:08,855 INFO L134 CoverageAnalysis]: Checked inductivity of 883 backedges. 552 proven. 45 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2023-12-02 20:58:08,855 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:58:09,618 INFO L134 CoverageAnalysis]: Checked inductivity of 883 backedges. 552 proven. 45 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2023-12-02 20:58:09,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524553308] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:58:09,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:58:09,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 19, 19] total 50 [2023-12-02 20:58:09,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920824161] [2023-12-02 20:58:09,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:58:09,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-12-02 20:58:09,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:58:09,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-12-02 20:58:09,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=2089, Unknown=0, NotChecked=0, Total=2450 [2023-12-02 20:58:09,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:58:09,625 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:58:09,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 15.88) internal successors, (794), 50 states have internal predecessors, (794), 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:58:09,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:58:09,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:58:09,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:58:09,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:58:09,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:58:09,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:58:09,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:58:09,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:58:09,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:58:09,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:58:09,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:58:09,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:58:09,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 85 states. [2023-12-02 20:58:09,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:58:11,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:58:11,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:58:11,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:58:11,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:58:11,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:58:11,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:58:11,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:58:11,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:58:11,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:58:11,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:58:11,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:58:11,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:58:11,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2023-12-02 20:58:11,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-02 20:58:11,053 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 20:58:11,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-02 20:58:11,247 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-12-02 20:58:11,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:58:11,248 INFO L85 PathProgramCache]: Analyzing trace with hash 293156467, now seen corresponding path program 2 times [2023-12-02 20:58:11,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:58:11,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815094827] [2023-12-02 20:58:11,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:58:11,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:58:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:58:12,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 560 proven. 276 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2023-12-02 20:58:12,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:58:12,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815094827] [2023-12-02 20:58:12,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815094827] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:58:12,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466712505] [2023-12-02 20:58:12,735 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:58:12,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:58:12,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:58:12,736 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:58:12,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 20:58:12,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-02 20:58:12,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:58:12,998 INFO L262 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 55 conjunts are in the unsatisfiable core [2023-12-02 20:58:13,010 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:58:13,015 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:58:13,250 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 20:58:13,251 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:58:13,793 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-12-02 20:58:13,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-12-02 20:58:15,441 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-02 20:58:15,496 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 28 treesize of output 27 [2023-12-02 20:58:15,560 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:58:15,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2023-12-02 20:58:15,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:58:15,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 52 treesize of output 57 [2023-12-02 20:58:15,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:58:15,824 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 95 treesize of output 81 [2023-12-02 20:58:15,905 INFO L349 Elim1Store]: treesize reduction 83, result has 36.6 percent of original size [2023-12-02 20:58:15,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 76 treesize of output 107 [2023-12-02 20:58:16,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 984 trivial. 0 not checked. [2023-12-02 20:58:16,013 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:58:16,137 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_thread1Thread1of1ForFork0_~i~0 4))) (and (forall ((v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2276 (Array Int Int)) (thread2Thread1of1ForFork1_~i~1 Int)) (= (select (select (store (let ((.cse0 (store |c_#race| c_~A~0.base v_ArrVal_2277))) (store .cse0 c_~B~0.base (let ((.cse1 (* thread2Thread1of1ForFork1_~i~1 4))) (store (store (store (store (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset) 0) (+ .cse1 c_~B~0.offset 1) 0) (+ 2 .cse1 c_~B~0.offset) 0) (+ 3 .cse1 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_2276) c_~B~0.base) (+ .cse2 c_~B~0.offset 1)) 0)) (forall ((v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2276 (Array Int Int)) (thread2Thread1of1ForFork1_~i~1 Int)) (= (select (select (store (let ((.cse3 (store |c_#race| c_~A~0.base v_ArrVal_2277))) (store .cse3 c_~B~0.base (let ((.cse4 (* thread2Thread1of1ForFork1_~i~1 4))) (store (store (store (store (select .cse3 c_~B~0.base) (+ .cse4 c_~B~0.offset) 0) (+ .cse4 c_~B~0.offset 1) 0) (+ 2 .cse4 c_~B~0.offset) 0) (+ 3 .cse4 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_2276) c_~B~0.base) (+ .cse2 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2276 (Array Int Int)) (thread2Thread1of1ForFork1_~i~1 Int)) (= (select (select (store (let ((.cse5 (store |c_#race| c_~A~0.base v_ArrVal_2277))) (store .cse5 c_~B~0.base (let ((.cse6 (* thread2Thread1of1ForFork1_~i~1 4))) (store (store (store (store (select .cse5 c_~B~0.base) (+ .cse6 c_~B~0.offset) 0) (+ .cse6 c_~B~0.offset 1) 0) (+ 2 .cse6 c_~B~0.offset) 0) (+ 3 .cse6 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_2276) c_~B~0.base) (+ 3 .cse2 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2276 (Array Int Int)) (thread2Thread1of1ForFork1_~i~1 Int)) (= (select (select (store (let ((.cse7 (store |c_#race| c_~A~0.base v_ArrVal_2277))) (store .cse7 c_~B~0.base (let ((.cse8 (* thread2Thread1of1ForFork1_~i~1 4))) (store (store (store (store (select .cse7 c_~B~0.base) (+ .cse8 c_~B~0.offset) 0) (+ .cse8 c_~B~0.offset 1) 0) (+ 2 .cse8 c_~B~0.offset) 0) (+ 3 .cse8 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_2276) c_~B~0.base) (+ 2 .cse2 c_~B~0.offset)) 0)))) is different from false [2023-12-02 20:58:16,257 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse2 (+ 3 .cse4 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse2 0)))) (and (forall ((v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2276 (Array Int Int)) (thread2Thread1of1ForFork1_~i~1 Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_2277) c_~B~0.base (let ((.cse1 (* thread2Thread1of1ForFork1_~i~1 4))) (store (store (store (store (select (store .cse0 c_~A~0.base v_ArrVal_2277) c_~B~0.base) (+ .cse1 c_~B~0.offset) 0) (+ .cse1 c_~B~0.offset 1) 0) (+ 2 .cse1 c_~B~0.offset) 0) (+ 3 .cse1 c_~B~0.offset) 0))) c_~C~0.base v_ArrVal_2276) c_~B~0.base) .cse2) 0)) (forall ((v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2276 (Array Int Int)) (thread2Thread1of1ForFork1_~i~1 Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_2277) c_~B~0.base (let ((.cse3 (* thread2Thread1of1ForFork1_~i~1 4))) (store (store (store (store (select (store .cse0 c_~A~0.base v_ArrVal_2277) c_~B~0.base) (+ .cse3 c_~B~0.offset) 0) (+ .cse3 c_~B~0.offset 1) 0) (+ 2 .cse3 c_~B~0.offset) 0) (+ 3 .cse3 c_~B~0.offset) 0))) c_~C~0.base v_ArrVal_2276) c_~B~0.base) (+ .cse4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2276 (Array Int Int)) (thread2Thread1of1ForFork1_~i~1 Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_2277) c_~B~0.base (let ((.cse5 (* thread2Thread1of1ForFork1_~i~1 4))) (store (store (store (store (select (store .cse0 c_~A~0.base v_ArrVal_2277) c_~B~0.base) (+ .cse5 c_~B~0.offset) 0) (+ .cse5 c_~B~0.offset 1) 0) (+ 2 .cse5 c_~B~0.offset) 0) (+ 3 .cse5 c_~B~0.offset) 0))) c_~C~0.base v_ArrVal_2276) c_~B~0.base) (+ 2 .cse4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2276 (Array Int Int)) (thread2Thread1of1ForFork1_~i~1 Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_2277) c_~B~0.base (let ((.cse6 (* thread2Thread1of1ForFork1_~i~1 4))) (store (store (store (store (select (store .cse0 c_~A~0.base v_ArrVal_2277) c_~B~0.base) (+ .cse6 c_~B~0.offset) 0) (+ .cse6 c_~B~0.offset 1) 0) (+ 2 .cse6 c_~B~0.offset) 0) (+ 3 .cse6 c_~B~0.offset) 0))) c_~C~0.base v_ArrVal_2276) c_~B~0.base) (+ .cse4 c_~B~0.offset 1)) 0)))))) is different from false [2023-12-02 20:58:16,285 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse7 (+ 2 .cse2 c_~B~0.offset)) (.cse4 (+ 3 .cse2 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (store (select |c_#race| c_~B~0.base) .cse7 0) .cse4 0)))) (and (forall ((v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2276 (Array Int Int)) (thread2Thread1of1ForFork1_~i~1 Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_2277) c_~B~0.base (let ((.cse1 (* thread2Thread1of1ForFork1_~i~1 4))) (store (store (store (store (select (store .cse0 c_~A~0.base v_ArrVal_2277) c_~B~0.base) (+ .cse1 c_~B~0.offset) 0) (+ .cse1 c_~B~0.offset 1) 0) (+ 2 .cse1 c_~B~0.offset) 0) (+ 3 .cse1 c_~B~0.offset) 0))) c_~C~0.base v_ArrVal_2276) c_~B~0.base) (+ .cse2 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2276 (Array Int Int)) (thread2Thread1of1ForFork1_~i~1 Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_2277) c_~B~0.base (let ((.cse3 (* thread2Thread1of1ForFork1_~i~1 4))) (store (store (store (store (select (store .cse0 c_~A~0.base v_ArrVal_2277) c_~B~0.base) (+ .cse3 c_~B~0.offset) 0) (+ .cse3 c_~B~0.offset 1) 0) (+ 2 .cse3 c_~B~0.offset) 0) (+ 3 .cse3 c_~B~0.offset) 0))) c_~C~0.base v_ArrVal_2276) c_~B~0.base) .cse4) 0)) (forall ((v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2276 (Array Int Int)) (thread2Thread1of1ForFork1_~i~1 Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_2277) c_~B~0.base (let ((.cse5 (* thread2Thread1of1ForFork1_~i~1 4))) (store (store (store (store (select (store .cse0 c_~A~0.base v_ArrVal_2277) c_~B~0.base) (+ .cse5 c_~B~0.offset) 0) (+ .cse5 c_~B~0.offset 1) 0) (+ 2 .cse5 c_~B~0.offset) 0) (+ 3 .cse5 c_~B~0.offset) 0))) c_~C~0.base v_ArrVal_2276) c_~B~0.base) (+ .cse2 c_~B~0.offset 1)) 0)) (forall ((v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2276 (Array Int Int)) (thread2Thread1of1ForFork1_~i~1 Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_2277) c_~B~0.base (let ((.cse6 (* thread2Thread1of1ForFork1_~i~1 4))) (store (store (store (store (select (store .cse0 c_~A~0.base v_ArrVal_2277) c_~B~0.base) (+ .cse6 c_~B~0.offset) 0) (+ .cse6 c_~B~0.offset 1) 0) (+ 2 .cse6 c_~B~0.offset) 0) (+ 3 .cse6 c_~B~0.offset) 0))) c_~C~0.base v_ArrVal_2276) c_~B~0.base) .cse7) 0)))))) is different from false [2023-12-02 20:58:16,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:58:16,922 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 102 treesize of output 117 [2023-12-02 20:58:16,926 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 151 treesize of output 141 [2023-12-02 20:58:16,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 85 [2023-12-02 20:58:16,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2023-12-02 20:58:16,939 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 14 treesize of output 7 [2023-12-02 20:58:16,947 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:58:16,947 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:58:16,952 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2023-12-02 20:58:16,952 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 81 treesize of output 1 [2023-12-02 20:58:16,954 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:58:16,955 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:58:16,960 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2023-12-02 20:58:16,960 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 82 treesize of output 1 [2023-12-02 20:58:16,963 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:58:16,963 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:58:16,969 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2023-12-02 20:58:16,969 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 82 treesize of output 1 [2023-12-02 20:58:19,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 6 refuted. 6 times theorem prover too weak. 984 trivial. 16 not checked. [2023-12-02 20:58:19,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466712505] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:58:19,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:58:19,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21, 21] total 67 [2023-12-02 20:58:19,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982815021] [2023-12-02 20:58:19,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:58:19,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2023-12-02 20:58:19,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:58:19,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2023-12-02 20:58:19,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=3777, Unknown=35, NotChecked=378, Total=4422 [2023-12-02 20:58:19,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:58:19,458 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:58:19,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 14.044776119402986) internal successors, (941), 67 states have internal predecessors, (941), 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:58:19,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:58:19,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:58:19,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:58:19,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:58:19,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:58:19,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:58:19,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:58:19,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:58:19,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:58:19,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:58:19,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:58:19,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:58:19,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 85 states. [2023-12-02 20:58:19,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-12-02 20:58:19,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:58:42,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:58:44,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:58:49,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:58:51,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:58:56,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:59:11,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:59:13,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:59:14,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:59:18,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:59:20,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:59:22,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:59:23,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:59:25,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:59:27,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:59:29,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:59:30,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:59:34,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:59:39,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:59:40,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:59:42,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:59:46,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:59:46,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:59:46,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:59:46,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:59:46,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:59:46,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:59:46,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:59:46,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:59:46,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:59:46,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:59:46,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:59:46,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:59:46,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:59:46,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2023-12-02 20:59:46,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-02 20:59:46,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2023-12-02 20:59:46,971 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 20:59:47,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-02 20:59:47,167 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-12-02 20:59:47,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:59:47,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1340069435, now seen corresponding path program 1 times [2023-12-02 20:59:47,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:59:47,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881686262] [2023-12-02 20:59:47,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:59:47,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:59:47,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:59:50,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2339 backedges. 1562 proven. 481 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2023-12-02 20:59:50,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:59:50,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881686262] [2023-12-02 20:59:50,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881686262] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:59:50,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816809712] [2023-12-02 20:59:50,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:59:50,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:59:50,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:59:50,089 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:59:50,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 20:59:50,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:59:50,587 INFO L262 TraceCheckSpWp]: Trace formula consists of 2297 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-02 20:59:50,596 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:59:52,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2339 backedges. 1410 proven. 145 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2023-12-02 20:59:52,042 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:59:53,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2339 backedges. 1410 proven. 145 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2023-12-02 20:59:53,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816809712] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:59:53,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:59:53,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 27, 27] total 74 [2023-12-02 20:59:53,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840175423] [2023-12-02 20:59:53,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:59:53,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2023-12-02 20:59:53,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:59:53,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2023-12-02 20:59:53,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=725, Invalid=4677, Unknown=0, NotChecked=0, Total=5402 [2023-12-02 20:59:53,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:59:53,290 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:59:53,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 15.608108108108109) internal successors, (1155), 74 states have internal predecessors, (1155), 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:59:53,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:59:53,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:59:53,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:59:53,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:59:53,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:59:53,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:59:53,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:59:53,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:59:53,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:59:53,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:59:53,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:59:53,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:59:53,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 89 states. [2023-12-02 20:59:53,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-12-02 20:59:53,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 96 states. [2023-12-02 20:59:53,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:59:55,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:59:55,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:59:55,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:59:55,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:59:55,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:59:55,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:59:55,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:59:55,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:59:55,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:59:55,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:59:55,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:59:55,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:59:55,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2023-12-02 20:59:55,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-02 20:59:55,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2023-12-02 20:59:55,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-02 20:59:55,471 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 20:59:55,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-02 20:59:55,665 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-12-02 20:59:55,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:59:55,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1659934354, now seen corresponding path program 2 times [2023-12-02 20:59:55,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:59:55,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748644473] [2023-12-02 20:59:55,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:59:55,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:59:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:59:58,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2552 backedges. 1562 proven. 552 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2023-12-02 20:59:58,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:59:58,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748644473] [2023-12-02 20:59:58,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748644473] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:59:58,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793708603] [2023-12-02 20:59:58,512 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:59:58,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:59:58,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:59:58,513 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:59:58,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5273826-5ad2-407e-a3b8-6b0915f9518a/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 20:59:58,892 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-02 20:59:58,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:59:58,895 INFO L262 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 54 conjunts are in the unsatisfiable core [2023-12-02 20:59:58,909 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:59:58,912 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:59:59,302 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-02 20:59:59,302 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 16 [2023-12-02 20:59:59,954 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:59:59,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 21:00:01,636 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-02 21:00:01,683 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 28 treesize of output 27 [2023-12-02 21:00:01,790 INFO L349 Elim1Store]: treesize reduction 41, result has 36.9 percent of original size [2023-12-02 21:00:01,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 90 [2023-12-02 21:00:01,795 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 84 treesize of output 64 [2023-12-02 21:00:01,826 INFO L349 Elim1Store]: treesize reduction 41, result has 36.9 percent of original size [2023-12-02 21:00:01,827 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 3 case distinctions, treesize of input 68 treesize of output 85 [2023-12-02 21:00:01,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 64 [2023-12-02 21:00:03,940 INFO L349 Elim1Store]: treesize reduction 38, result has 24.0 percent of original size [2023-12-02 21:00:03,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 87 treesize of output 101 [2023-12-02 21:00:04,085 INFO L349 Elim1Store]: treesize reduction 46, result has 20.7 percent of original size [2023-12-02 21:00:04,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 22 case distinctions, treesize of input 99 treesize of output 116 [2023-12-02 21:00:04,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2552 backedges. 22 proven. 30 refuted. 0 times theorem prover too weak. 2500 trivial. 0 not checked. [2023-12-02 21:00:04,225 INFO L327 TraceCheckSpWp]: Computing backward predicates...