./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/libvsync/bounded_spsc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/libvsync/bounded_spsc.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 93808a150a8803e907bade039c6d51db8f9a81931409074d169ee410e6e3b34e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-13 06:50:52,760 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 06:50:52,849 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2024-11-13 06:50:52,854 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 06:50:52,860 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 06:50:52,886 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 06:50:52,886 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 06:50:52,887 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 06:50:52,887 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 06:50:52,888 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 06:50:52,889 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 06:50:52,889 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 06:50:52,890 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 06:50:52,891 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 06:50:52,892 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 06:50:52,892 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 06:50:52,892 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 06:50:52,893 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 06:50:52,893 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 06:50:52,893 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 06:50:52,897 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 06:50:52,897 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 06:50:52,898 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-13 06:50:52,898 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 06:50:52,898 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 06:50:52,898 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 06:50:52,898 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 06:50:52,899 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 06:50:52,899 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 06:50:52,899 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 06:50:52,899 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-11-13 06:50:52,899 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 06:50:52,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 06:50:52,900 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 06:50:52,900 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 06:50:52,900 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 06:50:52,900 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 06:50:52,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 06:50:52,901 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 06:50:52,901 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-11-13 06:50:52,903 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-13 06:50:52,904 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-13 06:50:52,904 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-13 06:50:52,904 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 93808a150a8803e907bade039c6d51db8f9a81931409074d169ee410e6e3b34e [2024-11-13 06:50:53,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 06:50:53,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 06:50:53,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 06:50:53,182 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 06:50:53,183 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 06:50:53,184 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/libvsync/bounded_spsc.i [2024-11-13 06:50:54,556 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 06:50:54,979 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 06:50:54,980 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_spsc.i [2024-11-13 06:50:55,031 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f67b6e436/0c5390b4c25e46cd84b9ff41023134b8/FLAGfe33ea9f6 [2024-11-13 06:50:55,048 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f67b6e436/0c5390b4c25e46cd84b9ff41023134b8 [2024-11-13 06:50:55,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 06:50:55,052 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 06:50:55,053 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 06:50:55,054 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 06:50:55,061 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 06:50:55,062 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 06:50:55" (1/1) ... [2024-11-13 06:50:55,063 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55dba6b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:50:55, skipping insertion in model container [2024-11-13 06:50:55,063 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 06:50:55" (1/1) ... [2024-11-13 06:50:55,170 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 06:50:57,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 06:50:57,239 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 06:50:57,367 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4397] [2024-11-13 06:50:57,369 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4399] [2024-11-13 06:50:57,370 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4404] [2024-11-13 06:50:57,372 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4406] [2024-11-13 06:50:57,373 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4412] [2024-11-13 06:50:57,374 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4414] [2024-11-13 06:50:57,374 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4420] [2024-11-13 06:50:57,375 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4422] [2024-11-13 06:50:57,376 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4428] [2024-11-13 06:50:57,376 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4430] [2024-11-13 06:50:57,380 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4436] [2024-11-13 06:50:57,381 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4438] [2024-11-13 06:50:57,381 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4444] [2024-11-13 06:50:57,382 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4446] [2024-11-13 06:50:57,382 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4452] [2024-11-13 06:50:57,383 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4454] [2024-11-13 06:50:57,383 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4459] [2024-11-13 06:50:57,383 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4461] [2024-11-13 06:50:57,384 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4466] [2024-11-13 06:50:57,385 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4468] [2024-11-13 06:50:57,386 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4473] [2024-11-13 06:50:57,387 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4475] [2024-11-13 06:50:57,387 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4480] [2024-11-13 06:50:57,388 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4482] [2024-11-13 06:50:57,388 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4487] [2024-11-13 06:50:57,388 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4489] [2024-11-13 06:50:57,389 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4494] [2024-11-13 06:50:57,390 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4497] [2024-11-13 06:50:57,390 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4503] [2024-11-13 06:50:57,391 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4506] [2024-11-13 06:50:57,393 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4512] [2024-11-13 06:50:57,394 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4515] [2024-11-13 06:50:57,395 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4521] [2024-11-13 06:50:57,396 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4524] [2024-11-13 06:50:57,397 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4530] [2024-11-13 06:50:57,398 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4533] [2024-11-13 06:50:57,400 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4539] [2024-11-13 06:50:57,401 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4542] [2024-11-13 06:50:57,403 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4549] [2024-11-13 06:50:57,404 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4552] [2024-11-13 06:50:57,404 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4559] [2024-11-13 06:50:57,405 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4562] [2024-11-13 06:50:57,407 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4569] [2024-11-13 06:50:57,408 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4572] [2024-11-13 06:50:57,409 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4579] [2024-11-13 06:50:57,410 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4582] [2024-11-13 06:50:57,410 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4589] [2024-11-13 06:50:57,413 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4592] [2024-11-13 06:50:57,414 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4599] [2024-11-13 06:50:57,414 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4602] [2024-11-13 06:50:57,415 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4608] [2024-11-13 06:50:57,415 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4611] [2024-11-13 06:50:57,416 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4617] [2024-11-13 06:50:57,416 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4620] [2024-11-13 06:50:57,417 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4626] [2024-11-13 06:50:57,420 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4629] [2024-11-13 06:50:57,421 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4635] [2024-11-13 06:50:57,422 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4638] [2024-11-13 06:50:57,424 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4644] [2024-11-13 06:50:57,425 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4647] [2024-11-13 06:50:57,426 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4653] [2024-11-13 06:50:57,427 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4656] [2024-11-13 06:50:57,429 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4662] [2024-11-13 06:50:57,430 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4665] [2024-11-13 06:50:57,430 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4671] [2024-11-13 06:50:57,432 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4674] [2024-11-13 06:50:57,432 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4680] [2024-11-13 06:50:57,433 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4683] [2024-11-13 06:50:57,433 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4689] [2024-11-13 06:50:57,434 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4692] [2024-11-13 06:50:57,434 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4698] [2024-11-13 06:50:57,435 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4701] [2024-11-13 06:50:57,435 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4707] [2024-11-13 06:50:57,436 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4710] [2024-11-13 06:50:57,436 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4716] [2024-11-13 06:50:57,437 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4719] [2024-11-13 06:50:57,438 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4725] [2024-11-13 06:50:57,439 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4728] [2024-11-13 06:50:57,440 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4734] [2024-11-13 06:50:57,441 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4737] [2024-11-13 06:50:57,442 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4743] [2024-11-13 06:50:57,444 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4745] [2024-11-13 06:50:57,445 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4751] [2024-11-13 06:50:57,445 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4753] [2024-11-13 06:50:57,446 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4759] [2024-11-13 06:50:57,446 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4761] [2024-11-13 06:50:57,447 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4767] [2024-11-13 06:50:57,448 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4769] [2024-11-13 06:50:57,449 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4775] [2024-11-13 06:50:57,449 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4777] [2024-11-13 06:50:57,450 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4783] [2024-11-13 06:50:57,450 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4785] [2024-11-13 06:50:57,451 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4791] [2024-11-13 06:50:57,452 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4793] [2024-11-13 06:50:57,453 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4799] [2024-11-13 06:50:57,454 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4801] [2024-11-13 06:50:57,454 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4807] [2024-11-13 06:50:57,455 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4809] [2024-11-13 06:50:57,455 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4815] [2024-11-13 06:50:57,457 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4817] [2024-11-13 06:50:57,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 06:50:57,876 INFO L204 MainTranslator]: Completed translation [2024-11-13 06:50:57,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:50:57 WrapperNode [2024-11-13 06:50:57,877 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 06:50:57,878 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 06:50:57,878 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 06:50:57,878 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 06:50:57,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:50:57" (1/1) ... [2024-11-13 06:50:57,978 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:50:57" (1/1) ... [2024-11-13 06:50:58,060 INFO L138 Inliner]: procedures = 948, calls = 963, calls flagged for inlining = 823, calls inlined = 39, statements flattened = 610 [2024-11-13 06:50:58,060 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 06:50:58,061 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 06:50:58,061 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 06:50:58,061 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 06:50:58,077 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:50:57" (1/1) ... [2024-11-13 06:50:58,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:50:57" (1/1) ... [2024-11-13 06:50:58,083 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:50:57" (1/1) ... [2024-11-13 06:50:58,083 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:50:57" (1/1) ... [2024-11-13 06:50:58,117 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:50:57" (1/1) ... [2024-11-13 06:50:58,129 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:50:57" (1/1) ... [2024-11-13 06:50:58,137 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:50:57" (1/1) ... [2024-11-13 06:50:58,148 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:50:57" (1/1) ... [2024-11-13 06:50:58,155 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 06:50:58,156 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 06:50:58,156 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 06:50:58,156 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 06:50:58,157 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:50:57" (1/1) ... [2024-11-13 06:50:58,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 06:50:58,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:50:58,201 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-13 06:50:58,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-13 06:50:58,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 06:50:58,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 06:50:58,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 06:50:58,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-13 06:50:58,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 06:50:58,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 06:50:58,258 INFO L130 BoogieDeclarations]: Found specification of procedure run [2024-11-13 06:50:58,258 INFO L138 BoogieDeclarations]: Found implementation of procedure run [2024-11-13 06:50:58,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 06:50:58,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-13 06:50:58,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 06:50:58,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 06:50:58,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-13 06:50:58,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 06:50:58,262 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 06:50:58,437 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 06:50:58,439 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 06:50:59,419 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 06:50:59,419 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 06:50:59,509 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 06:50:59,510 INFO L316 CfgBuilder]: Removed 51 assume(true) statements. [2024-11-13 06:50:59,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 06:50:59 BoogieIcfgContainer [2024-11-13 06:50:59,510 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 06:50:59,512 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 06:50:59,514 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 06:50:59,518 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 06:50:59,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 06:50:55" (1/3) ... [2024-11-13 06:50:59,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f961518 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 06:50:59, skipping insertion in model container [2024-11-13 06:50:59,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:50:57" (2/3) ... [2024-11-13 06:50:59,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f961518 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 06:50:59, skipping insertion in model container [2024-11-13 06:50:59,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 06:50:59" (3/3) ... [2024-11-13 06:50:59,521 INFO L112 eAbstractionObserver]: Analyzing ICFG bounded_spsc.i [2024-11-13 06:50:59,538 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 06:50:59,539 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2024-11-13 06:50:59,539 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 06:50:59,764 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-13 06:50:59,832 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 06:50:59,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-13 06:50:59,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:50:59,835 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-13 06:50:59,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-13 06:50:59,873 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 06:50:59,885 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == runThread1of1ForFork0 ======== [2024-11-13 06:50:59,891 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@64fef8a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 06:50:59,891 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2024-11-13 06:51:01,240 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting runErr0ASSERT_VIOLATIONDATA_RACE === [runErr0ASSERT_VIOLATIONDATA_RACE, runErr17ASSERT_VIOLATIONDATA_RACE, runErr1ASSERT_VIOLATIONDATA_RACE, runErr18ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-13 06:51:01,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:51:01,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1078950436, now seen corresponding path program 1 times [2024-11-13 06:51:01,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:51:01,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746023494] [2024-11-13 06:51:01,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:51:01,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:51:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:51:01,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:51:01,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:51:01,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746023494] [2024-11-13 06:51:01,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746023494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:51:01,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:51:01,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 06:51:01,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12830219] [2024-11-13 06:51:01,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:51:01,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 06:51:01,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:51:01,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 06:51:01,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 06:51:01,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:51:01,924 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:51:01,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 06:51:01,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:51:02,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:51:02,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 06:51:02,044 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting runErr0ASSERT_VIOLATIONDATA_RACE === [runErr0ASSERT_VIOLATIONDATA_RACE, runErr17ASSERT_VIOLATIONDATA_RACE, runErr1ASSERT_VIOLATIONDATA_RACE, runErr18ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-13 06:51:02,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:51:02,045 INFO L85 PathProgramCache]: Analyzing trace with hash -801922169, now seen corresponding path program 1 times [2024-11-13 06:51:02,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:51:02,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545020308] [2024-11-13 06:51:02,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:51:02,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:51:02,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:51:02,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:51:02,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:51:02,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545020308] [2024-11-13 06:51:02,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545020308] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:51:02,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126271385] [2024-11-13 06:51:02,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:51:02,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:51:02,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:51:02,553 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:51:02,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 06:51:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:51:02,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 06:51:02,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:51:02,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 42 [2024-11-13 06:51:02,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2024-11-13 06:51:02,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2024-11-13 06:51:02,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 80 [2024-11-13 06:51:02,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:51:02,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 154 [2024-11-13 06:51:02,931 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:51:02,932 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:51:02,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 30 [2024-11-13 06:51:03,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 104 [2024-11-13 06:51:03,047 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:51:03,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 208 [2024-11-13 06:51:03,072 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:51:03,074 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:51:03,079 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:51:03,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 51 [2024-11-13 06:51:03,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 128 [2024-11-13 06:51:03,248 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:51:03,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 128 treesize of output 262 [2024-11-13 06:51:03,351 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:51:03,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 68 [2024-11-13 06:51:03,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 06:51:03,430 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 06:51:03,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126271385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:51:03,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 06:51:03,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2024-11-13 06:51:03,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548522651] [2024-11-13 06:51:03,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:51:03,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:51:03,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:51:03,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:51:03,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-13 06:51:03,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:51:03,436 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:51:03,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 27.6) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 06:51:03,436 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:51:03,436 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:51:07,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:51:07,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:07,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-13 06:51:07,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-13 06:51:07,323 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting runErr1ASSERT_VIOLATIONDATA_RACE === [runErr0ASSERT_VIOLATIONDATA_RACE, runErr17ASSERT_VIOLATIONDATA_RACE, runErr1ASSERT_VIOLATIONDATA_RACE, runErr18ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-13 06:51:07,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:51:07,324 INFO L85 PathProgramCache]: Analyzing trace with hash 750107263, now seen corresponding path program 1 times [2024-11-13 06:51:07,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:51:07,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562620082] [2024-11-13 06:51:07,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:51:07,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:51:07,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:51:07,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:51:07,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:51:07,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562620082] [2024-11-13 06:51:07,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562620082] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:51:07,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77765182] [2024-11-13 06:51:07,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:51:07,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:51:07,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:51:07,664 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:51:07,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 06:51:07,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:51:07,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 06:51:07,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:51:07,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 06:51:07,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-13 06:51:07,927 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:51:07,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-11-13 06:51:07,953 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:51:07,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2024-11-13 06:51:07,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 06:51:07,980 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 06:51:07,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77765182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:51:07,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 06:51:07,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2024-11-13 06:51:07,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276222883] [2024-11-13 06:51:07,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:51:07,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:51:07,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:51:07,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:51:07,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-13 06:51:07,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:51:07,988 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:51:07,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 29.4) internal successors, (147), 6 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 06:51:07,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:51:07,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:07,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:51:08,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:51:08,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:08,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:08,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 06:51:08,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:51:08,790 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting runErr2ASSERT_VIOLATIONDATA_RACE === [runErr0ASSERT_VIOLATIONDATA_RACE, runErr17ASSERT_VIOLATIONDATA_RACE, runErr1ASSERT_VIOLATIONDATA_RACE, runErr18ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-13 06:51:08,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:51:08,791 INFO L85 PathProgramCache]: Analyzing trace with hash -514529188, now seen corresponding path program 1 times [2024-11-13 06:51:08,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:51:08,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707049459] [2024-11-13 06:51:08,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:51:08,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:51:08,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:51:09,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:51:09,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:51:09,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707049459] [2024-11-13 06:51:09,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707049459] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:51:09,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125999125] [2024-11-13 06:51:09,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:51:09,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:51:09,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:51:09,094 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:51:09,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 06:51:09,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:51:09,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 06:51:09,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:51:09,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 06:51:09,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-13 06:51:09,357 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:51:09,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2024-11-13 06:51:09,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:51:09,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2024-11-13 06:51:09,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 06:51:09,411 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 06:51:09,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125999125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:51:09,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 06:51:09,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2024-11-13 06:51:09,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873963370] [2024-11-13 06:51:09,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:51:09,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:51:09,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:51:09,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:51:09,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-13 06:51:09,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:51:09,416 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:51:09,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 31.0) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 06:51:09,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:51:09,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:09,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:09,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:51:11,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:51:11,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:11,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:11,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:11,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 06:51:12,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:51:12,111 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting runErr5ASSERT_VIOLATIONDATA_RACE === [runErr0ASSERT_VIOLATIONDATA_RACE, runErr17ASSERT_VIOLATIONDATA_RACE, runErr1ASSERT_VIOLATIONDATA_RACE, runErr18ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-13 06:51:12,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:51:12,112 INFO L85 PathProgramCache]: Analyzing trace with hash 193257871, now seen corresponding path program 1 times [2024-11-13 06:51:12,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:51:12,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968171619] [2024-11-13 06:51:12,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:51:12,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:51:12,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:51:12,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:51:12,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:51:12,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968171619] [2024-11-13 06:51:12,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968171619] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:51:12,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840664258] [2024-11-13 06:51:12,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:51:12,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:51:12,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:51:12,430 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:51:12,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 06:51:12,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:51:12,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 06:51:12,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:51:12,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 06:51:12,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-13 06:51:12,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:51:12,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2024-11-13 06:51:12,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:51:12,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2024-11-13 06:51:12,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 06:51:12,783 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 06:51:12,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840664258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:51:12,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 06:51:12,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2024-11-13 06:51:12,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323950868] [2024-11-13 06:51:12,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:51:12,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:51:12,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:51:12,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:51:12,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-13 06:51:12,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:51:12,787 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:51:12,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 43.4) internal successors, (217), 6 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 06:51:12,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:51:12,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:12,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:12,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:12,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:51:15,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:51:15,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:15,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:15,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:15,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:15,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-13 06:51:15,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:51:15,863 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting runErr6ASSERT_VIOLATIONDATA_RACE === [runErr0ASSERT_VIOLATIONDATA_RACE, runErr17ASSERT_VIOLATIONDATA_RACE, runErr1ASSERT_VIOLATIONDATA_RACE, runErr18ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-13 06:51:15,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:51:15,863 INFO L85 PathProgramCache]: Analyzing trace with hash 310828095, now seen corresponding path program 1 times [2024-11-13 06:51:15,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:51:15,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745018085] [2024-11-13 06:51:15,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:51:15,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:51:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:51:16,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:51:16,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:51:16,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745018085] [2024-11-13 06:51:16,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745018085] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:51:16,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871731158] [2024-11-13 06:51:16,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:51:16,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:51:16,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:51:16,217 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:51:16,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 06:51:16,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:51:16,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 06:51:16,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:51:16,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 06:51:16,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-13 06:51:16,533 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:51:16,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-11-13 06:51:16,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:51:16,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2024-11-13 06:51:16,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 06:51:16,640 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 06:51:16,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871731158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:51:16,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 06:51:16,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2024-11-13 06:51:16,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930847418] [2024-11-13 06:51:16,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:51:16,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:51:16,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:51:16,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:51:16,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-13 06:51:16,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:51:16,647 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:51:16,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 45.0) internal successors, (225), 6 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 06:51:16,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:51:16,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:16,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:16,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:16,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:16,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:51:18,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:51:18,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:18,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:18,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:18,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:18,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:18,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-13 06:51:18,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:51:18,851 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting runErr8ASSERT_VIOLATIONDATA_RACE === [runErr0ASSERT_VIOLATIONDATA_RACE, runErr17ASSERT_VIOLATIONDATA_RACE, runErr1ASSERT_VIOLATIONDATA_RACE, runErr18ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-13 06:51:18,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:51:18,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1913524745, now seen corresponding path program 1 times [2024-11-13 06:51:18,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:51:18,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269650222] [2024-11-13 06:51:18,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:51:18,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:51:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:51:19,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:51:19,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:51:19,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269650222] [2024-11-13 06:51:19,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269650222] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:51:19,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061832040] [2024-11-13 06:51:19,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:51:19,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:51:19,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:51:19,325 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:51:19,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 06:51:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:51:19,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 861 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 06:51:19,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:51:19,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 66 [2024-11-13 06:51:19,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-13 06:51:19,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2024-11-13 06:51:19,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 128 [2024-11-13 06:51:19,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:51:19,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 238 [2024-11-13 06:51:19,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 27 [2024-11-13 06:51:19,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 164 [2024-11-13 06:51:19,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:51:19,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 164 treesize of output 316 [2024-11-13 06:51:20,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 49 [2024-11-13 06:51:20,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 224 treesize of output 200 [2024-11-13 06:51:20,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:51:20,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 200 treesize of output 394 [2024-11-13 06:51:20,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 334 treesize of output 120 [2024-11-13 06:51:20,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 06:51:20,443 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 06:51:20,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061832040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:51:20,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 06:51:20,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2024-11-13 06:51:20,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465828194] [2024-11-13 06:51:20,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:51:20,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:51:20,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:51:20,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:51:20,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-13 06:51:20,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:51:20,447 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:51:20,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 47.6) internal successors, (238), 6 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 06:51:20,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:51:20,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:20,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:20,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:20,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:20,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:20,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:51:48,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:51:48,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:48,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:48,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:48,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:48,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:48,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:48,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 06:51:49,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-13 06:51:49,122 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting runErr8ASSERT_VIOLATIONDATA_RACE === [runErr0ASSERT_VIOLATIONDATA_RACE, runErr17ASSERT_VIOLATIONDATA_RACE, runErr1ASSERT_VIOLATIONDATA_RACE, runErr18ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-13 06:51:49,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:51:49,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1388067497, now seen corresponding path program 1 times [2024-11-13 06:51:49,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:51:49,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550224763] [2024-11-13 06:51:49,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:51:49,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:51:49,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:51:49,728 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 372 proven. 0 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-11-13 06:51:49,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:51:49,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550224763] [2024-11-13 06:51:49,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550224763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:51:49,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:51:49,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 06:51:49,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115817066] [2024-11-13 06:51:49,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:51:49,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 06:51:49,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:51:49,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 06:51:49,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 06:51:49,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:51:49,734 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:51:49,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 06:51:49,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:51:49,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:49,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:49,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:49,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:49,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:49,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:49,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:51:50,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:51:50,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:50,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:50,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:50,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:50,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:50,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:50,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 06:51:50,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 06:51:50,147 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting runErr2ASSERT_VIOLATIONDATA_RACE === [runErr0ASSERT_VIOLATIONDATA_RACE, runErr17ASSERT_VIOLATIONDATA_RACE, runErr1ASSERT_VIOLATIONDATA_RACE, runErr18ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-13 06:51:50,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:51:50,148 INFO L85 PathProgramCache]: Analyzing trace with hash -172697509, now seen corresponding path program 1 times [2024-11-13 06:51:50,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:51:50,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252603040] [2024-11-13 06:51:50,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:51:50,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:51:50,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:51:50,566 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-13 06:51:50,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:51:50,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252603040] [2024-11-13 06:51:50,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252603040] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:51:50,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850439352] [2024-11-13 06:51:50,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:51:50,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:51:50,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:51:50,569 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:51:50,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 06:51:50,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:51:50,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 1099 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 06:51:50,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:51:50,998 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-13 06:51:50,999 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:51:51,074 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-13 06:51:51,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850439352] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:51:51,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:51:51,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-13 06:51:51,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737113399] [2024-11-13 06:51:51,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:51:51,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 06:51:51,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:51:51,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 06:51:51,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-13 06:51:51,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:51:51,078 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:51:51,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 34.888888888888886) internal successors, (314), 9 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 06:51:51,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:51:51,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:51,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:51,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:51,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:51,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:51,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:51,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 06:51:51,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:51:51,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:51:51,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:51,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:51,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:51,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:51,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:51,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:51:51,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 06:51:51,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 06:51:51,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 06:51:51,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:51:51,542 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting runErr2ASSERT_VIOLATIONDATA_RACE === [runErr0ASSERT_VIOLATIONDATA_RACE, runErr17ASSERT_VIOLATIONDATA_RACE, runErr1ASSERT_VIOLATIONDATA_RACE, runErr18ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-13 06:51:51,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:51:51,542 INFO L85 PathProgramCache]: Analyzing trace with hash -351917199, now seen corresponding path program 2 times [2024-11-13 06:51:51,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:51:51,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642279125] [2024-11-13 06:51:51,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:51:51,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:51:52,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:52:12,149 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:52:12,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:52:12,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642279125] [2024-11-13 06:52:12,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642279125] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:52:12,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182077043] [2024-11-13 06:52:12,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 06:52:12,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:52:12,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:52:12,151 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:52:12,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 06:52:13,021 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 06:52:13,021 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 06:52:13,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 1273 conjuncts, 166 conjuncts are in the unsatisfiable core [2024-11-13 06:52:13,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:52:14,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 06:52:14,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-13 06:52:15,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:52:15,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-13 06:52:15,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:52:15,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-13 06:52:16,291 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-11-13 06:52:16,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2024-11-13 06:52:16,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-13 06:52:17,239 INFO L349 Elim1Store]: treesize reduction 66, result has 35.3 percent of original size [2024-11-13 06:52:17,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 53 [2024-11-13 06:52:17,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 39 [2024-11-13 06:52:18,425 INFO L349 Elim1Store]: treesize reduction 104, result has 33.8 percent of original size [2024-11-13 06:52:18,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 42 treesize of output 68 [2024-11-13 06:52:18,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 71 [2024-11-13 06:52:19,728 INFO L349 Elim1Store]: treesize reduction 16, result has 61.0 percent of original size [2024-11-13 06:52:19,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 40 [2024-11-13 06:52:20,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 95 [2024-11-13 06:52:21,770 INFO L349 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2024-11-13 06:52:21,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 132 treesize of output 100 [2024-11-13 06:52:22,138 INFO L349 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2024-11-13 06:52:22,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 132 treesize of output 100 [2024-11-13 06:52:27,266 INFO L349 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2024-11-13 06:52:27,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 132 treesize of output 100 [2024-11-13 06:52:28,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 90 [2024-11-13 06:52:30,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:52:30,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 77 [2024-11-13 06:52:30,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 [2024-11-13 06:52:30,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-13 06:52:30,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:52:30,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2024-11-13 06:52:31,030 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:52:31,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2024-11-13 06:52:31,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-11-13 06:52:31,556 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:52:31,556 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:52:31,581 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3230 (Array Int Int))) (= |c_runThread1of1ForFork0_#t~nondet821#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_3230) |c_runThread1of1ForFork0_~point~0#1.base|) (+ 7 |c_runThread1of1ForFork0_~point~0#1.offset|)))) (forall ((v_ArrVal_3230 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_3230) |c_runThread1of1ForFork0_~point~0#1.base|) (+ 5 |c_runThread1of1ForFork0_~point~0#1.offset|)) |c_runThread1of1ForFork0_#t~nondet821#1|)) (forall ((v_ArrVal_3230 (Array Int Int))) (= |c_runThread1of1ForFork0_#t~nondet821#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_3230) |c_runThread1of1ForFork0_~point~0#1.base|) (+ 6 |c_runThread1of1ForFork0_~point~0#1.offset|)))) (forall ((v_ArrVal_3230 (Array Int Int))) (= |c_runThread1of1ForFork0_#t~nondet821#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_3230) |c_runThread1of1ForFork0_~point~0#1.base|) (+ |c_runThread1of1ForFork0_~point~0#1.offset| 4))))) is different from false [2024-11-13 06:52:31,686 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 |c_runThread1of1ForFork0_~point~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_runThread1of1ForFork0_~point~0#1.base| (store (select |c_#race| |c_runThread1of1ForFork0_~point~0#1.base|) .cse1 |c_runThread1of1ForFork0_#t~nondet821#1|)))) (and (forall ((v_ArrVal_3230 (Array Int Int))) (= |c_runThread1of1ForFork0_#t~nondet821#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_3230) |c_runThread1of1ForFork0_~point~0#1.base|) (+ 5 |c_runThread1of1ForFork0_~point~0#1.offset|)))) (forall ((v_ArrVal_3230 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_3230) |c_runThread1of1ForFork0_~point~0#1.base|) .cse1) |c_runThread1of1ForFork0_#t~nondet821#1|)) (forall ((v_ArrVal_3230 (Array Int Int))) (= |c_runThread1of1ForFork0_#t~nondet821#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_3230) |c_runThread1of1ForFork0_~point~0#1.base|) (+ 6 |c_runThread1of1ForFork0_~point~0#1.offset|)))) (forall ((v_ArrVal_3230 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_3230) |c_runThread1of1ForFork0_~point~0#1.base|) (+ |c_runThread1of1ForFork0_~point~0#1.offset| 4)) |c_runThread1of1ForFork0_#t~nondet821#1|))))) is different from false [2024-11-13 06:52:31,702 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 6 |c_runThread1of1ForFork0_~point~0#1.offset|)) (.cse2 (+ 7 |c_runThread1of1ForFork0_~point~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_runThread1of1ForFork0_~point~0#1.base| (store (store (select |c_#race| |c_runThread1of1ForFork0_~point~0#1.base|) .cse1 |c_runThread1of1ForFork0_#t~nondet821#1|) .cse2 |c_runThread1of1ForFork0_#t~nondet821#1|)))) (and (forall ((v_ArrVal_3230 (Array Int Int))) (= |c_runThread1of1ForFork0_#t~nondet821#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_3230) |c_runThread1of1ForFork0_~point~0#1.base|) (+ |c_runThread1of1ForFork0_~point~0#1.offset| 4)))) (forall ((v_ArrVal_3230 (Array Int Int))) (= |c_runThread1of1ForFork0_#t~nondet821#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_3230) |c_runThread1of1ForFork0_~point~0#1.base|) .cse1))) (forall ((v_ArrVal_3230 (Array Int Int))) (= |c_runThread1of1ForFork0_#t~nondet821#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_3230) |c_runThread1of1ForFork0_~point~0#1.base|) .cse2))) (forall ((v_ArrVal_3230 (Array Int Int))) (= |c_runThread1of1ForFork0_#t~nondet821#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_3230) |c_runThread1of1ForFork0_~point~0#1.base|) (+ 5 |c_runThread1of1ForFork0_~point~0#1.offset|))))))) is different from false [2024-11-13 06:52:31,716 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 5 |c_runThread1of1ForFork0_~point~0#1.offset|)) (.cse1 (+ 6 |c_runThread1of1ForFork0_~point~0#1.offset|)) (.cse3 (+ 7 |c_runThread1of1ForFork0_~point~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_runThread1of1ForFork0_~point~0#1.base| (store (store (store (select |c_#race| |c_runThread1of1ForFork0_~point~0#1.base|) .cse2 |c_runThread1of1ForFork0_#t~nondet821#1|) .cse1 |c_runThread1of1ForFork0_#t~nondet821#1|) .cse3 |c_runThread1of1ForFork0_#t~nondet821#1|)))) (and (forall ((v_ArrVal_3230 (Array Int Int))) (= |c_runThread1of1ForFork0_#t~nondet821#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_3230) |c_runThread1of1ForFork0_~point~0#1.base|) .cse1))) (forall ((v_ArrVal_3230 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_3230) |c_runThread1of1ForFork0_~point~0#1.base|) .cse2) |c_runThread1of1ForFork0_#t~nondet821#1|)) (forall ((v_ArrVal_3230 (Array Int Int))) (= |c_runThread1of1ForFork0_#t~nondet821#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_3230) |c_runThread1of1ForFork0_~point~0#1.base|) (+ |c_runThread1of1ForFork0_~point~0#1.offset| 4)))) (forall ((v_ArrVal_3230 (Array Int Int))) (= |c_runThread1of1ForFork0_#t~nondet821#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_3230) |c_runThread1of1ForFork0_~point~0#1.base|) .cse3)))))) is different from false [2024-11-13 06:52:31,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:52:31,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 53 [2024-11-13 06:52:31,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:52:31,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 32 [2024-11-13 06:52:31,752 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 06:52:31,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-11-13 06:52:31,757 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 06:52:31,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-11-13 06:52:31,763 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 06:52:31,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-11-13 06:52:32,331 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_z_3 Int) (v_ArrVal_3223 (Array Int Int))) (or (< 2 v_z_3) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_runThread1of1ForFork0_vatomic32_write_~a#1.base| v_ArrVal_3223) |c_~#g_points~0.base|) (+ |c_~#g_points~0.offset| (* v_z_3 4))) |c_ULTIMATE.start_main_~#t~0#1.base|)) (< v_z_3 0))) is different from false [2024-11-13 06:52:32,348 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_z_3 Int) (v_ArrVal_3223 (Array Int Int))) (or (< 2 v_z_3) (< v_z_3 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_runThread1of1ForFork0_vatomic32_write_#in~a#1.base| v_ArrVal_3223) |c_~#g_points~0.base|) (+ |c_~#g_points~0.offset| (* v_z_3 4))))))) is different from false [2024-11-13 06:52:32,367 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_z_3 Int) (v_ArrVal_3223 (Array Int Int))) (or (< 2 v_z_3) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_runThread1of1ForFork0_vatomic32_write_rel_~a#1.base| v_ArrVal_3223) |c_~#g_points~0.base|) (+ |c_~#g_points~0.offset| (* v_z_3 4))) |c_ULTIMATE.start_main_~#t~0#1.base|)) (< v_z_3 0))) is different from false [2024-11-13 06:52:33,817 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_z_3 Int) (v_ArrVal_3221 (Array Int Int)) (v_ArrVal_3223 (Array Int Int)) (|v_runThread1of1ForFork0_bounded_spsc_enq_#t~mem811#1.base_32| Int)) (or (< (select (select |c_#memory_$Pointer$.base| |c_runThread1of1ForFork0_bounded_spsc_enq_~q#1.base|) |c_runThread1of1ForFork0_bounded_spsc_enq_~q#1.offset|) |v_runThread1of1ForFork0_bounded_spsc_enq_#t~mem811#1.base_32|) (< 2 v_z_3) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |v_runThread1of1ForFork0_bounded_spsc_enq_#t~mem811#1.base_32| v_ArrVal_3221) |c_runThread1of1ForFork0_bounded_spsc_enq_~q#1.base| v_ArrVal_3223) |c_~#g_points~0.base|) (+ |c_~#g_points~0.offset| (* v_z_3 4))))) (< v_z_3 0))) is different from false [2024-11-13 06:52:34,867 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_z_3 Int) (v_ArrVal_3220 (Array Int Int)) (v_ArrVal_3221 (Array Int Int)) (v_ArrVal_3223 (Array Int Int)) (|v_runThread1of1ForFork0_bounded_spsc_enq_#t~mem811#1.base_32| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_runThread1of1ForFork0_~point~0#1.base| v_ArrVal_3220))) (or (< (select (select .cse0 |c_~#g_queue~0.base|) |c_~#g_queue~0.offset|) |v_runThread1of1ForFork0_bounded_spsc_enq_#t~mem811#1.base_32|) (< 2 v_z_3) (< v_z_3 0) (not (= (select (select (store (store .cse0 |v_runThread1of1ForFork0_bounded_spsc_enq_#t~mem811#1.base_32| v_ArrVal_3221) |c_~#g_queue~0.base| v_ArrVal_3223) |c_~#g_points~0.base|) (+ |c_~#g_points~0.offset| (* v_z_3 4))) |c_ULTIMATE.start_main_~#t~0#1.base|))))) is different from false [2024-11-13 06:52:34,992 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_z_3 Int) (v_ArrVal_3220 (Array Int Int)) (v_ArrVal_3221 (Array Int Int)) (v_ArrVal_3223 (Array Int Int)) (|v_runThread1of1ForFork0_bounded_spsc_enq_#t~mem811#1.base_32| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_runThread1of1ForFork0_#t~mem819#1.base| v_ArrVal_3220))) (or (< (select (select .cse0 |c_~#g_queue~0.base|) |c_~#g_queue~0.offset|) |v_runThread1of1ForFork0_bounded_spsc_enq_#t~mem811#1.base_32|) (< 2 v_z_3) (< v_z_3 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| (select (select (store (store .cse0 |v_runThread1of1ForFork0_bounded_spsc_enq_#t~mem811#1.base_32| v_ArrVal_3221) |c_~#g_queue~0.base| v_ArrVal_3223) |c_~#g_points~0.base|) (+ |c_~#g_points~0.offset| (* v_z_3 4)))))))) is different from false [2024-11-13 06:52:35,786 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_z_3 Int) (v_ArrVal_3220 (Array Int Int)) (v_ArrVal_3221 (Array Int Int)) (v_ArrVal_3223 (Array Int Int)) (|v_runThread1of1ForFork0_bounded_spsc_enq_#t~mem811#1.base_32| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_~#g_points~0.base|) |c_~#g_points~0.offset|) v_ArrVal_3220))) (or (< (select (select .cse0 |c_~#g_queue~0.base|) |c_~#g_queue~0.offset|) |v_runThread1of1ForFork0_bounded_spsc_enq_#t~mem811#1.base_32|) (< 2 v_z_3) (< v_z_3 0) (not (= (select (select (store (store .cse0 |v_runThread1of1ForFork0_bounded_spsc_enq_#t~mem811#1.base_32| v_ArrVal_3221) |c_~#g_queue~0.base| v_ArrVal_3223) |c_~#g_points~0.base|) (+ |c_~#g_points~0.offset| (* v_z_3 4))) |c_ULTIMATE.start_main_~#t~0#1.base|))))) is different from false [2024-11-13 06:52:35,910 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_z_3 Int) (v_ArrVal_3220 (Array Int Int)) (v_ArrVal_3221 (Array Int Int)) (v_ArrVal_3223 (Array Int Int)) (|v_runThread1of1ForFork0_bounded_spsc_enq_#t~mem811#1.base_32| Int) (v_ArrVal_3218 (Array Int Int))) (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_3218))) (store .cse1 (select (select .cse1 |c_~#g_points~0.base|) |c_~#g_points~0.offset|) v_ArrVal_3220)))) (or (< 2 v_z_3) (not (= (select (select (store (store .cse0 |v_runThread1of1ForFork0_bounded_spsc_enq_#t~mem811#1.base_32| v_ArrVal_3221) |c_~#g_queue~0.base| v_ArrVal_3223) |c_~#g_points~0.base|) (+ |c_~#g_points~0.offset| (* v_z_3 4))) |c_ULTIMATE.start_main_~#t~0#1.base|)) (< (select (select .cse0 |c_~#g_queue~0.base|) |c_~#g_queue~0.offset|) |v_runThread1of1ForFork0_bounded_spsc_enq_#t~mem811#1.base_32|) (< v_z_3 0)))) is different from false [2024-11-13 06:55:14,123 INFO L349 Elim1Store]: treesize reduction 57, result has 50.4 percent of original size [2024-11-13 06:55:14,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 68997 treesize of output 68783 [2024-11-13 06:55:15,372 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:55:15,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4746 treesize of output 4723 [2024-11-13 06:55:15,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:55:15,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4710 treesize of output 4669 [2024-11-13 06:55:15,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4640 treesize of output 4592 [2024-11-13 06:55:16,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4592 treesize of output 4496 [2024-11-13 06:55:16,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4496 treesize of output 4424 [2024-11-13 06:55:16,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:55:16,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4424 treesize of output 4395 [2024-11-13 06:55:16,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4366 treesize of output 4330 [2024-11-13 06:55:16,746 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:55:16,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4330 treesize of output 4313 [2024-11-13 06:55:17,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:55:17,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51780 treesize of output 50002 [2024-11-13 06:55:17,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4408 treesize of output 4384 [2024-11-13 06:55:17,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:55:17,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4384 treesize of output 4373 [2024-11-13 06:55:17,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:55:17,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4360 treesize of output 4345 [2024-11-13 06:55:18,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4316 treesize of output 4268 [2024-11-13 06:55:18,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4268 treesize of output 4244 [2024-11-13 06:55:18,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:55:18,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4244 treesize of output 4229 [2024-11-13 06:55:18,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:55:18,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4216 treesize of output 4207 [2024-11-13 06:55:18,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4178 treesize of output 4130 [2024-11-13 06:55:19,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:55:19,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4130 treesize of output 4119 [2024-11-13 06:55:19,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4049 treesize of output 4025 [2024-11-13 06:55:19,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:55:19,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4025 treesize of output 4014 [2024-11-13 06:55:20,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3985 treesize of output 3937 [2024-11-13 07:01:00,561 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-13 07:01:00,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2024-11-13 07:01:00,563 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-13 07:01:00,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-13 07:01:00,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-13 07:01:00,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-11-13 07:01:00,940 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:111) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:584) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:728) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.pushInner(QuantifierPusher.java:274) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:194) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.pushInner(QuantifierPusher.java:274) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:194) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:324) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 74 more [2024-11-13 07:01:00,944 INFO L158 Benchmark]: Toolchain (without parser) took 605892.91ms. Allocated memory was 167.8MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 102.8MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-11-13 07:01:00,944 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 167.8MB. Free memory is still 130.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 07:01:00,945 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2823.62ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 102.3MB in the beginning and 128.7MB in the end (delta: -26.4MB). Peak memory consumption was 134.5MB. Max. memory is 16.1GB. [2024-11-13 07:01:00,945 INFO L158 Benchmark]: Boogie Procedure Inliner took 182.44ms. Allocated memory is still 243.3MB. Free memory was 128.7MB in the beginning and 117.1MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-13 07:01:00,945 INFO L158 Benchmark]: Boogie Preprocessor took 94.10ms. Allocated memory is still 243.3MB. Free memory was 117.1MB in the beginning and 110.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-13 07:01:00,945 INFO L158 Benchmark]: RCFGBuilder took 1354.77ms. Allocated memory is still 243.3MB. Free memory was 110.8MB in the beginning and 122.8MB in the end (delta: -12.0MB). Peak memory consumption was 36.3MB. Max. memory is 16.1GB. [2024-11-13 07:01:00,945 INFO L158 Benchmark]: TraceAbstraction took 601431.90ms. Allocated memory was 243.3MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 121.8MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-11-13 07:01:00,946 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 167.8MB. Free memory is still 130.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2823.62ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 102.3MB in the beginning and 128.7MB in the end (delta: -26.4MB). Peak memory consumption was 134.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 182.44ms. Allocated memory is still 243.3MB. Free memory was 128.7MB in the beginning and 117.1MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 94.10ms. Allocated memory is still 243.3MB. Free memory was 117.1MB in the beginning and 110.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1354.77ms. Allocated memory is still 243.3MB. Free memory was 110.8MB in the beginning and 122.8MB in the end (delta: -12.0MB). Peak memory consumption was 36.3MB. Max. memory is 16.1GB. * TraceAbstraction took 601431.90ms. Allocated memory was 243.3MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 121.8MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 4397]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4397] - GenericResultAtLocation [Line: 4399]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4399] - GenericResultAtLocation [Line: 4404]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4404] - GenericResultAtLocation [Line: 4406]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4406] - GenericResultAtLocation [Line: 4412]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4412] - GenericResultAtLocation [Line: 4414]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4414] - GenericResultAtLocation [Line: 4420]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4420] - GenericResultAtLocation [Line: 4422]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4422] - GenericResultAtLocation [Line: 4428]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4428] - GenericResultAtLocation [Line: 4430]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4430] - GenericResultAtLocation [Line: 4436]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4436] - GenericResultAtLocation [Line: 4438]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4438] - GenericResultAtLocation [Line: 4444]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4444] - GenericResultAtLocation [Line: 4446]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4446] - GenericResultAtLocation [Line: 4452]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4452] - GenericResultAtLocation [Line: 4454]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4454] - GenericResultAtLocation [Line: 4459]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4459] - GenericResultAtLocation [Line: 4461]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4461] - GenericResultAtLocation [Line: 4466]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4466] - GenericResultAtLocation [Line: 4468]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4468] - GenericResultAtLocation [Line: 4473]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4473] - GenericResultAtLocation [Line: 4475]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4475] - GenericResultAtLocation [Line: 4480]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4480] - GenericResultAtLocation [Line: 4482]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4482] - GenericResultAtLocation [Line: 4487]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4487] - GenericResultAtLocation [Line: 4489]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4489] - GenericResultAtLocation [Line: 4494]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4494] - GenericResultAtLocation [Line: 4497]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4497] - GenericResultAtLocation [Line: 4503]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4503] - GenericResultAtLocation [Line: 4506]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4506] - GenericResultAtLocation [Line: 4512]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4512] - GenericResultAtLocation [Line: 4515]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4515] - GenericResultAtLocation [Line: 4521]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4521] - GenericResultAtLocation [Line: 4524]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4524] - GenericResultAtLocation [Line: 4530]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4530] - GenericResultAtLocation [Line: 4533]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4533] - GenericResultAtLocation [Line: 4539]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4539] - GenericResultAtLocation [Line: 4542]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4542] - GenericResultAtLocation [Line: 4549]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4549] - GenericResultAtLocation [Line: 4552]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4552] - GenericResultAtLocation [Line: 4559]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4559] - GenericResultAtLocation [Line: 4562]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4562] - GenericResultAtLocation [Line: 4569]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4569] - GenericResultAtLocation [Line: 4572]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4572] - GenericResultAtLocation [Line: 4579]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4579] - GenericResultAtLocation [Line: 4582]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4582] - GenericResultAtLocation [Line: 4589]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4589] - GenericResultAtLocation [Line: 4592]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4592] - GenericResultAtLocation [Line: 4599]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4599] - GenericResultAtLocation [Line: 4602]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4602] - GenericResultAtLocation [Line: 4608]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4608] - GenericResultAtLocation [Line: 4611]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4611] - GenericResultAtLocation [Line: 4617]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4617] - GenericResultAtLocation [Line: 4620]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4620] - GenericResultAtLocation [Line: 4626]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4626] - GenericResultAtLocation [Line: 4629]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4629] - GenericResultAtLocation [Line: 4635]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4635] - GenericResultAtLocation [Line: 4638]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4638] - GenericResultAtLocation [Line: 4644]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4644] - GenericResultAtLocation [Line: 4647]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4647] - GenericResultAtLocation [Line: 4653]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4653] - GenericResultAtLocation [Line: 4656]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4656] - GenericResultAtLocation [Line: 4662]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4662] - GenericResultAtLocation [Line: 4665]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4665] - GenericResultAtLocation [Line: 4671]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4671] - GenericResultAtLocation [Line: 4674]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4674] - GenericResultAtLocation [Line: 4680]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4680] - GenericResultAtLocation [Line: 4683]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4683] - GenericResultAtLocation [Line: 4689]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4689] - GenericResultAtLocation [Line: 4692]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4692] - GenericResultAtLocation [Line: 4698]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4698] - GenericResultAtLocation [Line: 4701]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4701] - GenericResultAtLocation [Line: 4707]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4707] - GenericResultAtLocation [Line: 4710]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4710] - GenericResultAtLocation [Line: 4716]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4716] - GenericResultAtLocation [Line: 4719]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4719] - GenericResultAtLocation [Line: 4725]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4725] - GenericResultAtLocation [Line: 4728]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4728] - GenericResultAtLocation [Line: 4734]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4734] - GenericResultAtLocation [Line: 4737]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4737] - GenericResultAtLocation [Line: 4743]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4743] - GenericResultAtLocation [Line: 4745]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4745] - GenericResultAtLocation [Line: 4751]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4751] - GenericResultAtLocation [Line: 4753]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4753] - GenericResultAtLocation [Line: 4759]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4759] - GenericResultAtLocation [Line: 4761]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4761] - GenericResultAtLocation [Line: 4767]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4767] - GenericResultAtLocation [Line: 4769]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4769] - GenericResultAtLocation [Line: 4775]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4775] - GenericResultAtLocation [Line: 4777]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4777] - GenericResultAtLocation [Line: 4783]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4783] - GenericResultAtLocation [Line: 4785]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4785] - GenericResultAtLocation [Line: 4791]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4791] - GenericResultAtLocation [Line: 4793]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4793] - GenericResultAtLocation [Line: 4799]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4799] - GenericResultAtLocation [Line: 4801]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4801] - GenericResultAtLocation [Line: 4807]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4807] - GenericResultAtLocation [Line: 4809]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4809] - GenericResultAtLocation [Line: 4815]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4815] - GenericResultAtLocation [Line: 4817]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4817] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/libvsync/bounded_spsc.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 93808a150a8803e907bade039c6d51db8f9a81931409074d169ee410e6e3b34e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-13 07:01:03,037 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 07:01:03,119 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Bitvector.epf [2024-11-13 07:01:03,125 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 07:01:03,125 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 07:01:03,155 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 07:01:03,157 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 07:01:03,158 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 07:01:03,160 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 07:01:03,160 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 07:01:03,161 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 07:01:03,162 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 07:01:03,162 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 07:01:03,162 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 07:01:03,164 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 07:01:03,164 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 07:01:03,165 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 07:01:03,165 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 07:01:03,165 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 07:01:03,165 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 07:01:03,166 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 07:01:03,166 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-13 07:01:03,167 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 07:01:03,167 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 07:01:03,168 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 07:01:03,168 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 07:01:03,170 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 07:01:03,171 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 07:01:03,171 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 07:01:03,171 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 07:01:03,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 07:01:03,171 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 07:01:03,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 07:01:03,172 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 07:01:03,172 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 07:01:03,172 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 07:01:03,172 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-13 07:01:03,177 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 07:01:03,177 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 07:01:03,177 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-11-13 07:01:03,177 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-13 07:01:03,178 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-13 07:01:03,178 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-13 07:01:03,179 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 93808a150a8803e907bade039c6d51db8f9a81931409074d169ee410e6e3b34e [2024-11-13 07:01:03,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 07:01:03,513 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 07:01:03,515 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 07:01:03,517 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 07:01:03,517 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 07:01:03,518 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/libvsync/bounded_spsc.i [2024-11-13 07:01:04,965 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 07:01:05,381 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 07:01:05,382 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_spsc.i [2024-11-13 07:01:05,428 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5477f605c/ee9a3df195df48eaab31be5bfd1dac49/FLAG8545e81fa [2024-11-13 07:01:05,441 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5477f605c/ee9a3df195df48eaab31be5bfd1dac49 [2024-11-13 07:01:05,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 07:01:05,445 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 07:01:05,447 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 07:01:05,448 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 07:01:05,453 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 07:01:05,453 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 07:01:05" (1/1) ... [2024-11-13 07:01:05,454 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50f25122 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 07:01:05, skipping insertion in model container [2024-11-13 07:01:05,454 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 07:01:05" (1/1) ... [2024-11-13 07:01:05,542 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 07:01:07,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 07:01:07,333 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 07:01:07,459 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4397] [2024-11-13 07:01:07,460 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4399] [2024-11-13 07:01:07,461 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4404] [2024-11-13 07:01:07,464 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4406] [2024-11-13 07:01:07,464 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4412] [2024-11-13 07:01:07,466 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4414] [2024-11-13 07:01:07,467 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4420] [2024-11-13 07:01:07,467 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4422] [2024-11-13 07:01:07,468 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4428] [2024-11-13 07:01:07,469 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4430] [2024-11-13 07:01:07,470 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4436] [2024-11-13 07:01:07,470 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4438] [2024-11-13 07:01:07,471 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4444] [2024-11-13 07:01:07,471 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4446] [2024-11-13 07:01:07,474 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4452] [2024-11-13 07:01:07,475 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4454] [2024-11-13 07:01:07,475 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4459] [2024-11-13 07:01:07,475 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4461] [2024-11-13 07:01:07,476 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4466] [2024-11-13 07:01:07,476 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4468] [2024-11-13 07:01:07,476 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4473] [2024-11-13 07:01:07,477 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4475] [2024-11-13 07:01:07,477 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4480] [2024-11-13 07:01:07,477 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4482] [2024-11-13 07:01:07,478 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4487] [2024-11-13 07:01:07,478 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4489] [2024-11-13 07:01:07,478 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4494] [2024-11-13 07:01:07,479 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4497] [2024-11-13 07:01:07,480 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4503] [2024-11-13 07:01:07,481 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4506] [2024-11-13 07:01:07,481 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4512] [2024-11-13 07:01:07,482 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4515] [2024-11-13 07:01:07,483 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4521] [2024-11-13 07:01:07,484 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4524] [2024-11-13 07:01:07,485 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4530] [2024-11-13 07:01:07,487 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4533] [2024-11-13 07:01:07,487 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4539] [2024-11-13 07:01:07,488 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4542] [2024-11-13 07:01:07,489 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4549] [2024-11-13 07:01:07,490 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4552] [2024-11-13 07:01:07,490 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4559] [2024-11-13 07:01:07,491 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4562] [2024-11-13 07:01:07,493 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4569] [2024-11-13 07:01:07,494 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4572] [2024-11-13 07:01:07,494 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4579] [2024-11-13 07:01:07,495 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4582] [2024-11-13 07:01:07,496 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4589] [2024-11-13 07:01:07,496 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4592] [2024-11-13 07:01:07,497 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4599] [2024-11-13 07:01:07,498 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4602] [2024-11-13 07:01:07,499 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4608] [2024-11-13 07:01:07,500 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4611] [2024-11-13 07:01:07,500 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4617] [2024-11-13 07:01:07,501 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4620] [2024-11-13 07:01:07,501 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4626] [2024-11-13 07:01:07,502 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4629] [2024-11-13 07:01:07,502 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4635] [2024-11-13 07:01:07,503 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4638] [2024-11-13 07:01:07,503 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4644] [2024-11-13 07:01:07,504 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4647] [2024-11-13 07:01:07,504 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4653] [2024-11-13 07:01:07,505 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4656] [2024-11-13 07:01:07,505 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4662] [2024-11-13 07:01:07,506 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4665] [2024-11-13 07:01:07,506 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4671] [2024-11-13 07:01:07,507 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4674] [2024-11-13 07:01:07,507 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4680] [2024-11-13 07:01:07,508 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4683] [2024-11-13 07:01:07,508 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4689] [2024-11-13 07:01:07,509 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4692] [2024-11-13 07:01:07,509 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4698] [2024-11-13 07:01:07,510 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4701] [2024-11-13 07:01:07,510 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4707] [2024-11-13 07:01:07,511 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4710] [2024-11-13 07:01:07,511 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4716] [2024-11-13 07:01:07,513 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4719] [2024-11-13 07:01:07,514 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4725] [2024-11-13 07:01:07,515 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4728] [2024-11-13 07:01:07,515 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4734] [2024-11-13 07:01:07,516 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4737] [2024-11-13 07:01:07,516 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4743] [2024-11-13 07:01:07,518 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4745] [2024-11-13 07:01:07,518 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4751] [2024-11-13 07:01:07,519 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4753] [2024-11-13 07:01:07,535 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4759] [2024-11-13 07:01:07,537 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4761] [2024-11-13 07:01:07,538 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4767] [2024-11-13 07:01:07,539 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4769] [2024-11-13 07:01:07,539 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4775] [2024-11-13 07:01:07,540 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4777] [2024-11-13 07:01:07,540 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4783] [2024-11-13 07:01:07,541 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4785] [2024-11-13 07:01:07,541 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4791] [2024-11-13 07:01:07,542 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4793] [2024-11-13 07:01:07,542 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4799] [2024-11-13 07:01:07,544 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4801] [2024-11-13 07:01:07,544 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4807] [2024-11-13 07:01:07,546 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4809] [2024-11-13 07:01:07,546 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4815] [2024-11-13 07:01:07,547 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4817] [2024-11-13 07:01:07,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 07:01:07,924 INFO L204 MainTranslator]: Completed translation [2024-11-13 07:01:07,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 07:01:07 WrapperNode [2024-11-13 07:01:07,926 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 07:01:07,930 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 07:01:07,930 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 07:01:07,930 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 07:01:07,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 07:01:07" (1/1) ... [2024-11-13 07:01:08,068 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 07:01:07" (1/1) ... [2024-11-13 07:01:08,132 INFO L138 Inliner]: procedures = 956, calls = 963, calls flagged for inlining = 823, calls inlined = 39, statements flattened = 609 [2024-11-13 07:01:08,133 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 07:01:08,137 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 07:01:08,137 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 07:01:08,137 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 07:01:08,153 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 07:01:07" (1/1) ... [2024-11-13 07:01:08,154 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 07:01:07" (1/1) ... [2024-11-13 07:01:08,165 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 07:01:07" (1/1) ... [2024-11-13 07:01:08,167 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 07:01:07" (1/1) ... [2024-11-13 07:01:08,210 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 07:01:07" (1/1) ... [2024-11-13 07:01:08,222 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 07:01:07" (1/1) ... [2024-11-13 07:01:08,226 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 07:01:07" (1/1) ... [2024-11-13 07:01:08,234 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 07:01:07" (1/1) ... [2024-11-13 07:01:08,249 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 07:01:08,250 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 07:01:08,250 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 07:01:08,251 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 07:01:08,252 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 07:01:07" (1/1) ... [2024-11-13 07:01:08,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 07:01:08,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 07:01:08,285 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-13 07:01:08,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-13 07:01:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 07:01:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 07:01:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-13 07:01:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 07:01:08,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 07:01:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure run [2024-11-13 07:01:08,334 INFO L138 BoogieDeclarations]: Found implementation of procedure run [2024-11-13 07:01:08,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 07:01:08,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-13 07:01:08,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 07:01:08,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-13 07:01:08,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2024-11-13 07:01:08,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-13 07:01:08,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-13 07:01:08,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-13 07:01:08,336 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 07:01:08,522 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 07:01:08,524 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 07:01:09,976 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 07:01:09,977 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 07:01:10,060 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 07:01:10,060 INFO L316 CfgBuilder]: Removed 51 assume(true) statements. [2024-11-13 07:01:10,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 07:01:10 BoogieIcfgContainer [2024-11-13 07:01:10,061 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 07:01:10,066 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 07:01:10,066 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 07:01:10,069 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 07:01:10,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 07:01:05" (1/3) ... [2024-11-13 07:01:10,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b226ad4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 07:01:10, skipping insertion in model container [2024-11-13 07:01:10,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 07:01:07" (2/3) ... [2024-11-13 07:01:10,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b226ad4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 07:01:10, skipping insertion in model container [2024-11-13 07:01:10,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 07:01:10" (3/3) ... [2024-11-13 07:01:10,072 INFO L112 eAbstractionObserver]: Analyzing ICFG bounded_spsc.i [2024-11-13 07:01:10,087 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 07:01:10,087 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2024-11-13 07:01:10,087 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 07:01:10,336 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-13 07:01:10,394 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 07:01:10,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-13 07:01:10,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 07:01:10,397 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-13 07:01:10,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-13 07:01:10,428 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 07:01:10,439 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == runThread1of1ForFork0 ======== [2024-11-13 07:01:10,445 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@29727b25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 07:01:10,445 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2024-11-13 07:01:11,132 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting runErr0ASSERT_VIOLATIONDATA_RACE === [runErr0ASSERT_VIOLATIONDATA_RACE, runErr17ASSERT_VIOLATIONDATA_RACE, runErr1ASSERT_VIOLATIONDATA_RACE, runErr18ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-13 07:01:11,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:01:11,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1680636951, now seen corresponding path program 1 times [2024-11-13 07:01:11,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-13 07:01:11,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [942854971] [2024-11-13 07:01:11,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:01:11,156 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 07:01:11,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-11-13 07:01:11,173 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 07:01:11,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-13 07:01:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:01:11,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 07:01:11,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 07:01:11,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 07:01:11,429 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 07:01:11,430 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-13 07:01:11,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [942854971] [2024-11-13 07:01:11,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [942854971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:01:11,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:01:11,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 07:01:11,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72693194] [2024-11-13 07:01:11,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:01:11,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 07:01:11,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-13 07:01:11,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 07:01:11,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 07:01:11,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:01:11,477 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:01:11,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 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) [2024-11-13 07:01:11,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:01:11,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:01:11,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-13 07:01:11,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 07:01:11,829 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting runErr0ASSERT_VIOLATIONDATA_RACE === [runErr0ASSERT_VIOLATIONDATA_RACE, runErr17ASSERT_VIOLATIONDATA_RACE, runErr1ASSERT_VIOLATIONDATA_RACE, runErr18ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-13 07:01:11,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:01:11,830 INFO L85 PathProgramCache]: Analyzing trace with hash 94690086, now seen corresponding path program 1 times [2024-11-13 07:01:11,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-13 07:01:11,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [662058553] [2024-11-13 07:01:11,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:01:11,831 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 07:01:11,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-11-13 07:01:11,834 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 07:01:11,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-13 07:01:12,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:01:12,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 07:01:12,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 07:01:12,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 07:01:12,120 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 07:01:12,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 07:01:12,202 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-13 07:01:12,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [662058553] [2024-11-13 07:01:12,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [662058553] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 07:01:12,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 07:01:12,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-13 07:01:12,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719398506] [2024-11-13 07:01:12,206 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 07:01:12,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 07:01:12,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-13 07:01:12,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 07:01:12,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-13 07:01:12,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:01:12,212 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:01:12,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.375) internal successors, (163), 8 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:01:12,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:01:12,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:01:12,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:01:12,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:01:12,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-13 07:01:12,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 07:01:12,769 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting runErr0ASSERT_VIOLATIONDATA_RACE === [runErr0ASSERT_VIOLATIONDATA_RACE, runErr17ASSERT_VIOLATIONDATA_RACE, runErr1ASSERT_VIOLATIONDATA_RACE, runErr18ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-13 07:01:12,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:01:12,770 INFO L85 PathProgramCache]: Analyzing trace with hash -2074761632, now seen corresponding path program 2 times [2024-11-13 07:01:12,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-13 07:01:12,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1008612985] [2024-11-13 07:01:12,771 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 07:01:12,772 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 07:01:12,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-11-13 07:01:12,773 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 07:01:12,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-13 07:01:13,003 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-13 07:01:13,004 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 07:01:13,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 07:01:13,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 07:01:13,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-13 07:01:13,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2024-11-13 07:01:13,101 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:01:13,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 46 [2024-11-13 07:01:13,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:01:13,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 63 [2024-11-13 07:01:13,190 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 07:01:13,192 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 07:01:13,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-13 07:01:13,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1008612985] [2024-11-13 07:01:13,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1008612985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:01:13,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:01:13,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 07:01:13,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518258905] [2024-11-13 07:01:13,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:01:13,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 07:01:13,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-13 07:01:13,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 07:01:13,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 07:01:13,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:01:13,199 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:01:13,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 27.8) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:01:13,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:01:13,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:01:13,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:01:14,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:01:14,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:01:14,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:14,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-13 07:01:14,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 07:01:14,571 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting runErr1ASSERT_VIOLATIONDATA_RACE === [runErr0ASSERT_VIOLATIONDATA_RACE, runErr17ASSERT_VIOLATIONDATA_RACE, runErr1ASSERT_VIOLATIONDATA_RACE, runErr18ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-13 07:01:14,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:01:14,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1045978308, now seen corresponding path program 1 times [2024-11-13 07:01:14,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-13 07:01:14,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [936741060] [2024-11-13 07:01:14,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:01:14,573 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 07:01:14,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-11-13 07:01:14,574 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 07:01:14,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-13 07:01:14,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:01:14,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 07:01:14,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 07:01:14,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-13 07:01:14,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2024-11-13 07:01:14,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:01:14,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 42 [2024-11-13 07:01:14,991 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:01:14,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 58 [2024-11-13 07:01:15,030 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 07:01:15,030 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 07:01:15,030 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-13 07:01:15,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [936741060] [2024-11-13 07:01:15,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [936741060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:01:15,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:01:15,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 07:01:15,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277989199] [2024-11-13 07:01:15,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:01:15,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 07:01:15,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-13 07:01:15,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 07:01:15,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 07:01:15,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:01:15,034 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:01:15,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 29.6) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:01:15,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:01:15,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:01:15,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:15,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:01:15,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:01:15,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:01:15,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:15,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:15,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-13 07:01:15,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 07:01:15,786 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting runErr2ASSERT_VIOLATIONDATA_RACE === [runErr0ASSERT_VIOLATIONDATA_RACE, runErr17ASSERT_VIOLATIONDATA_RACE, runErr1ASSERT_VIOLATIONDATA_RACE, runErr18ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-13 07:01:15,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:01:15,787 INFO L85 PathProgramCache]: Analyzing trace with hash 949081249, now seen corresponding path program 1 times [2024-11-13 07:01:15,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-13 07:01:15,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1227031727] [2024-11-13 07:01:15,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:01:15,788 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 07:01:15,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-11-13 07:01:15,791 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 07:01:15,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-13 07:01:16,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:01:16,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 07:01:16,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 07:01:16,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-11-13 07:01:16,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2024-11-13 07:01:16,209 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:01:16,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 44 [2024-11-13 07:01:16,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:01:16,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 60 [2024-11-13 07:01:16,284 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 07:01:16,284 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 07:01:16,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-13 07:01:16,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1227031727] [2024-11-13 07:01:16,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1227031727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:01:16,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:01:16,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 07:01:16,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964926117] [2024-11-13 07:01:16,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:01:16,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 07:01:16,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-13 07:01:16,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 07:01:16,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 07:01:16,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:01:16,289 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:01:16,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 31.2) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:01:16,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:01:16,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:01:16,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:16,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:16,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:01:17,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:01:17,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:01:17,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:17,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:17,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:17,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-13 07:01:18,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 07:01:18,147 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting runErr5ASSERT_VIOLATIONDATA_RACE === [runErr0ASSERT_VIOLATIONDATA_RACE, runErr17ASSERT_VIOLATIONDATA_RACE, runErr1ASSERT_VIOLATIONDATA_RACE, runErr18ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-13 07:01:18,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:01:18,147 INFO L85 PathProgramCache]: Analyzing trace with hash -370680423, now seen corresponding path program 1 times [2024-11-13 07:01:18,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-13 07:01:18,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2051148220] [2024-11-13 07:01:18,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:01:18,148 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 07:01:18,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-11-13 07:01:18,151 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 07:01:18,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-13 07:01:18,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:01:18,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-13 07:01:18,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 07:01:18,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 07:01:18,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2024-11-13 07:01:18,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:01:18,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 38 [2024-11-13 07:01:18,625 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:01:18,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 52 [2024-11-13 07:01:18,649 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 07:01:18,649 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 07:01:18,649 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-13 07:01:18,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2051148220] [2024-11-13 07:01:18,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2051148220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:01:18,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:01:18,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 07:01:18,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607078644] [2024-11-13 07:01:18,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:01:18,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 07:01:18,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-13 07:01:18,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 07:01:18,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 07:01:18,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:01:18,652 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:01:18,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 43.6) internal successors, (218), 6 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:01:18,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:01:18,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:01:18,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:18,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:18,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:18,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:01:20,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:01:20,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:01:20,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:20,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:20,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:20,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:20,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-13 07:01:20,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 07:01:20,604 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting runErr6ASSERT_VIOLATIONDATA_RACE === [runErr0ASSERT_VIOLATIONDATA_RACE, runErr17ASSERT_VIOLATIONDATA_RACE, runErr1ASSERT_VIOLATIONDATA_RACE, runErr18ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-13 07:01:20,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:01:20,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1153843991, now seen corresponding path program 1 times [2024-11-13 07:01:20,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-13 07:01:20,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1527704961] [2024-11-13 07:01:20,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:01:20,606 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 07:01:20,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-11-13 07:01:20,607 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 07:01:20,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-13 07:01:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:01:21,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 07:01:21,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 07:01:21,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 07:01:21,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2024-11-13 07:01:21,071 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:01:21,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 36 [2024-11-13 07:01:21,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:01:21,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 50 [2024-11-13 07:01:21,116 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 07:01:21,116 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 07:01:21,116 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-13 07:01:21,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1527704961] [2024-11-13 07:01:21,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1527704961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:01:21,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:01:21,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 07:01:21,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399149103] [2024-11-13 07:01:21,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:01:21,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 07:01:21,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-13 07:01:21,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 07:01:21,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 07:01:21,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:01:21,120 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:01:21,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 45.2) internal successors, (226), 6 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:01:21,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:01:21,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:01:21,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:21,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:21,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:21,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:21,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:01:22,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:01:22,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:01:22,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:22,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:22,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:22,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:22,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:22,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-13 07:01:23,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 07:01:23,018 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting runErr8ASSERT_VIOLATIONDATA_RACE === [runErr0ASSERT_VIOLATIONDATA_RACE, runErr17ASSERT_VIOLATIONDATA_RACE, runErr1ASSERT_VIOLATIONDATA_RACE, runErr18ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-13 07:01:23,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:01:23,019 INFO L85 PathProgramCache]: Analyzing trace with hash 2137356879, now seen corresponding path program 1 times [2024-11-13 07:01:23,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-13 07:01:23,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2139222658] [2024-11-13 07:01:23,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:01:23,020 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 07:01:23,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-11-13 07:01:23,022 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 07:01:23,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-13 07:01:23,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:01:23,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 07:01:23,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 07:01:23,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2024-11-13 07:01:23,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2024-11-13 07:01:23,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:01:23,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 58 [2024-11-13 07:01:23,874 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:01:23,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 79 [2024-11-13 07:01:23,999 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 07:01:23,999 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 07:01:24,000 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-13 07:01:24,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2139222658] [2024-11-13 07:01:24,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2139222658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:01:24,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:01:24,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 07:01:24,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981672853] [2024-11-13 07:01:24,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:01:24,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 07:01:24,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-13 07:01:24,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 07:01:24,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 07:01:24,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:01:24,003 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:01:24,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 47.8) internal successors, (239), 6 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:01:24,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:01:24,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:01:24,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:24,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:24,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:24,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:24,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:24,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:01:44,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:01:44,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:01:44,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:44,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:44,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:44,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:44,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:44,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:44,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-13 07:01:44,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 07:01:44,344 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting runErr8ASSERT_VIOLATIONDATA_RACE === [runErr0ASSERT_VIOLATIONDATA_RACE, runErr17ASSERT_VIOLATIONDATA_RACE, runErr1ASSERT_VIOLATIONDATA_RACE, runErr18ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-13 07:01:44,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:01:44,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1944844028, now seen corresponding path program 1 times [2024-11-13 07:01:44,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-13 07:01:44,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [538046826] [2024-11-13 07:01:44,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:01:44,346 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 07:01:44,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-11-13 07:01:44,347 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 07:01:44,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-13 07:01:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:01:45,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 1604 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 07:01:45,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 07:01:45,070 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 370 proven. 0 refuted. 0 times theorem prover too weak. 443 trivial. 0 not checked. [2024-11-13 07:01:45,071 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 07:01:45,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-13 07:01:45,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [538046826] [2024-11-13 07:01:45,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [538046826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:01:45,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:01:45,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 07:01:45,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232973022] [2024-11-13 07:01:45,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:01:45,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 07:01:45,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-13 07:01:45,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 07:01:45,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 07:01:45,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:01:45,075 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:01:45,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:01:45,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:01:45,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:01:45,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:45,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:45,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:45,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:45,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:45,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:45,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:01:45,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:01:45,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:01:45,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:45,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:45,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:45,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:45,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:45,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:01:45,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:01:45,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-13 07:01:45,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 07:01:45,726 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting runErr2ASSERT_VIOLATIONDATA_RACE === [runErr0ASSERT_VIOLATIONDATA_RACE, runErr17ASSERT_VIOLATIONDATA_RACE, runErr1ASSERT_VIOLATIONDATA_RACE, runErr18ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-13 07:01:45,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:01:45,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1213688295, now seen corresponding path program 1 times [2024-11-13 07:01:45,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-13 07:01:45,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [29032884] [2024-11-13 07:01:45,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:01:45,728 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 07:01:45,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-11-13 07:01:45,729 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 07:01:45,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-13 07:01:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:01:46,779 INFO L255 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 100 conjuncts are in the unsatisfiable core [2024-11-13 07:01:46,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 07:01:49,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 07:01:49,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:01:51,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:01:52,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:01:53,739 INFO L349 Elim1Store]: treesize reduction 78, result has 40.5 percent of original size [2024-11-13 07:01:53,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 14 select indices, 14 select index equivalence classes, 79 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 13 case distinctions, treesize of input 97 treesize of output 121 [2024-11-13 07:01:53,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:01:55,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 77 [2024-11-13 07:01:57,519 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:01:57,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 89 [2024-11-13 07:01:59,780 INFO L349 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2024-11-13 07:01:59,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 144 treesize of output 112 [2024-11-13 07:02:01,849 INFO L349 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2024-11-13 07:02:01,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 151 treesize of output 117 [2024-11-13 07:02:02,437 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2024-11-13 07:02:02,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 152 treesize of output 126 [2024-11-13 07:02:08,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 112 [2024-11-13 07:02:09,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 107 [2024-11-13 07:02:11,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:02:11,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 66 [2024-11-13 07:02:11,943 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2024-11-13 07:02:12,177 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2024-11-13 07:02:12,246 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2024-11-13 07:02:12,315 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2024-11-13 07:02:12,379 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2024-11-13 07:02:12,447 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2024-11-13 07:02:12,501 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2024-11-13 07:02:12,741 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2024-11-13 07:02:12,797 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2024-11-13 07:02:12,850 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2024-11-13 07:02:12,897 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2024-11-13 07:02:12,956 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2024-11-13 07:02:12,999 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2024-11-13 07:02:13,052 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2024-11-13 07:02:13,114 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2024-11-13 07:02:13,176 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2024-11-13 07:02:13,236 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2024-11-13 07:02:13,279 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2024-11-13 07:02:13,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-11-13 07:02:13,332 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2024-11-13 07:02:13,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2024-11-13 07:02:13,599 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2024-11-13 07:02:13,906 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2024-11-13 07:02:13,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:02:13,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 44 [2024-11-13 07:02:14,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:02:14,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 60 [2024-11-13 07:02:14,218 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2024-11-13 07:02:14,545 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2024-11-13 07:02:14,618 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2024-11-13 07:02:14,714 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2024-11-13 07:02:14,789 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2024-11-13 07:02:14,874 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2024-11-13 07:02:14,949 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2024-11-13 07:02:15,035 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2024-11-13 07:02:15,111 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2024-11-13 07:02:15,189 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2024-11-13 07:02:15,265 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2024-11-13 07:02:15,341 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2024-11-13 07:02:15,414 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2024-11-13 07:02:15,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:02:15,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 42 [2024-11-13 07:02:15,436 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2024-11-13 07:02:15,826 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 07:02:15,826 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 07:02:15,988 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2124 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2124) |c_runThread1of1ForFork0_~point~0#1.base|) (bvadd (_ bv7 32) |c_runThread1of1ForFork0_~point~0#1.offset|)) |c_runThread1of1ForFork0_#t~nondet791#1|))) (forall ((v_ArrVal_2124 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2124) |c_runThread1of1ForFork0_~point~0#1.base|) (bvadd (_ bv4 32) |c_runThread1of1ForFork0_~point~0#1.offset|)) |c_runThread1of1ForFork0_#t~nondet791#1|))) (forall ((v_ArrVal_2124 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2124) |c_runThread1of1ForFork0_~point~0#1.base|) (bvadd (_ bv5 32) |c_runThread1of1ForFork0_~point~0#1.offset|)) |c_runThread1of1ForFork0_#t~nondet791#1|))) (forall ((v_ArrVal_2124 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2124) |c_runThread1of1ForFork0_~point~0#1.base|) (bvadd (_ bv6 32) |c_runThread1of1ForFork0_~point~0#1.offset|)) |c_runThread1of1ForFork0_#t~nondet791#1|)))) is different from false [2024-11-13 07:02:16,126 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv7 32) |c_runThread1of1ForFork0_~point~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_runThread1of1ForFork0_~point~0#1.base| (store (select |c_#race| |c_runThread1of1ForFork0_~point~0#1.base|) .cse1 |c_runThread1of1ForFork0_#t~nondet791#1|)))) (and (forall ((v_ArrVal_2124 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2124) |c_runThread1of1ForFork0_~point~0#1.base|) (bvadd (_ bv4 32) |c_runThread1of1ForFork0_~point~0#1.offset|)) |c_runThread1of1ForFork0_#t~nondet791#1|))) (forall ((v_ArrVal_2124 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2124) |c_runThread1of1ForFork0_~point~0#1.base|) (bvadd (_ bv6 32) |c_runThread1of1ForFork0_~point~0#1.offset|)) |c_runThread1of1ForFork0_#t~nondet791#1|))) (forall ((v_ArrVal_2124 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2124) |c_runThread1of1ForFork0_~point~0#1.base|) (bvadd (_ bv5 32) |c_runThread1of1ForFork0_~point~0#1.offset|)) |c_runThread1of1ForFork0_#t~nondet791#1|))) (forall ((v_ArrVal_2124 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2124) |c_runThread1of1ForFork0_~point~0#1.base|) .cse1) |c_runThread1of1ForFork0_#t~nondet791#1|) (_ bv0 1)))))) is different from false [2024-11-13 07:02:16,145 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv6 32) |c_runThread1of1ForFork0_~point~0#1.offset|)) (.cse2 (bvadd (_ bv7 32) |c_runThread1of1ForFork0_~point~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_runThread1of1ForFork0_~point~0#1.base| (store (store (select |c_#race| |c_runThread1of1ForFork0_~point~0#1.base|) .cse1 |c_runThread1of1ForFork0_#t~nondet791#1|) .cse2 |c_runThread1of1ForFork0_#t~nondet791#1|)))) (and (forall ((v_ArrVal_2124 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2124) |c_runThread1of1ForFork0_~point~0#1.base|) .cse1) |c_runThread1of1ForFork0_#t~nondet791#1|))) (forall ((v_ArrVal_2124 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2124) |c_runThread1of1ForFork0_~point~0#1.base|) (bvadd (_ bv5 32) |c_runThread1of1ForFork0_~point~0#1.offset|)) |c_runThread1of1ForFork0_#t~nondet791#1|))) (forall ((v_ArrVal_2124 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2124) |c_runThread1of1ForFork0_~point~0#1.base|) .cse2) |c_runThread1of1ForFork0_#t~nondet791#1|) (_ bv0 1))) (forall ((v_ArrVal_2124 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2124) |c_runThread1of1ForFork0_~point~0#1.base|) (bvadd (_ bv4 32) |c_runThread1of1ForFork0_~point~0#1.offset|)) |c_runThread1of1ForFork0_#t~nondet791#1|)))))) is different from false [2024-11-13 07:02:16,167 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv5 32) |c_runThread1of1ForFork0_~point~0#1.offset|)) (.cse1 (bvadd (_ bv6 32) |c_runThread1of1ForFork0_~point~0#1.offset|)) (.cse2 (bvadd (_ bv7 32) |c_runThread1of1ForFork0_~point~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_runThread1of1ForFork0_~point~0#1.base| (store (store (store (select |c_#race| |c_runThread1of1ForFork0_~point~0#1.base|) .cse3 |c_runThread1of1ForFork0_#t~nondet791#1|) .cse1 |c_runThread1of1ForFork0_#t~nondet791#1|) .cse2 |c_runThread1of1ForFork0_#t~nondet791#1|)))) (and (forall ((v_ArrVal_2124 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2124) |c_runThread1of1ForFork0_~point~0#1.base|) .cse1) |c_runThread1of1ForFork0_#t~nondet791#1|))) (forall ((v_ArrVal_2124 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2124) |c_runThread1of1ForFork0_~point~0#1.base|) .cse2) |c_runThread1of1ForFork0_#t~nondet791#1|))) (forall ((v_ArrVal_2124 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_runThread1of1ForFork0_#t~nondet791#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2124) |c_runThread1of1ForFork0_~point~0#1.base|) .cse3)))) (forall ((v_ArrVal_2124 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2124) |c_runThread1of1ForFork0_~point~0#1.base|) (bvadd (_ bv4 32) |c_runThread1of1ForFork0_~point~0#1.offset|)) |c_runThread1of1ForFork0_#t~nondet791#1|)))))) is different from false [2024-11-13 07:02:16,189 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:02:16,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 63 [2024-11-13 07:02:16,198 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:02:16,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 96 treesize of output 42 [2024-11-13 07:02:16,208 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2024-11-13 07:02:16,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 1 [2024-11-13 07:02:16,216 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2024-11-13 07:02:16,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 1 [2024-11-13 07:02:16,223 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2024-11-13 07:02:16,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 1 [2024-11-13 07:02:16,973 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2117 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_runThread1of1ForFork0_vatomic32_write_~a#1.base| v_ArrVal_2117) |c_~#g_points~0.base|) (bvadd (_ bv4 32) |c_~#g_points~0.offset| (bvmul (_ bv4 32) |c_runThread1of1ForFork0_~i~0#1|))) |c_ULTIMATE.start_main_~#t~0#1.base|))) is different from false [2024-11-13 07:02:16,983 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2117 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_runThread1of1ForFork0_vatomic32_write_#in~a#1.base| v_ArrVal_2117) |c_~#g_points~0.base|) (bvadd (_ bv4 32) |c_~#g_points~0.offset| (bvmul (_ bv4 32) |c_runThread1of1ForFork0_~i~0#1|)))))) is different from false [2024-11-13 07:02:17,167 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2117 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_runThread1of1ForFork0_vatomic32_write_rel_#in~a#1.base| v_ArrVal_2117) |c_~#g_points~0.base|) (bvadd (_ bv4 32) |c_~#g_points~0.offset| (bvmul (_ bv4 32) |c_runThread1of1ForFork0_~i~0#1|))) |c_ULTIMATE.start_main_~#t~0#1.base|))) is different from false [2024-11-13 07:02:17,176 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2117 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_runThread1of1ForFork0_bounded_spsc_enq_~q#1.base| v_ArrVal_2117) |c_~#g_points~0.base|) (bvadd (_ bv4 32) |c_~#g_points~0.offset| (bvmul (_ bv4 32) |c_runThread1of1ForFork0_~i~0#1|))) |c_ULTIMATE.start_main_~#t~0#1.base|))) is different from false [2024-11-13 07:02:17,223 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2117 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_runThread1of1ForFork0_bounded_spsc_enq_#t~mem781#1.base| v_ArrVal_2116) |c_runThread1of1ForFork0_bounded_spsc_enq_~q#1.base| v_ArrVal_2117) |c_~#g_points~0.base|) (bvadd (_ bv4 32) |c_~#g_points~0.offset| (bvmul (_ bv4 32) |c_runThread1of1ForFork0_~i~0#1|))) |c_ULTIMATE.start_main_~#t~0#1.base|))) is different from false [2024-11-13 07:02:18,131 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2115 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_runThread1of1ForFork0_~point~0#1.base| v_ArrVal_2115))) (store .cse0 (select (select .cse0 |c_~#g_queue~0.base|) |c_~#g_queue~0.offset|) v_ArrVal_2116)) |c_~#g_queue~0.base| v_ArrVal_2117) |c_~#g_points~0.base|) (bvadd (_ bv4 32) |c_~#g_points~0.offset| (bvmul (_ bv4 32) |c_runThread1of1ForFork0_~i~0#1|))) |c_ULTIMATE.start_main_~#t~0#1.base|))) is different from false [2024-11-13 07:02:18,187 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2115 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_runThread1of1ForFork0_#t~mem789#1.base| v_ArrVal_2115))) (store .cse0 (select (select .cse0 |c_~#g_queue~0.base|) |c_~#g_queue~0.offset|) v_ArrVal_2116)) |c_~#g_queue~0.base| v_ArrVal_2117) |c_~#g_points~0.base|) (bvadd (_ bv4 32) |c_~#g_points~0.offset| (bvmul (_ bv4 32) |c_runThread1of1ForFork0_~i~0#1|))) |c_ULTIMATE.start_main_~#t~0#1.base|))) is different from false [2024-11-13 07:02:18,229 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2115 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse1 (bvmul (_ bv4 32) |c_runThread1of1ForFork0_~i~0#1|))) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_~#g_points~0.base|) (bvadd |c_~#g_points~0.offset| .cse1)) v_ArrVal_2115))) (store .cse0 (select (select .cse0 |c_~#g_queue~0.base|) |c_~#g_queue~0.offset|) v_ArrVal_2116)) |c_~#g_queue~0.base| v_ArrVal_2117) |c_~#g_points~0.base|) (bvadd (_ bv4 32) |c_~#g_points~0.offset| .cse1))) |c_ULTIMATE.start_main_~#t~0#1.base|))) is different from false [2024-11-13 07:02:18,247 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2115 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_~#g_points~0.base|) |c_~#g_points~0.offset|) v_ArrVal_2115))) (store .cse0 (select (select .cse0 |c_~#g_queue~0.base|) |c_~#g_queue~0.offset|) v_ArrVal_2116)) |c_~#g_queue~0.base| v_ArrVal_2117) |c_~#g_points~0.base|) (bvadd (_ bv4 32) |c_~#g_points~0.offset|)) |c_ULTIMATE.start_main_~#t~0#1.base|))) is different from false [2024-11-13 07:02:18,309 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2113 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2115 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2113))) (store .cse1 (select (select .cse1 |c_~#g_points~0.base|) |c_~#g_points~0.offset|) v_ArrVal_2115)))) (store .cse0 (select (select .cse0 |c_~#g_queue~0.base|) |c_~#g_queue~0.offset|) v_ArrVal_2116)) |c_~#g_queue~0.base| v_ArrVal_2117) |c_~#g_points~0.base|) (bvadd (_ bv4 32) |c_~#g_points~0.offset|))))) is different from false [2024-11-13 07:02:18,403 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#t~0#1.base_21| (_ BitVec 32))) (or (not (bvult |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t~0#1.base_21|)) (forall ((v_ArrVal_2113 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2115 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#t~0#1.base_21| v_ArrVal_2113))) (store .cse1 (select (select .cse1 |c_~#g_points~0.base|) |c_~#g_points~0.offset|) v_ArrVal_2115)))) (store .cse0 (select (select .cse0 |c_~#g_queue~0.base|) |c_~#g_queue~0.offset|) v_ArrVal_2116)) |c_~#g_queue~0.base| v_ArrVal_2117) |c_~#g_points~0.base|) (bvadd (_ bv4 32) |c_~#g_points~0.offset|)) |v_ULTIMATE.start_main_~#t~0#1.base_21|))))) is different from false [2024-11-13 07:02:18,648 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#t~0#1.base_21| (_ BitVec 32)) (v_ArrVal_2113 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2115 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2112 (_ BitVec 32))) (or (not (= (select (select (store (let ((.cse0 (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_~#g_points~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#g_points~0.base|) (bvadd |c_~#g_points~0.offset| (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~2#1|)) v_ArrVal_2112)) |v_ULTIMATE.start_main_~#t~0#1.base_21| v_ArrVal_2113))) (store .cse1 (select (select .cse1 |c_~#g_points~0.base|) |c_~#g_points~0.offset|) v_ArrVal_2115)))) (store .cse0 (select (select .cse0 |c_~#g_queue~0.base|) |c_~#g_queue~0.offset|) v_ArrVal_2116)) |c_~#g_queue~0.base| v_ArrVal_2117) |c_~#g_points~0.base|) (bvadd (_ bv4 32) |c_~#g_points~0.offset|)) |v_ULTIMATE.start_main_~#t~0#1.base_21|)) (not (bvult |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t~0#1.base_21|)))) is different from false [2024-11-13 07:02:18,737 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#t~0#1.base_21| (_ BitVec 32)) (v_ArrVal_2113 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2115 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2112 (_ BitVec 32))) (or (not (= |v_ULTIMATE.start_main_~#t~0#1.base_21| (select (select (store (let ((.cse0 (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_~#g_points~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#g_points~0.base|) (bvadd (_ bv4 32) |c_~#g_points~0.offset| (bvmul (_ bv4 32) |c_ULTIMATE.start_main_#t~post805#1|)) v_ArrVal_2112)) |v_ULTIMATE.start_main_~#t~0#1.base_21| v_ArrVal_2113))) (store .cse1 (select (select .cse1 |c_~#g_points~0.base|) |c_~#g_points~0.offset|) v_ArrVal_2115)))) (store .cse0 (select (select .cse0 |c_~#g_queue~0.base|) |c_~#g_queue~0.offset|) v_ArrVal_2116)) |c_~#g_queue~0.base| v_ArrVal_2117) |c_~#g_points~0.base|) (bvadd (_ bv4 32) |c_~#g_points~0.offset|)))) (not (bvult |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t~0#1.base_21|)))) is different from false [2024-11-13 07:02:18,773 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#t~0#1.base_21| (_ BitVec 32)) (v_ArrVal_2113 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2115 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2112 (_ BitVec 32))) (or (not (bvult |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t~0#1.base_21|)) (not (= |v_ULTIMATE.start_main_~#t~0#1.base_21| (select (select (store (let ((.cse0 (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_~#g_points~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#g_points~0.base|) (bvadd (_ bv4 32) |c_~#g_points~0.offset| (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~2#1|)) v_ArrVal_2112)) |v_ULTIMATE.start_main_~#t~0#1.base_21| v_ArrVal_2113))) (store .cse1 (select (select .cse1 |c_~#g_points~0.base|) |c_~#g_points~0.offset|) v_ArrVal_2115)))) (store .cse0 (select (select .cse0 |c_~#g_queue~0.base|) |c_~#g_queue~0.offset|) v_ArrVal_2116)) |c_~#g_queue~0.base| v_ArrVal_2117) |c_~#g_points~0.base|) (bvadd (_ bv4 32) |c_~#g_points~0.offset|)))))) is different from false [2024-11-13 07:02:19,110 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#t~0#1.base_21| (_ BitVec 32)) (v_ArrVal_2113 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2115 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2112 (_ BitVec 32))) (or (not (bvult |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t~0#1.base_21|)) (not (= |v_ULTIMATE.start_main_~#t~0#1.base_21| (select (select (store (let ((.cse0 (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_~#g_points~0.base| (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~2#1|))) (store (store (select |c_#memory_$Pointer$.base| |c_~#g_points~0.base|) (bvadd |c_~#g_points~0.offset| .cse2) |c_ULTIMATE.start_main_#t~malloc802#1.base|) (bvadd (_ bv4 32) |c_~#g_points~0.offset| .cse2) v_ArrVal_2112))) |v_ULTIMATE.start_main_~#t~0#1.base_21| v_ArrVal_2113))) (store .cse1 (select (select .cse1 |c_~#g_points~0.base|) |c_~#g_points~0.offset|) v_ArrVal_2115)))) (store .cse0 (select (select .cse0 |c_~#g_queue~0.base|) |c_~#g_queue~0.offset|) v_ArrVal_2116)) |c_~#g_queue~0.base| v_ArrVal_2117) |c_~#g_points~0.base|) (bvadd (_ bv4 32) |c_~#g_points~0.offset|)))))) is different from false [2024-11-13 07:02:20,920 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#t~0#1.base_21| (_ BitVec 32)) (v_ArrVal_2113 (Array (_ BitVec 32) (_ BitVec 32))) (|~#g_points~0.offset| (_ BitVec 32)) (v_ArrVal_2116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2115 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc802#1.base_11| (_ BitVec 32)) (v_ArrVal_2112 (_ BitVec 32))) (or (not (bvult |v_ULTIMATE.start_main_#t~malloc802#1.base_11| |c_#StackHeapBarrier|)) (not (bvult |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t~0#1.base_21|)) (not (= (select (select (store (let ((.cse0 (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_~#g_points~0.base| (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~2#1|))) (store (store (store (select |c_#memory_$Pointer$.base| |c_~#g_points~0.base|) (bvadd |~#g_points~0.offset| .cse2) |c_ULTIMATE.start_main_#t~malloc802#1.base|) (bvadd (_ bv4 32) |~#g_points~0.offset| .cse2) |v_ULTIMATE.start_main_#t~malloc802#1.base_11|) (bvadd (_ bv8 32) |~#g_points~0.offset| .cse2) v_ArrVal_2112))) |v_ULTIMATE.start_main_~#t~0#1.base_21| v_ArrVal_2113))) (store .cse1 (select (select .cse1 |c_~#g_points~0.base|) |~#g_points~0.offset|) v_ArrVal_2115)))) (store .cse0 (select (select .cse0 |c_~#g_queue~0.base|) |c_~#g_queue~0.offset|) v_ArrVal_2116)) |c_~#g_queue~0.base| v_ArrVal_2117) |c_~#g_points~0.base|) (bvadd (_ bv4 32) |~#g_points~0.offset|)) |v_ULTIMATE.start_main_~#t~0#1.base_21|)))) is different from false [2024-11-13 07:02:40,014 WARN L851 $PredicateComparison]: unable to prove that (forall ((|#StackHeapBarrier| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t~0#1.base_21| (_ BitVec 32)) (v_ArrVal_2113 (Array (_ BitVec 32) (_ BitVec 32))) (|~#g_points~0.offset| (_ BitVec 32)) (v_ArrVal_2116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2115 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc802#1.base_13| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc802#1.base_11| (_ BitVec 32)) (v_ArrVal_2112 (_ BitVec 32))) (or (not (bvult |v_ULTIMATE.start_main_#t~malloc802#1.base_11| |#StackHeapBarrier|)) (not (= (let ((.cse2 (bvadd (_ bv4 32) |~#g_points~0.offset|))) (select (select (store (let ((.cse0 (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_~#g_points~0.base| (store (store (store (select |c_#memory_$Pointer$.base| |c_~#g_points~0.base|) |~#g_points~0.offset| |v_ULTIMATE.start_main_#t~malloc802#1.base_13|) .cse2 |v_ULTIMATE.start_main_#t~malloc802#1.base_11|) (bvadd (_ bv8 32) |~#g_points~0.offset|) v_ArrVal_2112)) |v_ULTIMATE.start_main_~#t~0#1.base_21| v_ArrVal_2113))) (store .cse1 (select (select .cse1 |c_~#g_points~0.base|) |~#g_points~0.offset|) v_ArrVal_2115)))) (store .cse0 (select (select .cse0 |c_~#g_queue~0.base|) |c_~#g_queue~0.offset|) v_ArrVal_2116)) |c_~#g_queue~0.base| v_ArrVal_2117) |c_~#g_points~0.base|) .cse2)) |v_ULTIMATE.start_main_~#t~0#1.base_21|)) (not (bvult |#StackHeapBarrier| |v_ULTIMATE.start_main_~#t~0#1.base_21|)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc802#1.base_13|))) (not (bvult |v_ULTIMATE.start_main_#t~malloc802#1.base_13| |#StackHeapBarrier|)) (= (_ bv0 32) |v_ULTIMATE.start_main_#t~malloc802#1.base_13|))) is different from false [2024-11-13 07:02:43,502 WARN L851 $PredicateComparison]: unable to prove that (forall ((|#StackHeapBarrier| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t~0#1.base_21| (_ BitVec 32)) (v_ArrVal_2105 (_ BitVec 32)) (v_ArrVal_2113 (Array (_ BitVec 32) (_ BitVec 32))) (|~#g_points~0.offset| (_ BitVec 32)) (v_ArrVal_2116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2115 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc802#1.base_13| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc802#1.base_11| (_ BitVec 32)) (v_ArrVal_2112 (_ BitVec 32))) (or (not (bvult |v_ULTIMATE.start_main_#t~malloc802#1.base_11| |#StackHeapBarrier|)) (not (bvult |#StackHeapBarrier| |v_ULTIMATE.start_main_~#t~0#1.base_21|)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc802#1.base_13|))) (not (= (let ((.cse3 (bvadd (_ bv4 32) |~#g_points~0.offset|))) (select (select (store (let ((.cse0 (let ((.cse1 (store (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_vatomic32_write_#in~a#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_vatomic32_write_#in~a#1.base|) |c_ULTIMATE.start_vatomic32_write_#in~a#1.offset| v_ArrVal_2105)))) (store .cse2 |c_~#g_points~0.base| (store (store (store (select .cse2 |c_~#g_points~0.base|) |~#g_points~0.offset| |v_ULTIMATE.start_main_#t~malloc802#1.base_13|) .cse3 |v_ULTIMATE.start_main_#t~malloc802#1.base_11|) (bvadd (_ bv8 32) |~#g_points~0.offset|) v_ArrVal_2112))) |v_ULTIMATE.start_main_~#t~0#1.base_21| v_ArrVal_2113))) (store .cse1 (select (select .cse1 |c_~#g_points~0.base|) |~#g_points~0.offset|) v_ArrVal_2115)))) (store .cse0 (select (select .cse0 |c_~#g_queue~0.base|) |c_~#g_queue~0.offset|) v_ArrVal_2116)) |c_~#g_queue~0.base| v_ArrVal_2117) |c_~#g_points~0.base|) .cse3)) |v_ULTIMATE.start_main_~#t~0#1.base_21|)) (not (bvult |v_ULTIMATE.start_main_#t~malloc802#1.base_13| |#StackHeapBarrier|)) (= (_ bv0 32) |v_ULTIMATE.start_main_#t~malloc802#1.base_13|))) is different from false [2024-11-13 07:02:43,728 WARN L851 $PredicateComparison]: unable to prove that (forall ((|#StackHeapBarrier| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t~0#1.base_21| (_ BitVec 32)) (v_ArrVal_2105 (_ BitVec 32)) (v_ArrVal_2113 (Array (_ BitVec 32) (_ BitVec 32))) (|~#g_points~0.offset| (_ BitVec 32)) (v_ArrVal_2116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2115 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc802#1.base_13| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc802#1.base_11| (_ BitVec 32)) (v_ArrVal_2112 (_ BitVec 32))) (or (not (bvult |v_ULTIMATE.start_main_#t~malloc802#1.base_11| |#StackHeapBarrier|)) (not (bvult |#StackHeapBarrier| |v_ULTIMATE.start_main_~#t~0#1.base_21|)) (not (= (let ((.cse3 (bvadd (_ bv4 32) |~#g_points~0.offset|))) (select (select (store (let ((.cse0 (let ((.cse1 (store (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_vatomic32_init_~a#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_vatomic32_init_~a#1.base|) |c_ULTIMATE.start_vatomic32_init_~a#1.offset| v_ArrVal_2105)))) (store .cse2 |c_~#g_points~0.base| (store (store (store (select .cse2 |c_~#g_points~0.base|) |~#g_points~0.offset| |v_ULTIMATE.start_main_#t~malloc802#1.base_13|) .cse3 |v_ULTIMATE.start_main_#t~malloc802#1.base_11|) (bvadd (_ bv8 32) |~#g_points~0.offset|) v_ArrVal_2112))) |v_ULTIMATE.start_main_~#t~0#1.base_21| v_ArrVal_2113))) (store .cse1 (select (select .cse1 |c_~#g_points~0.base|) |~#g_points~0.offset|) v_ArrVal_2115)))) (store .cse0 (select (select .cse0 |c_~#g_queue~0.base|) |c_~#g_queue~0.offset|) v_ArrVal_2116)) |c_~#g_queue~0.base| v_ArrVal_2117) |c_~#g_points~0.base|) .cse3)) |v_ULTIMATE.start_main_~#t~0#1.base_21|)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc802#1.base_13|))) (not (bvult |v_ULTIMATE.start_main_#t~malloc802#1.base_13| |#StackHeapBarrier|)) (= (_ bv0 32) |v_ULTIMATE.start_main_#t~malloc802#1.base_13|))) is different from false [2024-11-13 07:02:43,994 WARN L851 $PredicateComparison]: unable to prove that (forall ((|#StackHeapBarrier| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t~0#1.base_21| (_ BitVec 32)) (v_ArrVal_2105 (_ BitVec 32)) (v_ArrVal_2113 (Array (_ BitVec 32) (_ BitVec 32))) (|~#g_points~0.offset| (_ BitVec 32)) (v_ArrVal_2116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2115 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc802#1.base_13| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc802#1.base_11| (_ BitVec 32)) (v_ArrVal_2112 (_ BitVec 32))) (or (not (bvult |v_ULTIMATE.start_main_#t~malloc802#1.base_11| |#StackHeapBarrier|)) (not (bvult |#StackHeapBarrier| |v_ULTIMATE.start_main_~#t~0#1.base_21|)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc802#1.base_13|))) (not (= (let ((.cse3 (bvadd (_ bv4 32) |~#g_points~0.offset|))) (select (select (store (let ((.cse0 (let ((.cse1 (store (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_vatomic32_init_#in~a#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_vatomic32_init_#in~a#1.base|) |c_ULTIMATE.start_vatomic32_init_#in~a#1.offset| v_ArrVal_2105)))) (store .cse2 |c_~#g_points~0.base| (store (store (store (select .cse2 |c_~#g_points~0.base|) |~#g_points~0.offset| |v_ULTIMATE.start_main_#t~malloc802#1.base_13|) .cse3 |v_ULTIMATE.start_main_#t~malloc802#1.base_11|) (bvadd (_ bv8 32) |~#g_points~0.offset|) v_ArrVal_2112))) |v_ULTIMATE.start_main_~#t~0#1.base_21| v_ArrVal_2113))) (store .cse1 (select (select .cse1 |c_~#g_points~0.base|) |~#g_points~0.offset|) v_ArrVal_2115)))) (store .cse0 (select (select .cse0 |c_~#g_queue~0.base|) |c_~#g_queue~0.offset|) v_ArrVal_2116)) |c_~#g_queue~0.base| v_ArrVal_2117) |c_~#g_points~0.base|) .cse3)) |v_ULTIMATE.start_main_~#t~0#1.base_21|)) (not (bvult |v_ULTIMATE.start_main_#t~malloc802#1.base_13| |#StackHeapBarrier|)) (= (_ bv0 32) |v_ULTIMATE.start_main_#t~malloc802#1.base_13|))) is different from false [2024-11-13 07:02:44,230 WARN L851 $PredicateComparison]: unable to prove that (forall ((|#StackHeapBarrier| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t~0#1.base_21| (_ BitVec 32)) (v_ArrVal_2105 (_ BitVec 32)) (v_ArrVal_2113 (Array (_ BitVec 32) (_ BitVec 32))) (|~#g_points~0.offset| (_ BitVec 32)) (v_ArrVal_2116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2115 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc802#1.base_13| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc802#1.base_11| (_ BitVec 32)) (v_ArrVal_2112 (_ BitVec 32))) (or (not (bvult |v_ULTIMATE.start_main_#t~malloc802#1.base_11| |#StackHeapBarrier|)) (not (bvult |#StackHeapBarrier| |v_ULTIMATE.start_main_~#t~0#1.base_21|)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc802#1.base_13|))) (not (= (let ((.cse3 (bvadd (_ bv4 32) |~#g_points~0.offset|))) (select (select (store (let ((.cse0 (let ((.cse1 (store (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_bounded_spsc_init_~q#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_bounded_spsc_init_~q#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_bounded_spsc_init_~q#1.offset|) v_ArrVal_2105)))) (store .cse2 |c_~#g_points~0.base| (store (store (store (select .cse2 |c_~#g_points~0.base|) |~#g_points~0.offset| |v_ULTIMATE.start_main_#t~malloc802#1.base_13|) .cse3 |v_ULTIMATE.start_main_#t~malloc802#1.base_11|) (bvadd (_ bv8 32) |~#g_points~0.offset|) v_ArrVal_2112))) |v_ULTIMATE.start_main_~#t~0#1.base_21| v_ArrVal_2113))) (store .cse1 (select (select .cse1 |c_~#g_points~0.base|) |~#g_points~0.offset|) v_ArrVal_2115)))) (store .cse0 (select (select .cse0 |c_~#g_queue~0.base|) |c_~#g_queue~0.offset|) v_ArrVal_2116)) |c_~#g_queue~0.base| v_ArrVal_2117) |c_~#g_points~0.base|) .cse3)) |v_ULTIMATE.start_main_~#t~0#1.base_21|)) (not (bvult |v_ULTIMATE.start_main_#t~malloc802#1.base_13| |#StackHeapBarrier|)) (= (_ bv0 32) |v_ULTIMATE.start_main_#t~malloc802#1.base_13|))) is different from false [2024-11-13 07:02:44,937 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2105 (_ BitVec 32)) (|~#g_points~0.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc802#1.base_13| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc802#1.base_11| (_ BitVec 32)) (v_ArrVal_2112 (_ BitVec 32)) (|#StackHeapBarrier| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t~0#1.base_21| (_ BitVec 32)) (v_ArrVal_2113 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2104 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2115 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_vatomic32_write_~a#1.base|) |c_ULTIMATE.start_vatomic32_write_~a#1.offset| (select v_ArrVal_2104 |c_ULTIMATE.start_vatomic32_write_~a#1.offset|)) v_ArrVal_2104)) (not (bvult |v_ULTIMATE.start_main_#t~malloc802#1.base_11| |#StackHeapBarrier|)) (not (bvult |#StackHeapBarrier| |v_ULTIMATE.start_main_~#t~0#1.base_21|)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc802#1.base_13|))) (not (= |v_ULTIMATE.start_main_~#t~0#1.base_21| (let ((.cse3 (bvadd (_ bv4 32) |~#g_points~0.offset|))) (select (select (store (let ((.cse0 (let ((.cse1 (store (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_vatomic32_write_~a#1.base| v_ArrVal_2104))) (store .cse4 |c_ULTIMATE.start_bounded_spsc_init_~q#1.base| (store (select .cse4 |c_ULTIMATE.start_bounded_spsc_init_~q#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_bounded_spsc_init_~q#1.offset|) v_ArrVal_2105))))) (store .cse2 |c_~#g_points~0.base| (store (store (store (select .cse2 |c_~#g_points~0.base|) |~#g_points~0.offset| |v_ULTIMATE.start_main_#t~malloc802#1.base_13|) .cse3 |v_ULTIMATE.start_main_#t~malloc802#1.base_11|) (bvadd (_ bv8 32) |~#g_points~0.offset|) v_ArrVal_2112))) |v_ULTIMATE.start_main_~#t~0#1.base_21| v_ArrVal_2113))) (store .cse1 (select (select .cse1 |c_~#g_points~0.base|) |~#g_points~0.offset|) v_ArrVal_2115)))) (store .cse0 (select (select .cse0 |c_~#g_queue~0.base|) |c_~#g_queue~0.offset|) v_ArrVal_2116)) |c_~#g_queue~0.base| v_ArrVal_2117) |c_~#g_points~0.base|) .cse3)))) (not (bvult |v_ULTIMATE.start_main_#t~malloc802#1.base_13| |#StackHeapBarrier|)) (= (_ bv0 32) |v_ULTIMATE.start_main_#t~malloc802#1.base_13|))) is different from false [2024-11-13 07:02:45,397 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2105 (_ BitVec 32)) (|~#g_points~0.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc802#1.base_13| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc802#1.base_11| (_ BitVec 32)) (v_ArrVal_2112 (_ BitVec 32)) (|#StackHeapBarrier| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t~0#1.base_21| (_ BitVec 32)) (v_ArrVal_2113 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2104 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2115 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (bvult |v_ULTIMATE.start_main_#t~malloc802#1.base_11| |#StackHeapBarrier|)) (not (= (let ((.cse3 (bvadd (_ bv4 32) |~#g_points~0.offset|))) (select (select (store (let ((.cse0 (let ((.cse1 (store (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_vatomic32_write_#in~a#1.base| v_ArrVal_2104))) (store .cse4 |c_ULTIMATE.start_bounded_spsc_init_~q#1.base| (store (select .cse4 |c_ULTIMATE.start_bounded_spsc_init_~q#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_bounded_spsc_init_~q#1.offset|) v_ArrVal_2105))))) (store .cse2 |c_~#g_points~0.base| (store (store (store (select .cse2 |c_~#g_points~0.base|) |~#g_points~0.offset| |v_ULTIMATE.start_main_#t~malloc802#1.base_13|) .cse3 |v_ULTIMATE.start_main_#t~malloc802#1.base_11|) (bvadd (_ bv8 32) |~#g_points~0.offset|) v_ArrVal_2112))) |v_ULTIMATE.start_main_~#t~0#1.base_21| v_ArrVal_2113))) (store .cse1 (select (select .cse1 |c_~#g_points~0.base|) |~#g_points~0.offset|) v_ArrVal_2115)))) (store .cse0 (select (select .cse0 |c_~#g_queue~0.base|) |c_~#g_queue~0.offset|) v_ArrVal_2116)) |c_~#g_queue~0.base| v_ArrVal_2117) |c_~#g_points~0.base|) .cse3)) |v_ULTIMATE.start_main_~#t~0#1.base_21|)) (not (= (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_vatomic32_write_#in~a#1.base|) |c_ULTIMATE.start_vatomic32_write_#in~a#1.offset| (select v_ArrVal_2104 |c_ULTIMATE.start_vatomic32_write_#in~a#1.offset|)) v_ArrVal_2104)) (not (bvult |#StackHeapBarrier| |v_ULTIMATE.start_main_~#t~0#1.base_21|)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc802#1.base_13|))) (not (bvult |v_ULTIMATE.start_main_#t~malloc802#1.base_13| |#StackHeapBarrier|)) (= (_ bv0 32) |v_ULTIMATE.start_main_#t~malloc802#1.base_13|))) is different from false [2024-11-13 07:02:45,917 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2105 (_ BitVec 32)) (|~#g_points~0.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc802#1.base_13| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc802#1.base_11| (_ BitVec 32)) (v_ArrVal_2112 (_ BitVec 32)) (|#StackHeapBarrier| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t~0#1.base_21| (_ BitVec 32)) (v_ArrVal_2113 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2104 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2115 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (bvult |v_ULTIMATE.start_main_#t~malloc802#1.base_11| |#StackHeapBarrier|)) (not (bvult |#StackHeapBarrier| |v_ULTIMATE.start_main_~#t~0#1.base_21|)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc802#1.base_13|))) (not (= (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_vatomic32_init_~a#1.base|) |c_ULTIMATE.start_vatomic32_init_~a#1.offset| (select v_ArrVal_2104 |c_ULTIMATE.start_vatomic32_init_~a#1.offset|)) v_ArrVal_2104)) (not (bvult |v_ULTIMATE.start_main_#t~malloc802#1.base_13| |#StackHeapBarrier|)) (not (= (let ((.cse3 (bvadd (_ bv4 32) |~#g_points~0.offset|))) (select (select (store (let ((.cse0 (let ((.cse1 (store (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_vatomic32_init_~a#1.base| v_ArrVal_2104))) (store .cse4 |c_ULTIMATE.start_bounded_spsc_init_~q#1.base| (store (select .cse4 |c_ULTIMATE.start_bounded_spsc_init_~q#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_bounded_spsc_init_~q#1.offset|) v_ArrVal_2105))))) (store .cse2 |c_~#g_points~0.base| (store (store (store (select .cse2 |c_~#g_points~0.base|) |~#g_points~0.offset| |v_ULTIMATE.start_main_#t~malloc802#1.base_13|) .cse3 |v_ULTIMATE.start_main_#t~malloc802#1.base_11|) (bvadd (_ bv8 32) |~#g_points~0.offset|) v_ArrVal_2112))) |v_ULTIMATE.start_main_~#t~0#1.base_21| v_ArrVal_2113))) (store .cse1 (select (select .cse1 |c_~#g_points~0.base|) |~#g_points~0.offset|) v_ArrVal_2115)))) (store .cse0 (select (select .cse0 |c_~#g_queue~0.base|) |c_~#g_queue~0.offset|) v_ArrVal_2116)) |c_~#g_queue~0.base| v_ArrVal_2117) |c_~#g_points~0.base|) .cse3)) |v_ULTIMATE.start_main_~#t~0#1.base_21|)) (= (_ bv0 32) |v_ULTIMATE.start_main_#t~malloc802#1.base_13|))) is different from false [2024-11-13 07:02:46,437 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2105 (_ BitVec 32)) (|~#g_points~0.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc802#1.base_13| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc802#1.base_11| (_ BitVec 32)) (v_ArrVal_2112 (_ BitVec 32)) (|#StackHeapBarrier| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t~0#1.base_21| (_ BitVec 32)) (v_ArrVal_2113 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2104 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2115 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (bvult |v_ULTIMATE.start_main_#t~malloc802#1.base_11| |#StackHeapBarrier|)) (not (bvult |#StackHeapBarrier| |v_ULTIMATE.start_main_~#t~0#1.base_21|)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc802#1.base_13|))) (not (bvult |v_ULTIMATE.start_main_#t~malloc802#1.base_13| |#StackHeapBarrier|)) (not (= (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_vatomic32_init_#in~a#1.base|) |c_ULTIMATE.start_vatomic32_init_#in~a#1.offset| (select v_ArrVal_2104 |c_ULTIMATE.start_vatomic32_init_#in~a#1.offset|)) v_ArrVal_2104)) (= (_ bv0 32) |v_ULTIMATE.start_main_#t~malloc802#1.base_13|) (not (= (let ((.cse3 (bvadd (_ bv4 32) |~#g_points~0.offset|))) (select (select (store (let ((.cse0 (let ((.cse1 (store (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_vatomic32_init_#in~a#1.base| v_ArrVal_2104))) (store .cse4 |c_ULTIMATE.start_bounded_spsc_init_~q#1.base| (store (select .cse4 |c_ULTIMATE.start_bounded_spsc_init_~q#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_bounded_spsc_init_~q#1.offset|) v_ArrVal_2105))))) (store .cse2 |c_~#g_points~0.base| (store (store (store (select .cse2 |c_~#g_points~0.base|) |~#g_points~0.offset| |v_ULTIMATE.start_main_#t~malloc802#1.base_13|) .cse3 |v_ULTIMATE.start_main_#t~malloc802#1.base_11|) (bvadd (_ bv8 32) |~#g_points~0.offset|) v_ArrVal_2112))) |v_ULTIMATE.start_main_~#t~0#1.base_21| v_ArrVal_2113))) (store .cse1 (select (select .cse1 |c_~#g_points~0.base|) |~#g_points~0.offset|) v_ArrVal_2115)))) (store .cse0 (select (select .cse0 |c_~#g_queue~0.base|) |c_~#g_queue~0.offset|) v_ArrVal_2116)) |c_~#g_queue~0.base| v_ArrVal_2117) |c_~#g_points~0.base|) .cse3)) |v_ULTIMATE.start_main_~#t~0#1.base_21|)))) is different from false [2024-11-13 07:02:46,751 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2105 (_ BitVec 32)) (|~#g_points~0.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc802#1.base_13| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc802#1.base_11| (_ BitVec 32)) (v_ArrVal_2112 (_ BitVec 32)) (|#StackHeapBarrier| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t~0#1.base_21| (_ BitVec 32)) (v_ArrVal_2113 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_ArrVal_2116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2115 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (bvult |v_ULTIMATE.start_main_#t~malloc802#1.base_11| |#StackHeapBarrier|)) (not (bvult |#StackHeapBarrier| |v_ULTIMATE.start_main_~#t~0#1.base_21|)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc802#1.base_13|))) (not (= |v_ULTIMATE.start_main_~#t~0#1.base_21| (let ((.cse3 (bvadd (_ bv4 32) |~#g_points~0.offset|))) (select (select (store (let ((.cse0 (let ((.cse1 (store (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_bounded_spsc_init_~q#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_bounded_spsc_init_~q#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_bounded_spsc_init_~q#1.offset|) v_DerPreprocessor_1) (bvadd (_ bv8 32) |c_ULTIMATE.start_bounded_spsc_init_~q#1.offset|) v_ArrVal_2105)))) (store .cse2 |c_~#g_points~0.base| (store (store (store (select .cse2 |c_~#g_points~0.base|) |~#g_points~0.offset| |v_ULTIMATE.start_main_#t~malloc802#1.base_13|) .cse3 |v_ULTIMATE.start_main_#t~malloc802#1.base_11|) (bvadd (_ bv8 32) |~#g_points~0.offset|) v_ArrVal_2112))) |v_ULTIMATE.start_main_~#t~0#1.base_21| v_ArrVal_2113))) (store .cse1 (select (select .cse1 |c_~#g_points~0.base|) |~#g_points~0.offset|) v_ArrVal_2115)))) (store .cse0 (select (select .cse0 |c_~#g_queue~0.base|) |c_~#g_queue~0.offset|) v_ArrVal_2116)) |c_~#g_queue~0.base| v_ArrVal_2117) |c_~#g_points~0.base|) .cse3)))) (not (bvult |v_ULTIMATE.start_main_#t~malloc802#1.base_13| |#StackHeapBarrier|)) (= (_ bv0 32) |v_ULTIMATE.start_main_#t~malloc802#1.base_13|))) is different from false [2024-11-13 07:02:47,598 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2105 (_ BitVec 32)) (|~#g_points~0.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc802#1.base_13| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc802#1.base_11| (_ BitVec 32)) (v_ArrVal_2112 (_ BitVec 32)) (|#StackHeapBarrier| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t~0#1.base_21| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (v_ArrVal_2113 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_ArrVal_2116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2115 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (bvult |v_ULTIMATE.start_main_#t~malloc802#1.base_11| |#StackHeapBarrier|)) (not (bvult |#StackHeapBarrier| |v_ULTIMATE.start_main_~#t~0#1.base_21|)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc802#1.base_13|))) (not (= |v_ULTIMATE.start_main_~#t~0#1.base_21| (let ((.cse3 (bvadd (_ bv4 32) |~#g_points~0.offset|))) (select (select (store (let ((.cse0 (let ((.cse1 (store (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_bounded_spsc_init_~q#1.base| (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_bounded_spsc_init_~q#1.base|) (bvadd (_ bv12 32) |c_ULTIMATE.start_bounded_spsc_init_~q#1.offset|) v_DerPreprocessor_2) (bvadd (_ bv4 32) |c_ULTIMATE.start_bounded_spsc_init_~q#1.offset|) v_DerPreprocessor_1) (bvadd (_ bv8 32) |c_ULTIMATE.start_bounded_spsc_init_~q#1.offset|) v_ArrVal_2105)))) (store .cse2 |c_~#g_points~0.base| (store (store (store (select .cse2 |c_~#g_points~0.base|) |~#g_points~0.offset| |v_ULTIMATE.start_main_#t~malloc802#1.base_13|) .cse3 |v_ULTIMATE.start_main_#t~malloc802#1.base_11|) (bvadd (_ bv8 32) |~#g_points~0.offset|) v_ArrVal_2112))) |v_ULTIMATE.start_main_~#t~0#1.base_21| v_ArrVal_2113))) (store .cse1 (select (select .cse1 |c_~#g_points~0.base|) |~#g_points~0.offset|) v_ArrVal_2115)))) (store .cse0 (select (select .cse0 |c_~#g_queue~0.base|) |c_~#g_queue~0.offset|) v_ArrVal_2116)) |c_~#g_queue~0.base| v_ArrVal_2117) |c_~#g_points~0.base|) .cse3)))) (not (bvult |v_ULTIMATE.start_main_#t~malloc802#1.base_13| |#StackHeapBarrier|)) (= (_ bv0 32) |v_ULTIMATE.start_main_#t~malloc802#1.base_13|))) is different from false [2024-11-13 07:02:50,494 INFO L349 Elim1Store]: treesize reduction 342, result has 36.5 percent of original size [2024-11-13 07:02:50,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 302 treesize of output 243 [2024-11-13 07:02:50,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:02:50,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 45838 treesize of output 39652 [2024-11-13 07:02:51,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:02:51,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1578 treesize of output 1477 [2024-11-13 07:02:51,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1458 treesize of output 1426 [2024-11-13 07:02:51,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:02:51,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1426 treesize of output 1341 [2024-11-13 07:02:51,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1330 treesize of output 1266 [2024-11-13 07:03:44,436 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 94 not checked. [2024-11-13 07:03:44,436 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-13 07:03:44,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [29032884] [2024-11-13 07:03:44,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [29032884] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 07:03:44,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 07:03:44,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 66] total 127 [2024-11-13 07:03:44,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907722844] [2024-11-13 07:03:44,437 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 07:03:44,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 128 states [2024-11-13 07:03:44,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-13 07:03:44,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2024-11-13 07:03:44,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1038, Invalid=8148, Unknown=250, NotChecked=6820, Total=16256 [2024-11-13 07:03:44,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:03:44,447 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:03:44,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 128 states, 127 states have (on average 5.645669291338582) internal successors, (717), 128 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:03:44,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:03:44,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 07:03:44,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:03:44,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:03:44,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:03:44,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:03:44,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:03:44,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:03:44,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:03:44,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Killed by 15