./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/09-regions_26-alloc_region_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 4e7fbc69 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_6d0d96a7-3504-4c5e-8ed8-319ad3a14bb9/bin/ugemcutter-1C6z4D84am/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d0d96a7-3504-4c5e-8ed8-319ad3a14bb9/bin/ugemcutter-1C6z4D84am/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d0d96a7-3504-4c5e-8ed8-319ad3a14bb9/bin/ugemcutter-1C6z4D84am/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d0d96a7-3504-4c5e-8ed8-319ad3a14bb9/bin/ugemcutter-1C6z4D84am/config/GemCutterReach.xml -i ../../sv-benchmarks/c/goblint-regression/09-regions_26-alloc_region_rc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d0d96a7-3504-4c5e-8ed8-319ad3a14bb9/bin/ugemcutter-1C6z4D84am/config/svcomp-DataRace-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d0d96a7-3504-4c5e-8ed8-319ad3a14bb9/bin/ugemcutter-1C6z4D84am --witnessprinter.witness.filename witness.graphml --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 a98c974c803b808e0d7e2f56f44a4386aecc7f9a41003cc6d1be849c6b132112 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 06:44:02,161 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 06:44:02,164 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 06:44:02,204 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 06:44:02,205 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 06:44:02,208 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 06:44:02,210 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 06:44:02,213 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 06:44:02,215 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 06:44:02,219 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 06:44:02,221 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 06:44:02,222 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 06:44:02,223 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 06:44:02,225 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 06:44:02,227 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 06:44:02,229 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 06:44:02,230 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 06:44:02,231 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 06:44:02,232 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 06:44:02,238 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 06:44:02,239 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 06:44:02,241 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 06:44:02,242 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 06:44:02,243 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 06:44:02,251 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 06:44:02,253 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 06:44:02,253 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 06:44:02,255 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 06:44:02,256 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 06:44:02,258 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 06:44:02,259 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 06:44:02,260 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 06:44:02,262 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 06:44:02,262 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 06:44:02,263 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 06:44:02,263 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 06:44:02,264 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 06:44:02,264 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 06:44:02,264 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 06:44:02,265 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 06:44:02,266 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 06:44:02,266 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d0d96a7-3504-4c5e-8ed8-319ad3a14bb9/bin/ugemcutter-1C6z4D84am/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2022-11-23 06:44:02,305 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 06:44:02,316 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 06:44:02,317 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 06:44:02,317 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 06:44:02,318 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 06:44:02,319 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 06:44:02,319 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 06:44:02,320 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 06:44:02,320 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 06:44:02,320 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 06:44:02,321 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 06:44:02,321 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 06:44:02,322 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 06:44:02,322 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 06:44:02,322 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 06:44:02,322 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 06:44:02,323 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 06:44:02,323 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 06:44:02,323 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-23 06:44:02,323 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 06:44:02,324 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 06:44:02,324 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 06:44:02,324 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 06:44:02,324 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 06:44:02,325 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 06:44:02,325 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-23 06:44:02,325 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 06:44:02,325 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 06:44:02,326 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 06:44:02,326 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 06:44:02,327 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 06:44:02,327 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 06:44:02,327 INFO L138 SettingsManager]: * DFS Order used in POR=PSEUDO_LOCKSTEP [2022-11-23 06:44:02,327 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 06:44:02,328 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-23 06:44:02,328 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-11-23 06:44:02,328 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-23 06:44:02,328 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 06:44:02,329 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-23 06:44:02,329 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-23 06:44:02,329 INFO L138 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_6d0d96a7-3504-4c5e-8ed8-319ad3a14bb9/bin/ugemcutter-1C6z4D84am/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_6d0d96a7-3504-4c5e-8ed8-319ad3a14bb9/bin/ugemcutter-1C6z4D84am Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> a98c974c803b808e0d7e2f56f44a4386aecc7f9a41003cc6d1be849c6b132112 [2022-11-23 06:44:02,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 06:44:02,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 06:44:02,694 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 06:44:02,695 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 06:44:02,695 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 06:44:02,696 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d0d96a7-3504-4c5e-8ed8-319ad3a14bb9/bin/ugemcutter-1C6z4D84am/../../sv-benchmarks/c/goblint-regression/09-regions_26-alloc_region_rc.i [2022-11-23 06:44:05,695 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 06:44:05,967 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 06:44:05,968 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d0d96a7-3504-4c5e-8ed8-319ad3a14bb9/sv-benchmarks/c/goblint-regression/09-regions_26-alloc_region_rc.i [2022-11-23 06:44:05,984 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d0d96a7-3504-4c5e-8ed8-319ad3a14bb9/bin/ugemcutter-1C6z4D84am/data/046d701d0/404a1330a5bd4f94a6d87bdda6d9a734/FLAG013bbd77a [2022-11-23 06:44:05,998 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d0d96a7-3504-4c5e-8ed8-319ad3a14bb9/bin/ugemcutter-1C6z4D84am/data/046d701d0/404a1330a5bd4f94a6d87bdda6d9a734 [2022-11-23 06:44:06,000 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 06:44:06,002 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 06:44:06,003 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 06:44:06,003 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 06:44:06,009 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 06:44:06,010 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:44:05" (1/1) ... [2022-11-23 06:44:06,011 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@675242bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:44:06, skipping insertion in model container [2022-11-23 06:44:06,012 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:44:05" (1/1) ... [2022-11-23 06:44:06,020 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 06:44:06,087 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 06:44:06,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 06:44:06,802 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 06:44:06,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 06:44:06,966 INFO L208 MainTranslator]: Completed translation [2022-11-23 06:44:06,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:44:06 WrapperNode [2022-11-23 06:44:06,967 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 06:44:06,968 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 06:44:06,968 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 06:44:06,969 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 06:44:06,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:44:06" (1/1) ... [2022-11-23 06:44:06,998 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:44:06" (1/1) ... [2022-11-23 06:44:07,040 INFO L138 Inliner]: procedures = 370, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 236 [2022-11-23 06:44:07,040 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 06:44:07,041 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 06:44:07,041 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 06:44:07,041 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 06:44:07,051 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:44:06" (1/1) ... [2022-11-23 06:44:07,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:44:06" (1/1) ... [2022-11-23 06:44:07,058 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:44:06" (1/1) ... [2022-11-23 06:44:07,059 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:44:06" (1/1) ... [2022-11-23 06:44:07,081 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:44:06" (1/1) ... [2022-11-23 06:44:07,086 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:44:06" (1/1) ... [2022-11-23 06:44:07,088 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:44:06" (1/1) ... [2022-11-23 06:44:07,091 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:44:06" (1/1) ... [2022-11-23 06:44:07,095 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 06:44:07,098 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 06:44:07,099 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 06:44:07,099 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 06:44:07,102 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:44:06" (1/1) ... [2022-11-23 06:44:07,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 06:44:07,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d0d96a7-3504-4c5e-8ed8-319ad3a14bb9/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:44:07,149 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d0d96a7-3504-4c5e-8ed8-319ad3a14bb9/bin/ugemcutter-1C6z4D84am/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 06:44:07,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d0d96a7-3504-4c5e-8ed8-319ad3a14bb9/bin/ugemcutter-1C6z4D84am/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 06:44:07,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 06:44:07,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-23 06:44:07,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 06:44:07,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-23 06:44:07,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 06:44:07,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 06:44:07,202 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-23 06:44:07,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-23 06:44:07,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 06:44:07,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-23 06:44:07,203 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-23 06:44:07,203 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-23 06:44:07,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 06:44:07,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 06:44:07,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 06:44:07,206 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 06:44:07,457 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 06:44:07,459 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 06:44:08,141 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 06:44:08,152 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 06:44:08,167 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-23 06:44:08,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:44:08 BoogieIcfgContainer [2022-11-23 06:44:08,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 06:44:08,172 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 06:44:08,172 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 06:44:08,176 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 06:44:08,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 06:44:05" (1/3) ... [2022-11-23 06:44:08,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634fcb27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:44:08, skipping insertion in model container [2022-11-23 06:44:08,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:44:06" (2/3) ... [2022-11-23 06:44:08,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634fcb27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:44:08, skipping insertion in model container [2022-11-23 06:44:08,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:44:08" (3/3) ... [2022-11-23 06:44:08,179 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_26-alloc_region_rc.i [2022-11-23 06:44:08,187 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-23 06:44:08,213 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 06:44:08,226 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2022-11-23 06:44:08,226 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 06:44:08,346 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 06:44:08,419 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 06:44:08,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-23 06:44:08,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d0d96a7-3504-4c5e-8ed8-319ad3a14bb9/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:44:08,423 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d0d96a7-3504-4c5e-8ed8-319ad3a14bb9/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-23 06:44:08,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d0d96a7-3504-4c5e-8ed8-319ad3a14bb9/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-23 06:44:08,472 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-23 06:44:08,485 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2022-11-23 06:44:08,492 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=LoopsAndPotentialCycles, 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;@4f0fa4b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 06:44:08,493 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-23 06:44:09,056 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-23 06:44:09,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:44:09,061 INFO L85 PathProgramCache]: Analyzing trace with hash -689903079, now seen corresponding path program 1 times [2022-11-23 06:44:09,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:44:09,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52776641] [2022-11-23 06:44:09,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:44:09,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:44:09,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:44:10,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:44:10,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:44:10,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52776641] [2022-11-23 06:44:10,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52776641] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:44:10,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:44:10,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-23 06:44:10,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784402201] [2022-11-23 06:44:10,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:44:10,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-23 06:44:10,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:44:10,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-23 06:44:10,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-11-23 06:44:10,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:44:10,851 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:44:10,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 15 states have internal predecessors, (101), 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) [2022-11-23 06:44:10,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:44:11,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:44:11,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 06:44:11,600 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-23 06:44:11,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:44:11,603 INFO L85 PathProgramCache]: Analyzing trace with hash 583055201, now seen corresponding path program 1 times [2022-11-23 06:44:11,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:44:11,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275522411] [2022-11-23 06:44:11,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:44:11,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:44:11,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:44:12,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:44:12,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:44:12,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275522411] [2022-11-23 06:44:12,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275522411] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:44:12,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:44:12,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 06:44:12,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976517481] [2022-11-23 06:44:12,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:44:12,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 06:44:12,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:44:12,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 06:44:12,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-23 06:44:12,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:44:12,408 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:44:12,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.2) internal successors, (111), 6 states have internal predecessors, (111), 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) [2022-11-23 06:44:12,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:44:12,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:44:12,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:44:12,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:12,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 06:44:12,643 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-23 06:44:12,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:44:12,644 INFO L85 PathProgramCache]: Analyzing trace with hash 334279953, now seen corresponding path program 1 times [2022-11-23 06:44:12,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:44:12,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774351650] [2022-11-23 06:44:12,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:44:12,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:44:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:44:13,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:44:13,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:44:13,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774351650] [2022-11-23 06:44:13,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774351650] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:44:13,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:44:13,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 06:44:13,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891248660] [2022-11-23 06:44:13,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:44:13,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 06:44:13,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:44:13,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 06:44:13,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-23 06:44:13,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:44:13,373 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:44:13,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 25.2) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 06:44:13,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:44:13,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:13,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:44:13,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:44:13,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:13,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:13,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 06:44:13,509 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-23 06:44:13,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:44:13,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1731417837, now seen corresponding path program 1 times [2022-11-23 06:44:13,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:44:13,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729767137] [2022-11-23 06:44:13,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:44:13,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:44:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:44:14,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:44:14,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:44:14,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729767137] [2022-11-23 06:44:14,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729767137] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:44:14,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:44:14,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 06:44:14,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205399365] [2022-11-23 06:44:14,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:44:14,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 06:44:14,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:44:14,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 06:44:14,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-23 06:44:14,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:44:14,262 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:44:14,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 26.6) internal successors, (133), 6 states have internal predecessors, (133), 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) [2022-11-23 06:44:14,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:44:14,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:14,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:14,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:44:14,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:44:14,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:14,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:14,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:14,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 06:44:14,501 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-23 06:44:14,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:44:14,502 INFO L85 PathProgramCache]: Analyzing trace with hash 418336186, now seen corresponding path program 1 times [2022-11-23 06:44:14,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:44:14,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915271410] [2022-11-23 06:44:14,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:44:14,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:44:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:44:15,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:44:15,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:44:15,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915271410] [2022-11-23 06:44:15,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915271410] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:44:15,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:44:15,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 06:44:15,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484444851] [2022-11-23 06:44:15,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:44:15,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 06:44:15,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:44:15,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 06:44:15,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-23 06:44:15,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:44:15,174 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:44:15,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 28.4) internal successors, (142), 6 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) [2022-11-23 06:44:15,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:44:15,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:15,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:15,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:15,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:44:15,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:44:15,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:15,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:15,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:15,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:15,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 06:44:15,418 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-23 06:44:15,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:44:15,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1271442872, now seen corresponding path program 1 times [2022-11-23 06:44:15,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:44:15,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109829591] [2022-11-23 06:44:15,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:44:15,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:44:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:44:16,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:44:16,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:44:16,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109829591] [2022-11-23 06:44:16,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109829591] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:44:16,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:44:16,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 06:44:16,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357010641] [2022-11-23 06:44:16,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:44:16,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 06:44:16,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:44:16,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 06:44:16,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-23 06:44:16,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:44:16,084 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:44:16,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 30.6) internal successors, (153), 6 states have internal predecessors, (153), 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) [2022-11-23 06:44:16,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:44:16,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:16,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:16,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:16,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:16,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:44:16,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:44:16,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:16,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:16,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:16,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:16,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:16,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 06:44:16,311 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-23 06:44:16,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:44:16,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1149524413, now seen corresponding path program 1 times [2022-11-23 06:44:16,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:44:16,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002478126] [2022-11-23 06:44:16,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:44:16,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:44:16,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:44:17,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:44:17,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:44:17,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002478126] [2022-11-23 06:44:17,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002478126] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:44:17,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:44:17,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 06:44:17,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555402246] [2022-11-23 06:44:17,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:44:17,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 06:44:17,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:44:17,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 06:44:17,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-23 06:44:17,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:44:17,042 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:44:17,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 32.2) internal successors, (161), 6 states have internal predecessors, (161), 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) [2022-11-23 06:44:17,042 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:44:17,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:17,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:17,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:17,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:17,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:17,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:44:17,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:44:17,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:17,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:17,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:17,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:17,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:17,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:17,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 06:44:17,389 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-23 06:44:17,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:44:17,390 INFO L85 PathProgramCache]: Analyzing trace with hash -942355027, now seen corresponding path program 1 times [2022-11-23 06:44:17,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:44:17,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260431014] [2022-11-23 06:44:17,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:44:17,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:44:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:44:18,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:44:18,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:44:18,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260431014] [2022-11-23 06:44:18,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260431014] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:44:18,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:44:18,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-23 06:44:18,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791991479] [2022-11-23 06:44:18,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:44:18,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-23 06:44:18,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:44:18,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-23 06:44:18,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-11-23 06:44:18,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:44:18,225 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:44:18,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 8.357142857142858) internal successors, (117), 15 states have internal predecessors, (117), 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) [2022-11-23 06:44:18,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:44:18,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:18,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:18,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:18,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:18,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:18,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:18,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:44:19,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:44:19,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:19,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:19,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:19,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:19,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:19,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:19,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:44:19,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 06:44:19,411 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-23 06:44:19,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:44:19,411 INFO L85 PathProgramCache]: Analyzing trace with hash -889284346, now seen corresponding path program 1 times [2022-11-23 06:44:19,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:44:19,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223249116] [2022-11-23 06:44:19,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:44:19,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:44:19,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:44:19,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:44:19,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:44:19,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223249116] [2022-11-23 06:44:19,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223249116] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:44:19,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:44:19,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 06:44:19,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022892546] [2022-11-23 06:44:19,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:44:19,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 06:44:19,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:44:19,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 06:44:19,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 06:44:19,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:44:19,607 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:44:19,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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) [2022-11-23 06:44:19,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:44:19,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:19,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:19,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:19,609 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:19,609 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:19,609 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:19,609 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:44:19,609 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:44:19,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:44:19,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:19,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:19,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:19,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:19,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:19,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:19,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:44:19,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:44:19,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 06:44:19,839 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-23 06:44:19,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:44:19,839 INFO L85 PathProgramCache]: Analyzing trace with hash 980414961, now seen corresponding path program 1 times [2022-11-23 06:44:19,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:44:19,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076104104] [2022-11-23 06:44:19,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:44:19,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:44:19,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:44:20,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:44:20,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:44:20,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076104104] [2022-11-23 06:44:20,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076104104] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:44:20,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:44:20,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-23 06:44:20,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125230102] [2022-11-23 06:44:20,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:44:20,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-23 06:44:20,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:44:20,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-23 06:44:20,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-11-23 06:44:20,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:44:20,984 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:44:20,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 15.583333333333334) internal successors, (187), 13 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 06:44:20,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:44:20,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:20,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:20,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:20,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:20,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:20,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:20,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:44:20,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:44:20,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:44:21,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:44:21,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:21,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:21,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:21,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:21,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:21,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:21,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:44:21,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:44:21,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-23 06:44:21,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 06:44:21,727 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-23 06:44:21,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:44:21,728 INFO L85 PathProgramCache]: Analyzing trace with hash 791755301, now seen corresponding path program 1 times [2022-11-23 06:44:21,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:44:21,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90713472] [2022-11-23 06:44:21,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:44:21,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:44:22,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:44:24,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:44:24,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:44:24,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90713472] [2022-11-23 06:44:24,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90713472] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:44:24,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:44:24,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-11-23 06:44:24,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491636350] [2022-11-23 06:44:24,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:44:24,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-23 06:44:24,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:44:24,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-23 06:44:24,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2022-11-23 06:44:24,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:44:24,793 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:44:24,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 7.84) internal successors, (196), 26 states have internal predecessors, (196), 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) [2022-11-23 06:44:24,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:44:24,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:24,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:24,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:24,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:24,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:24,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:24,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:44:24,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:44:24,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-23 06:44:24,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:44:30,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:44:30,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:30,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:30,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:30,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:30,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:30,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:30,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:44:30,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:44:30,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:44:30,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-23 06:44:30,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 06:44:30,721 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-23 06:44:30,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:44:30,722 INFO L85 PathProgramCache]: Analyzing trace with hash 515419732, now seen corresponding path program 1 times [2022-11-23 06:44:30,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:44:30,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891389754] [2022-11-23 06:44:30,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:44:30,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:44:30,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:44:35,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:44:35,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:44:35,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891389754] [2022-11-23 06:44:35,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891389754] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:44:35,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:44:35,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-11-23 06:44:35,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281887387] [2022-11-23 06:44:35,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:44:35,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-23 06:44:35,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:44:35,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-23 06:44:35,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-11-23 06:44:35,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:44:35,906 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:44:35,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 9.772727272727273) internal successors, (215), 23 states have internal predecessors, (215), 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) [2022-11-23 06:44:35,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:44:35,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:35,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:35,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:35,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:35,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:35,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:35,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:44:35,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:44:35,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:44:35,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-11-23 06:44:35,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:44:40,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:44:40,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:40,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:40,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:40,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:40,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:40,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:44:40,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:44:40,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:44:40,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:44:40,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-23 06:44:40,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-23 06:44:40,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 06:44:40,399 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-23 06:44:40,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:44:40,399 INFO L85 PathProgramCache]: Analyzing trace with hash -54191571, now seen corresponding path program 1 times [2022-11-23 06:44:40,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:44:40,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144343949] [2022-11-23 06:44:40,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:44:40,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:44:40,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:44:53,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:44:53,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:44:53,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144343949] [2022-11-23 06:44:53,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144343949] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:44:53,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712547147] [2022-11-23 06:44:53,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:44:53,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:44:53,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d0d96a7-3504-4c5e-8ed8-319ad3a14bb9/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:44:53,344 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d0d96a7-3504-4c5e-8ed8-319ad3a14bb9/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:44:53,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d0d96a7-3504-4c5e-8ed8-319ad3a14bb9/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 06:44:53,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:44:53,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 974 conjuncts, 164 conjunts are in the unsatisfiable core [2022-11-23 06:44:53,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:44:54,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 06:44:54,337 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 06:44:54,337 INFO L350 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 [2022-11-23 06:44:56,256 INFO L350 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 11 treesize of output 7 [2022-11-23 06:44:56,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 06:44:57,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 06:44:57,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 06:44:57,476 INFO L350 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 11 treesize of output 7 [2022-11-23 06:44:57,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:44:57,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:44:57,754 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 06:44:57,758 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 06:44:57,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-11-23 06:44:57,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 06:44:57,931 INFO L350 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 13 treesize of output 9 [2022-11-23 06:44:58,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:44:58,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:44:58,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:44:58,106 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 06:44:58,110 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 06:44:58,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 42 [2022-11-23 06:44:58,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:44:58,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:44:58,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:44:58,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:44:58,360 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 06:44:58,364 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 06:44:58,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 54 [2022-11-23 06:44:58,553 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-23 06:44:58,553 INFO L350 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 2 case distinctions, treesize of input 48 treesize of output 51 [2022-11-23 06:44:58,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 06:44:58,810 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-23 06:44:58,811 INFO L350 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 2 case distinctions, treesize of input 52 treesize of output 55 [2022-11-23 06:44:58,919 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-23 06:44:58,921 INFO L350 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 2 case distinctions, treesize of input 52 treesize of output 55 [2022-11-23 06:44:59,024 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-23 06:44:59,024 INFO L350 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 2 case distinctions, treesize of input 52 treesize of output 55 [2022-11-23 06:44:59,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:44:59,312 INFO L350 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 21 treesize of output 20 [2022-11-23 06:44:59,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:44:59,335 INFO L350 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 25 treesize of output 24 [2022-11-23 06:44:59,610 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-23 06:44:59,611 INFO L350 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 2 case distinctions, treesize of input 56 treesize of output 62 [2022-11-23 06:44:59,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 06:44:59,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:44:59,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:44:59,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:44:59,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2022-11-23 06:44:59,885 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 06:44:59,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 54 [2022-11-23 06:45:00,010 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 06:45:00,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 54 [2022-11-23 06:45:00,094 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 06:45:00,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 54 [2022-11-23 06:45:01,077 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 06:45:01,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 54 [2022-11-23 06:45:01,214 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 06:45:01,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 54 [2022-11-23 06:45:01,407 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 06:45:01,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 54 [2022-11-23 06:45:01,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:45:01,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:45:01,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:45:01,505 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 06:45:01,518 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-23 06:45:01,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 73 [2022-11-23 06:45:02,257 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-23 06:45:02,257 INFO L350 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 2 case distinctions, treesize of input 69 treesize of output 66 [2022-11-23 06:45:02,478 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-23 06:45:02,479 INFO L350 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 2 case distinctions, treesize of input 74 treesize of output 71 [2022-11-23 06:45:02,589 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-23 06:45:02,590 INFO L350 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 2 case distinctions, treesize of input 74 treesize of output 71 [2022-11-23 06:45:02,655 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-23 06:45:02,655 INFO L350 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 2 case distinctions, treesize of input 74 treesize of output 71 [2022-11-23 06:45:03,104 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-23 06:45:03,105 INFO L350 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 2 case distinctions, treesize of input 74 treesize of output 71 [2022-11-23 06:45:03,199 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-23 06:45:03,199 INFO L350 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 2 case distinctions, treesize of input 74 treesize of output 71 [2022-11-23 06:45:03,302 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-23 06:45:03,303 INFO L350 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 2 case distinctions, treesize of input 74 treesize of output 71 [2022-11-23 06:45:03,401 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-23 06:45:03,401 INFO L350 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 2 case distinctions, treesize of input 74 treesize of output 71 [2022-11-23 06:45:03,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:45:03,628 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-23 06:45:03,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 33 [2022-11-23 06:45:03,641 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-23 06:45:03,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 15 [2022-11-23 06:45:03,811 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-23 06:45:03,811 INFO L350 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 2 case distinctions, treesize of input 74 treesize of output 71 [2022-11-23 06:45:03,905 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-23 06:45:03,905 INFO L350 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 2 case distinctions, treesize of input 74 treesize of output 71 [2022-11-23 06:45:03,973 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-23 06:45:03,973 INFO L350 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 2 case distinctions, treesize of input 74 treesize of output 71 [2022-11-23 06:45:04,038 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-23 06:45:04,038 INFO L350 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 2 case distinctions, treesize of input 74 treesize of output 71 [2022-11-23 06:45:04,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:45:04,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:45:04,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:45:04,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:45:04,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:45:04,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:45:04,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:45:04,446 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 06:45:04,450 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 06:45:04,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 71 [2022-11-23 06:45:04,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:45:04,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 06:45:05,120 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem52#1.offset| 4))) (and (forall ((v_ArrVal_2416 (Array Int Int)) (v_ArrVal_2417 Int)) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2416))) (store .cse0 |c_ULTIMATE.start_main_#t~mem52#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem52#1.base|) .cse1 v_ArrVal_2417))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)))) (forall ((v_ArrVal_2416 (Array Int Int)) (v_ArrVal_2417 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2416))) (store .cse2 |c_ULTIMATE.start_main_#t~mem52#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem52#1.base|) .cse1 v_ArrVal_2417))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (forall ((v_ArrVal_2416 (Array Int Int)) (v_ArrVal_2417 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2416))) (store .cse3 |c_ULTIMATE.start_main_#t~mem52#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem52#1.base|) .cse1 v_ArrVal_2417))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (forall ((v_ArrVal_2416 (Array Int Int)) (v_ArrVal_2417 Int)) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2416))) (store .cse4 |c_ULTIMATE.start_main_#t~mem52#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem52#1.base|) .cse1 v_ArrVal_2417))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)))))) is different from false [2022-11-23 06:45:05,215 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~p~1#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base|) .cse6)) (.cse2 (+ 4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base|) .cse6)))) (and (forall ((v_ArrVal_2416 (Array Int Int)) (v_ArrVal_2417 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2416))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_2417))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (forall ((v_ArrVal_2416 (Array Int Int)) (v_ArrVal_2417 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2416))) (store .cse3 .cse1 (store (select .cse3 .cse1) .cse2 v_ArrVal_2417))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (forall ((v_ArrVal_2416 (Array Int Int)) (v_ArrVal_2417 Int)) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2416))) (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 v_ArrVal_2417))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)))) (forall ((v_ArrVal_2416 (Array Int Int)) (v_ArrVal_2417 Int)) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2416))) (store .cse5 .cse1 (store (select .cse5 .cse1) .cse2 v_ArrVal_2417))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|)))))) is different from false [2022-11-23 06:45:08,552 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:45:08,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 258 treesize of output 238 [2022-11-23 06:45:08,652 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_main_#t~mem49#1.offset| 4))) (let ((.cse0 (+ |c_~#A~0.offset| 2)) (.cse1 (+ |c_~#A~0.offset| 1)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem49#1.base|) .cse9)) (.cse4 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem49#1.base|) .cse9) 4)) (.cse5 (+ |c_~#A~0.offset| 3))) (and (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse2 (store (store |c_#race| |c_~#A~0.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_#t~mem49#1.base| v_prenex_3))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_prenex_4))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)))) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse5) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (= (select (select (let ((.cse6 (store (store |c_#race| |c_~#A~0.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_#t~mem49#1.base| v_prenex_1))) (store .cse6 .cse3 (store (select .cse6 .cse3) .cse4 v_prenex_2))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (not (= (select v_arrayElimArr_1 .cse5) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (forall ((v_prenex_6 Int) (v_prenex_5 (Array Int Int))) (= (select (select (let ((.cse7 (store (store |c_#race| |c_~#A~0.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_#t~mem49#1.base| v_prenex_5))) (store .cse7 .cse3 (store (select .cse7 .cse3) .cse4 v_prenex_6))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse5) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (forall ((v_ArrVal_2416 (Array Int Int)) (v_ArrVal_2417 Int)) (= (select (select (let ((.cse8 (store (store |c_#race| |c_~#A~0.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_#t~mem49#1.base| v_ArrVal_2416))) (store .cse8 .cse3 (store (select .cse8 .cse3) .cse4 v_ArrVal_2417))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse5) 0))))))) is different from false [2022-11-23 06:45:08,942 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse10 (+ (select (select |c_#memory_$Pointer$.offset| |c_~#A~0.base|) |c_~#A~0.offset|) 4))) (let ((.cse0 (+ |c_~#A~0.offset| 2)) (.cse4 (select (select |c_#memory_$Pointer$.base| .cse6) .cse10)) (.cse5 (+ (select (select |c_#memory_$Pointer$.offset| .cse6) .cse10) 4)) (.cse1 (+ |c_~#A~0.offset| 1)) (.cse2 (+ |c_~#A~0.offset| 3))) (and (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse2) 0)) (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse3 (store (store |c_#race| |c_~#A~0.base| v_arrayElimArr_1) .cse6 v_prenex_1))) (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_prenex_2))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)))))) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (= (select (select (let ((.cse7 (store (store |c_#race| |c_~#A~0.base| v_arrayElimArr_1) .cse6 v_prenex_3))) (store .cse7 .cse4 (store (select .cse7 .cse4) .cse5 v_prenex_4))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse2) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse2) 0)) (forall ((v_prenex_6 Int) (v_prenex_5 (Array Int Int))) (= (select (select (let ((.cse8 (store (store |c_#race| |c_~#A~0.base| v_arrayElimArr_1) .cse6 v_prenex_5))) (store .cse8 .cse4 (store (select .cse8 .cse4) .cse5 v_prenex_6))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)))) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (forall ((v_ArrVal_2416 (Array Int Int)) (v_ArrVal_2417 Int)) (= (select (select (let ((.cse9 (store (store |c_#race| |c_~#A~0.base| v_arrayElimArr_1) .cse6 v_ArrVal_2416))) (store .cse9 .cse4 (store (select .cse9 .cse4) .cse5 v_ArrVal_2417))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse2) 0))))))) is different from false [2022-11-23 06:45:09,524 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse10 (+ (select (select |c_#memory_$Pointer$.offset| |c_~#A~0.base|) |c_~#A~0.offset|) 4))) (let ((.cse0 (+ |c_~#A~0.offset| 2)) (.cse1 (+ |c_~#A~0.offset| 1)) (.cse2 (+ |c_~#A~0.offset| 3)) (.cse4 (select (select |c_#memory_$Pointer$.base| .cse6) .cse10)) (.cse5 (+ (select (select |c_#memory_$Pointer$.offset| .cse6) .cse10) 4))) (and (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_2399 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse2) 0)) (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (= (select (select (let ((.cse3 (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2399) |c_~#A~0.base| v_arrayElimArr_1) .cse6 v_prenex_1))) (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_prenex_2))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_2399 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse7 (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2399) |c_~#A~0.base| v_arrayElimArr_1) .cse6 v_prenex_3))) (store .cse7 .cse4 (store (select .cse7 .cse4) .cse5 v_prenex_4))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)))) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse2) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_2399 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse2) 0)) (forall ((v_prenex_6 Int) (v_prenex_5 (Array Int Int))) (= (select (select (let ((.cse8 (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2399) |c_~#A~0.base| v_arrayElimArr_1) .cse6 v_prenex_5))) (store .cse8 .cse4 (store (select .cse8 .cse4) .cse5 v_prenex_6))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_2399 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse2) 0)) (forall ((v_ArrVal_2416 (Array Int Int)) (v_ArrVal_2417 Int)) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse9 (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2399) |c_~#A~0.base| v_arrayElimArr_1) .cse6 v_ArrVal_2416))) (store .cse9 .cse4 (store (select .cse9 .cse4) .cse5 v_ArrVal_2417))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|)))))))) is different from false [2022-11-23 06:45:09,920 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~list#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.offset|))) (.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~list#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (let ((.cse5 (select (select .cse12 |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse11 (+ (select (select .cse10 |c_~#A~0.base|) |c_~#A~0.offset|) 4))) (let ((.cse0 (+ |c_~#A~0.offset| 2)) (.cse1 (+ |c_~#A~0.offset| 1)) (.cse3 (select (select .cse12 .cse5) .cse11)) (.cse4 (+ 4 (select (select .cse10 .cse5) .cse11))) (.cse6 (+ |c_~#A~0.offset| 3))) (and (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_2399 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse2 (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2399) |c_~#A~0.base| v_arrayElimArr_1) .cse5 v_prenex_1))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_prenex_2))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)))) (not (= (select v_arrayElimArr_1 .cse6) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_2399 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (forall ((v_prenex_6 Int) (v_prenex_5 (Array Int Int))) (= (select (select (let ((.cse7 (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2399) |c_~#A~0.base| v_arrayElimArr_1) .cse5 v_prenex_5))) (store .cse7 .cse3 (store (select .cse7 .cse3) .cse4 v_prenex_6))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse6) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_2399 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (forall ((v_ArrVal_2416 (Array Int Int)) (v_ArrVal_2417 Int)) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse8 (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2399) |c_~#A~0.base| v_arrayElimArr_1) .cse5 v_ArrVal_2416))) (store .cse8 .cse3 (store (select .cse8 .cse3) .cse4 v_ArrVal_2417))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|))) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse6) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_2399 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse9 (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2399) |c_~#A~0.base| v_arrayElimArr_1) .cse5 v_prenex_3))) (store .cse9 .cse3 (store (select .cse9 .cse3) .cse4 v_prenex_4))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)))) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse6) 0)))))))) is different from false [2022-11-23 06:45:10,278 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~list#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.offset|))) (.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~list#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (let ((.cse5 (select (select .cse12 |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse11 (+ (select (select .cse10 |c_~#A~0.base|) |c_~#A~0.offset|) 4))) (let ((.cse0 (+ |c_~#A~0.offset| 2)) (.cse1 (+ |c_~#A~0.offset| 1)) (.cse3 (select (select .cse12 .cse5) .cse11)) (.cse4 (+ 4 (select (select .cse10 .cse5) .cse11))) (.cse6 (+ |c_~#A~0.offset| 3))) (and (forall ((v_ArrVal_2391 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_2399 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse2 (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2391) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2399) |c_~#A~0.base| v_arrayElimArr_1) .cse5 v_prenex_3))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_prenex_4))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)))) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse6) 0)))) (forall ((v_ArrVal_2391 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_2399 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (forall ((v_ArrVal_2416 (Array Int Int)) (v_ArrVal_2417 Int)) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse7 (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2391) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2399) |c_~#A~0.base| v_arrayElimArr_1) .cse5 v_ArrVal_2416))) (store .cse7 .cse3 (store (select .cse7 .cse3) .cse4 v_ArrVal_2417))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|))) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse6) 0)))) (forall ((v_ArrVal_2391 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_2399 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse8 (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2391) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2399) |c_~#A~0.base| v_arrayElimArr_1) .cse5 v_prenex_1))) (store .cse8 .cse3 (store (select .cse8 .cse3) .cse4 v_prenex_2))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)))) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse6) 0)))) (forall ((v_ArrVal_2391 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_2399 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (forall ((v_prenex_6 Int) (v_prenex_5 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse9 (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2391) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2399) |c_~#A~0.base| v_arrayElimArr_1) .cse5 v_prenex_5))) (store .cse9 .cse3 (store (select .cse9 .cse3) .cse4 v_prenex_6))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)))) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse6) 0)))))))) is different from false [2022-11-23 06:45:10,678 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse12 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~list#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.offset|))) (.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~list#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (let ((.cse8 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) (.cse7 (select (select .cse14 |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse13 (+ (select (select .cse12 |c_~#A~0.base|) |c_~#A~0.offset|) 4))) (let ((.cse0 (+ |c_~#A~0.offset| 2)) (.cse4 (select (select .cse14 .cse7) .cse13)) (.cse5 (+ 4 (select (select .cse12 .cse7) .cse13))) (.cse6 (store |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 |c_t_funThread1of1ForFork0_#t~nondet40#1|))) (.cse1 (+ |c_~#A~0.offset| 1)) (.cse2 (+ |c_~#A~0.offset| 3))) (and (forall ((v_ArrVal_2391 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_2399 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse2) 0)) (forall ((v_prenex_6 Int) (v_prenex_5 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse3 (store (store (store (store .cse6 |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2391) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2399) |c_~#A~0.base| v_arrayElimArr_1) .cse7 v_prenex_5))) (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_prenex_6))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8))))) (forall ((v_ArrVal_2391 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_2399 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (= (select (select (let ((.cse9 (store (store (store (store .cse6 |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2391) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2399) |c_~#A~0.base| v_arrayElimArr_1) .cse7 v_prenex_3))) (store .cse9 .cse4 (store (select .cse9 .cse4) .cse5 v_prenex_4))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse2) 0)))) (forall ((v_ArrVal_2391 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_2399 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (forall ((v_ArrVal_2416 (Array Int Int)) (v_ArrVal_2417 Int)) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse10 (store (store (store (store .cse6 |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2391) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2399) |c_~#A~0.base| v_arrayElimArr_1) .cse7 v_ArrVal_2416))) (store .cse10 .cse4 (store (select .cse10 .cse4) .cse5 v_ArrVal_2417))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|))) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse2) 0)))) (forall ((v_ArrVal_2391 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_2399 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse11 (store (store (store (store .cse6 |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2391) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2399) |c_~#A~0.base| v_arrayElimArr_1) .cse7 v_prenex_1))) (store .cse11 .cse4 (store (select .cse11 .cse4) .cse5 v_prenex_2))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)))) (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse2) 0)))))))) is different from false [2022-11-23 06:45:10,895 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~list#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.offset|))) (.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~list#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (let ((.cse6 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) (.cse11 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) (.cse5 (select (select .cse15 |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse14 (+ (select (select .cse13 |c_~#A~0.base|) |c_~#A~0.offset|) 4))) (let ((.cse0 (+ |c_~#A~0.offset| 2)) (.cse7 (+ |c_~#A~0.offset| 1)) (.cse2 (select (select .cse15 .cse5) .cse14)) (.cse3 (+ 4 (select (select .cse13 .cse5) .cse14))) (.cse4 (store |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 |c_t_funThread1of1ForFork0_#t~nondet40#1|) .cse11 |c_t_funThread1of1ForFork0_#t~nondet40#1|))) (.cse8 (+ |c_~#A~0.offset| 3))) (and (forall ((v_ArrVal_2391 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_2399 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (= (select (select (let ((.cse1 (store (store (store (store .cse4 |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2391) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2399) |c_~#A~0.base| v_arrayElimArr_1) .cse5 v_prenex_1))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_prenex_2))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (not (= (select v_arrayElimArr_1 .cse7) 0)) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse8) 0)))) (forall ((v_ArrVal_2391 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_2399 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse7) 0)) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse8) 0)) (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse9 (store (store (store (store .cse4 |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2391) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2399) |c_~#A~0.base| v_arrayElimArr_1) .cse5 v_prenex_3))) (store .cse9 .cse2 (store (select .cse9 .cse2) .cse3 v_prenex_4))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)))))) (forall ((v_ArrVal_2391 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_2399 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse7) 0)) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse8) 0)) (forall ((v_prenex_6 Int) (v_prenex_5 (Array Int Int))) (= (select (select (let ((.cse10 (store (store (store (store .cse4 |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2391) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2399) |c_~#A~0.base| v_arrayElimArr_1) .cse5 v_prenex_5))) (store .cse10 .cse2 (store (select .cse10 .cse2) .cse3 v_prenex_6))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse11) |c_t_funThread1of1ForFork0_#t~nondet40#1|)))) (forall ((v_ArrVal_2391 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_2399 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse7) 0)) (forall ((v_ArrVal_2416 (Array Int Int)) (v_ArrVal_2417 Int)) (= (select (select (let ((.cse12 (store (store (store (store .cse4 |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2391) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2399) |c_~#A~0.base| v_arrayElimArr_1) .cse5 v_ArrVal_2416))) (store .cse12 .cse2 (store (select .cse12 .cse2) .cse3 v_ArrVal_2417))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (not (= (select v_arrayElimArr_1 |c_~#A~0.offset|) 0)) (not (= (select v_arrayElimArr_1 .cse8) 0)))))))) is different from false [2022-11-23 06:45:12,374 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:45:12,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 9142 treesize of output 8209 [2022-11-23 06:50:36,246 WARN L233 SmtUtils]: Spent 5.40m on a formula simplification. DAG size of input: 141 DAG size of output: 99 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-23 06:50:36,247 INFO L321 Elim1Store]: treesize reduction 174, result has 55.9 percent of original size [2022-11-23 06:50:36,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 10 new quantified variables, introduced 36 case distinctions, treesize of input 147206 treesize of output 141968