./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/protection/mix029_power.opt_pso.opt_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i ./goblint.2024-06-19_11-23-25.files/protection/mix029_power.opt_pso.opt_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 18:26:45,346 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 18:26:45,392 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 18:26:45,397 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 18:26:45,398 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 18:26:45,411 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 18:26:45,414 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 18:26:45,414 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 18:26:45,415 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 18:26:45,418 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 18:26:45,419 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 18:26:45,419 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 18:26:45,420 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 18:26:45,420 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 18:26:45,421 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 18:26:45,421 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 18:26:45,421 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 18:26:45,421 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 18:26:45,421 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 18:26:45,422 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 18:26:45,422 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 18:26:45,422 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 18:26:45,422 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 18:26:45,423 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 18:26:45,423 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 18:26:45,423 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 18:26:45,423 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 18:26:45,423 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 18:26:45,424 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 18:26:45,424 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 18:26:45,425 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 18:26:45,425 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 18:26:45,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 18:26:45,426 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 18:26:45,426 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 18:26:45,426 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 18:26:45,426 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 18:26:45,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 18:26:45,426 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 18:26:45,426 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 18:26:45,427 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 18:26:45,427 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 18:26:45,427 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 18:26:45,427 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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/UAutomizer-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.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-06-27 18:26:45,656 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 18:26:45,686 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 18:26:45,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 18:26:45,689 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 18:26:45,689 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 18:26:45,691 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/protection/mix029_power.opt_pso.opt_rmo.opt.yml/witness.yml [2024-06-27 18:26:45,901 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 18:26:45,902 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 18:26:45,903 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2024-06-27 18:26:46,939 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 18:26:47,149 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 18:26:47,150 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2024-06-27 18:26:47,160 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/895578637/193efff447ec44aeacf35d12467fe9eb/FLAGcc8ac7421 [2024-06-27 18:26:47,170 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/895578637/193efff447ec44aeacf35d12467fe9eb [2024-06-27 18:26:47,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 18:26:47,172 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 18:26:47,172 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 18:26:47,173 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 18:26:47,176 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 18:26:47,177 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:26:45" (1/2) ... [2024-06-27 18:26:47,178 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e556c0 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:26:47, skipping insertion in model container [2024-06-27 18:26:47,178 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:26:45" (1/2) ... [2024-06-27 18:26:47,179 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1dd3183f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:26:47, skipping insertion in model container [2024-06-27 18:26:47,179 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 06:26:47" (2/2) ... [2024-06-27 18:26:47,180 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e556c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:26:47, skipping insertion in model container [2024-06-27 18:26:47,180 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 06:26:47" (2/2) ... [2024-06-27 18:26:47,181 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 18:26:47,274 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 18:26:47,275 INFO L97 edCorrectnessWitness]: Location invariant before [L854-L854] (((((((((((((((((((((! multithreaded || y$read_delayed == (_Bool)0) && (! multithreaded || (y$w_buff1 == 0 || y$w_buff1 == 2))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || ((z == 0 || z == 1) || z == 2))) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || y$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$flush_delayed == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1) || __unbuffered_p3_EAX == 2))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (y$w_buff0 == 0 || y$w_buff0 == 2))) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1))) && (! multithreaded || ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)) [2024-06-27 18:26:47,275 INFO L97 edCorrectnessWitness]: Location invariant before [L853-L853] (((((((((((((((((((((! multithreaded || y$read_delayed == (_Bool)0) && (! multithreaded || (y$w_buff1 == 0 || y$w_buff1 == 2))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || ((z == 0 || z == 1) || z == 2))) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || y$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$flush_delayed == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1) || __unbuffered_p3_EAX == 2))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (y$w_buff0 == 0 || y$w_buff0 == 2))) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1))) && (! multithreaded || ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)) [2024-06-27 18:26:47,275 INFO L97 edCorrectnessWitness]: Location invariant before [L851-L851] (((((((((((((((((((((! multithreaded || y$read_delayed == (_Bool)0) && (! multithreaded || (y$w_buff1 == 0 || y$w_buff1 == 2))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || ((z == 0 || z == 1) || z == 2))) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || y$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$flush_delayed == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1) || __unbuffered_p3_EAX == 2))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (y$w_buff0 == 0 || y$w_buff0 == 2))) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1))) && (! multithreaded || ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)) [2024-06-27 18:26:47,276 INFO L97 edCorrectnessWitness]: Location invariant before [L849-L849] (((((((((((((((((((((! multithreaded || y$read_delayed == (_Bool)0) && (! multithreaded || (y$w_buff1 == 0 || y$w_buff1 == 2))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || ((z == 0 || z == 1) || z == 2))) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || y$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$flush_delayed == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1) || __unbuffered_p3_EAX == 2))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (y$w_buff0 == 0 || y$w_buff0 == 2))) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1))) && (! multithreaded || ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)) [2024-06-27 18:26:47,276 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 18:26:47,276 INFO L106 edCorrectnessWitness]: ghost_update [L847-L847] multithreaded = 1; [2024-06-27 18:26:47,312 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 18:26:47,446 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i[966,979] [2024-06-27 18:26:47,583 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 18:26:47,594 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 18:26:47,621 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i[966,979] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 18:26:47,685 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 18:26:47,739 INFO L206 MainTranslator]: Completed translation [2024-06-27 18:26:47,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:26:47 WrapperNode [2024-06-27 18:26:47,739 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 18:26:47,740 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 18:26:47,741 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 18:26:47,741 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 18:26:47,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:26:47" (1/1) ... [2024-06-27 18:26:47,777 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:26:47" (1/1) ... [2024-06-27 18:26:47,813 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 153 [2024-06-27 18:26:47,814 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 18:26:47,814 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 18:26:47,814 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 18:26:47,815 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 18:26:47,823 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:26:47" (1/1) ... [2024-06-27 18:26:47,824 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:26:47" (1/1) ... [2024-06-27 18:26:47,842 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:26:47" (1/1) ... [2024-06-27 18:26:47,866 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-27 18:26:47,867 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:26:47" (1/1) ... [2024-06-27 18:26:47,867 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:26:47" (1/1) ... [2024-06-27 18:26:47,880 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:26:47" (1/1) ... [2024-06-27 18:26:47,888 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:26:47" (1/1) ... [2024-06-27 18:26:47,895 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:26:47" (1/1) ... [2024-06-27 18:26:47,897 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:26:47" (1/1) ... [2024-06-27 18:26:47,900 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 18:26:47,904 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 18:26:47,904 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 18:26:47,905 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 18:26:47,906 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:26:47" (1/1) ... [2024-06-27 18:26:47,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 18:26:47,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 18:26:47,941 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 18:26:47,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 18:26:47,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 18:26:47,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 18:26:47,986 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 18:26:47,986 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 18:26:47,986 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 18:26:47,987 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 18:26:47,987 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 18:26:47,987 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 18:26:47,987 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-27 18:26:47,987 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-27 18:26:47,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 18:26:47,988 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 18:26:47,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 18:26:47,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 18:26:47,990 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 18:26:48,122 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 18:26:48,124 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 18:26:48,476 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 18:26:48,476 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 18:26:48,615 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 18:26:48,616 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 18:26:48,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 06:26:48 BoogieIcfgContainer [2024-06-27 18:26:48,616 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 18:26:48,618 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 18:26:48,618 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 18:26:48,621 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 18:26:48,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:26:45" (1/4) ... [2024-06-27 18:26:48,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33498394 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 06:26:48, skipping insertion in model container [2024-06-27 18:26:48,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 06:26:47" (2/4) ... [2024-06-27 18:26:48,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33498394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 06:26:48, skipping insertion in model container [2024-06-27 18:26:48,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:26:47" (3/4) ... [2024-06-27 18:26:48,623 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33498394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 06:26:48, skipping insertion in model container [2024-06-27 18:26:48,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 06:26:48" (4/4) ... [2024-06-27 18:26:48,624 INFO L112 eAbstractionObserver]: Analyzing ICFG mix029_power.opt_pso.opt_rmo.opt.i [2024-06-27 18:26:48,637 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 18:26:48,638 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-06-27 18:26:48,638 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 18:26:48,708 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 18:26:48,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 58 transitions, 132 flow [2024-06-27 18:26:48,771 INFO L124 PetriNetUnfolderBase]: 1/54 cut-off events. [2024-06-27 18:26:48,771 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 18:26:48,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 54 events. 1/54 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 96 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2024-06-27 18:26:48,776 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 58 transitions, 132 flow [2024-06-27 18:26:48,779 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 54 transitions, 120 flow [2024-06-27 18:26:48,791 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 18:26:48,797 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, 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;@3c1d754, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 18:26:48,798 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-06-27 18:26:48,801 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 18:26:48,802 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-27 18:26:48,802 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 18:26:48,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:26:48,803 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 18:26:48,803 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-27 18:26:48,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:26:48,817 INFO L85 PathProgramCache]: Analyzing trace with hash 368454972, now seen corresponding path program 1 times [2024-06-27 18:26:48,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:26:48,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014294076] [2024-06-27 18:26:48,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:26:48,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:26:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:26:49,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:26:49,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:26:49,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014294076] [2024-06-27 18:26:49,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014294076] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:26:49,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:26:49,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 18:26:49,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467131238] [2024-06-27 18:26:49,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:26:49,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 18:26:49,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:26:49,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 18:26:49,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 18:26:49,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 58 [2024-06-27 18:26:49,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-06-27 18:26:49,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:26:49,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 58 [2024-06-27 18:26:49,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:26:52,793 INFO L124 PetriNetUnfolderBase]: 22729/32288 cut-off events. [2024-06-27 18:26:52,794 INFO L125 PetriNetUnfolderBase]: For 194/194 co-relation queries the response was YES. [2024-06-27 18:26:52,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62918 conditions, 32288 events. 22729/32288 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 1266. Compared 213807 event pairs, 14900 based on Foata normal form. 841/31535 useless extension candidates. Maximal degree in co-relation 62905. Up to 30214 conditions per place. [2024-06-27 18:26:52,993 INFO L140 encePairwiseOnDemand]: 47/58 looper letters, 53 selfloop transitions, 6 changer transitions 0/73 dead transitions. [2024-06-27 18:26:52,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 73 transitions, 285 flow [2024-06-27 18:26:52,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 18:26:52,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 18:26:53,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2024-06-27 18:26:53,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6839080459770115 [2024-06-27 18:26:53,004 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 120 flow. Second operand 3 states and 119 transitions. [2024-06-27 18:26:53,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 73 transitions, 285 flow [2024-06-27 18:26:53,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 73 transitions, 278 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 18:26:53,010 INFO L231 Difference]: Finished difference. Result has 65 places, 58 transitions, 160 flow [2024-06-27 18:26:53,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=65, PETRI_TRANSITIONS=58} [2024-06-27 18:26:53,015 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -1 predicate places. [2024-06-27 18:26:53,015 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 58 transitions, 160 flow [2024-06-27 18:26:53,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-06-27 18:26:53,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:26:53,016 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:26:53,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 18:26:53,016 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-27 18:26:53,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:26:53,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1897929947, now seen corresponding path program 1 times [2024-06-27 18:26:53,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:26:53,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531225208] [2024-06-27 18:26:53,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:26:53,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:26:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:26:53,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:26:53,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:26:53,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531225208] [2024-06-27 18:26:53,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531225208] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:26:53,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:26:53,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 18:26:53,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649863266] [2024-06-27 18:26:53,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:26:53,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 18:26:53,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:26:53,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 18:26:53,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 18:26:53,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2024-06-27 18:26:53,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 58 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:26:53,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:26:53,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2024-06-27 18:26:53,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:26:56,803 INFO L124 PetriNetUnfolderBase]: 27173/39390 cut-off events. [2024-06-27 18:26:56,803 INFO L125 PetriNetUnfolderBase]: For 6264/6264 co-relation queries the response was YES. [2024-06-27 18:26:56,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84559 conditions, 39390 events. 27173/39390 cut-off events. For 6264/6264 co-relation queries the response was YES. Maximal size of possible extension queue 1529. Compared 273712 event pairs, 20289 based on Foata normal form. 4/37083 useless extension candidates. Maximal degree in co-relation 84547. Up to 35967 conditions per place. [2024-06-27 18:26:57,041 INFO L140 encePairwiseOnDemand]: 47/58 looper letters, 69 selfloop transitions, 11 changer transitions 0/93 dead transitions. [2024-06-27 18:26:57,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 93 transitions, 410 flow [2024-06-27 18:26:57,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 18:26:57,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 18:26:57,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 152 transitions. [2024-06-27 18:26:57,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6551724137931034 [2024-06-27 18:26:57,044 INFO L175 Difference]: Start difference. First operand has 65 places, 58 transitions, 160 flow. Second operand 4 states and 152 transitions. [2024-06-27 18:26:57,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 93 transitions, 410 flow [2024-06-27 18:26:57,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 93 transitions, 404 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 18:26:57,046 INFO L231 Difference]: Finished difference. Result has 68 places, 63 transitions, 218 flow [2024-06-27 18:26:57,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=218, PETRI_PLACES=68, PETRI_TRANSITIONS=63} [2024-06-27 18:26:57,047 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 2 predicate places. [2024-06-27 18:26:57,047 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 63 transitions, 218 flow [2024-06-27 18:26:57,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:26:57,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:26:57,048 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:26:57,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 18:26:57,048 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-27 18:26:57,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:26:57,048 INFO L85 PathProgramCache]: Analyzing trace with hash -2012714570, now seen corresponding path program 1 times [2024-06-27 18:26:57,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:26:57,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890625067] [2024-06-27 18:26:57,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:26:57,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:26:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:26:57,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:26:57,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:26:57,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890625067] [2024-06-27 18:26:57,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890625067] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:26:57,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:26:57,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 18:26:57,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828720248] [2024-06-27 18:26:57,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:26:57,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 18:26:57,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:26:57,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 18:26:57,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 18:26:57,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 58 [2024-06-27 18:26:57,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 63 transitions, 218 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 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-06-27 18:26:57,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:26:57,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 58 [2024-06-27 18:26:57,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:27:01,546 INFO L124 PetriNetUnfolderBase]: 34493/46589 cut-off events. [2024-06-27 18:27:01,547 INFO L125 PetriNetUnfolderBase]: For 18443/18443 co-relation queries the response was YES. [2024-06-27 18:27:01,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113320 conditions, 46589 events. 34493/46589 cut-off events. For 18443/18443 co-relation queries the response was YES. Maximal size of possible extension queue 1616. Compared 284216 event pairs, 16369 based on Foata normal form. 8/44872 useless extension candidates. Maximal degree in co-relation 113306. Up to 45394 conditions per place. [2024-06-27 18:27:01,824 INFO L140 encePairwiseOnDemand]: 46/58 looper letters, 97 selfloop transitions, 20 changer transitions 0/129 dead transitions. [2024-06-27 18:27:01,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 129 transitions, 638 flow [2024-06-27 18:27:01,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:27:01,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:27:01,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 217 transitions. [2024-06-27 18:27:01,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6235632183908046 [2024-06-27 18:27:01,827 INFO L175 Difference]: Start difference. First operand has 68 places, 63 transitions, 218 flow. Second operand 6 states and 217 transitions. [2024-06-27 18:27:01,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 129 transitions, 638 flow [2024-06-27 18:27:01,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 129 transitions, 602 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-06-27 18:27:01,831 INFO L231 Difference]: Finished difference. Result has 72 places, 71 transitions, 297 flow [2024-06-27 18:27:01,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=297, PETRI_PLACES=72, PETRI_TRANSITIONS=71} [2024-06-27 18:27:01,832 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 6 predicate places. [2024-06-27 18:27:01,833 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 71 transitions, 297 flow [2024-06-27 18:27:01,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 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-06-27 18:27:01,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:27:01,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:27:01,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 18:27:01,833 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-27 18:27:01,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:27:01,834 INFO L85 PathProgramCache]: Analyzing trace with hash 2106995212, now seen corresponding path program 1 times [2024-06-27 18:27:01,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:27:01,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532067201] [2024-06-27 18:27:01,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:27:01,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:27:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:27:02,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:27:02,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:27:02,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532067201] [2024-06-27 18:27:02,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532067201] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:27:02,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:27:02,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 18:27:02,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745466853] [2024-06-27 18:27:02,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:27:02,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 18:27:02,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:27:02,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 18:27:02,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-27 18:27:02,682 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 58 [2024-06-27 18:27:02,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 71 transitions, 297 flow. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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-06-27 18:27:02,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:27:02,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 58 [2024-06-27 18:27:02,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:27:06,517 INFO L124 PetriNetUnfolderBase]: 32283/45437 cut-off events. [2024-06-27 18:27:06,517 INFO L125 PetriNetUnfolderBase]: For 32043/32043 co-relation queries the response was YES. [2024-06-27 18:27:06,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118317 conditions, 45437 events. 32283/45437 cut-off events. For 32043/32043 co-relation queries the response was YES. Maximal size of possible extension queue 1553. Compared 298864 event pairs, 15646 based on Foata normal form. 3/43525 useless extension candidates. Maximal degree in co-relation 118300. Up to 42647 conditions per place. [2024-06-27 18:27:06,801 INFO L140 encePairwiseOnDemand]: 47/58 looper letters, 82 selfloop transitions, 12 changer transitions 0/105 dead transitions. [2024-06-27 18:27:06,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 105 transitions, 583 flow [2024-06-27 18:27:06,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 18:27:06,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 18:27:06,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 158 transitions. [2024-06-27 18:27:06,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5448275862068965 [2024-06-27 18:27:06,803 INFO L175 Difference]: Start difference. First operand has 72 places, 71 transitions, 297 flow. Second operand 5 states and 158 transitions. [2024-06-27 18:27:06,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 105 transitions, 583 flow [2024-06-27 18:27:06,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 105 transitions, 534 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-27 18:27:06,812 INFO L231 Difference]: Finished difference. Result has 74 places, 76 transitions, 324 flow [2024-06-27 18:27:06,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=324, PETRI_PLACES=74, PETRI_TRANSITIONS=76} [2024-06-27 18:27:06,814 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 8 predicate places. [2024-06-27 18:27:06,814 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 76 transitions, 324 flow [2024-06-27 18:27:06,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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-06-27 18:27:06,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:27:06,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:27:06,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 18:27:06,815 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-27 18:27:06,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:27:06,816 INFO L85 PathProgramCache]: Analyzing trace with hash 917368558, now seen corresponding path program 1 times [2024-06-27 18:27:06,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:27:06,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261262154] [2024-06-27 18:27:06,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:27:06,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:27:06,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:27:07,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:27:07,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:27:07,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261262154] [2024-06-27 18:27:07,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261262154] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:27:07,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:27:07,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 18:27:07,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135295458] [2024-06-27 18:27:07,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:27:07,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 18:27:07,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:27:07,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 18:27:07,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-27 18:27:07,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 58 [2024-06-27 18:27:07,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 76 transitions, 324 flow. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 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-06-27 18:27:07,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:27:07,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 58 [2024-06-27 18:27:07,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:27:11,892 INFO L124 PetriNetUnfolderBase]: 32261/47531 cut-off events. [2024-06-27 18:27:11,893 INFO L125 PetriNetUnfolderBase]: For 53000/53000 co-relation queries the response was YES. [2024-06-27 18:27:12,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129731 conditions, 47531 events. 32261/47531 cut-off events. For 53000/53000 co-relation queries the response was YES. Maximal size of possible extension queue 1661. Compared 340272 event pairs, 17920 based on Foata normal form. 6/44475 useless extension candidates. Maximal degree in co-relation 129712. Up to 42586 conditions per place. [2024-06-27 18:27:12,197 INFO L140 encePairwiseOnDemand]: 45/58 looper letters, 97 selfloop transitions, 20 changer transitions 0/128 dead transitions. [2024-06-27 18:27:12,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 128 transitions, 763 flow [2024-06-27 18:27:12,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:27:12,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:27:12,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 186 transitions. [2024-06-27 18:27:12,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2024-06-27 18:27:12,198 INFO L175 Difference]: Start difference. First operand has 74 places, 76 transitions, 324 flow. Second operand 6 states and 186 transitions. [2024-06-27 18:27:12,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 128 transitions, 763 flow [2024-06-27 18:27:12,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 128 transitions, 691 flow, removed 20 selfloop flow, removed 3 redundant places. [2024-06-27 18:27:12,217 INFO L231 Difference]: Finished difference. Result has 79 places, 94 transitions, 474 flow [2024-06-27 18:27:12,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=474, PETRI_PLACES=79, PETRI_TRANSITIONS=94} [2024-06-27 18:27:12,219 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 13 predicate places. [2024-06-27 18:27:12,219 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 94 transitions, 474 flow [2024-06-27 18:27:12,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 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-06-27 18:27:12,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:27:12,219 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:27:12,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 18:27:12,219 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-27 18:27:12,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:27:12,220 INFO L85 PathProgramCache]: Analyzing trace with hash 890873970, now seen corresponding path program 1 times [2024-06-27 18:27:12,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:27:12,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974290851] [2024-06-27 18:27:12,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:27:12,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:27:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:27:12,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:27:12,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:27:12,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974290851] [2024-06-27 18:27:12,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974290851] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:27:12,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:27:12,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 18:27:12,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157584759] [2024-06-27 18:27:12,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:27:12,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 18:27:12,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:27:12,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 18:27:12,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 18:27:12,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 58 [2024-06-27 18:27:12,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 94 transitions, 474 flow. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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-06-27 18:27:12,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:27:12,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 58 [2024-06-27 18:27:12,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:27:13,280 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([402] L784-->L796: Formula: (and (= 2 v_~y$w_buff0~0_117) (= v_~y$r_buff0_thd4~0_81 v_~y$r_buff1_thd4~0_83) (= v_~y$w_buff1~0_100 v_~y$w_buff0~0_118) (= v_~y$r_buff0_thd3~0_67 v_~y$r_buff1_thd3~0_41) (= v_~y$w_buff0_used~0_159 1) (= v_~y$w_buff0_used~0_160 v_~y$w_buff1_used~0_142) (= v_~y$r_buff0_thd0~0_101 v_~y$r_buff1_thd0~0_103) (= v_~y$r_buff0_thd1~0_61 v_~y$r_buff1_thd1~0_53) (= v_~y$r_buff0_thd3~0_66 1) (= v_~y$r_buff0_thd2~0_85 v_~y$r_buff1_thd2~0_73) (not (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_142 256) 0)) (not (= (mod v_~y$w_buff0_used~0_159 256) 0)))) 1 0) 0))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_81, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_160, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_101, ~y$w_buff0~0=v_~y$w_buff0~0_118, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_85, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_61} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_159, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_73, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_81, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_53, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_83, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_41, ~y$w_buff1~0=v_~y$w_buff1~0_100, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_66, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_101, ~y$w_buff0~0=v_~y$w_buff0~0_117, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_85, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_61, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_3|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_103, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_3|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_142} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0][32], [P1Thread1of1ForFork1InUse, P0Thread1of1ForFork3InUse, 18#L759true, Black: 99#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~__unbuffered_p3_EAX~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p3_EBX~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~a~0 0) (= (* (div ~y$r_buff0_thd4~0 256) 256) ~y$r_buff0_thd4~0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= (* (div ~y$r_buff1_thd4~0 256) 256) ~y$r_buff1_thd4~0)), P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, 43#L779true, 117#true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p3_EAX~0 0) (= ~__unbuffered_p3_EBX~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y$r_buff0_thd4~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~a~0 0) (= ~y$r_buff1_thd0~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 80#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p3_EAX~0 0) (= ~a~0 1) (= ~__unbuffered_p3_EBX~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y$r_buff0_thd4~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 111#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~__unbuffered_p3_EAX~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p3_EBX~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~a~0 0) (= (* (div ~y$r_buff0_thd4~0 256) 256) ~y$r_buff0_thd4~0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= (* (div ~y$r_buff1_thd4~0 256) 256) ~y$r_buff1_thd4~0)), 101#true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~__unbuffered_p3_EAX~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p3_EBX~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~a~0 0) (= (* (div ~y$r_buff0_thd4~0 256) 256) ~y$r_buff0_thd4~0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~y~0 1) (= (* (div ~y$r_buff1_thd4~0 256) 256) ~y$r_buff1_thd4~0)), Black: 109#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~__unbuffered_p3_EAX~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p3_EBX~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~a~0 0) (= (* (div ~y$r_buff0_thd4~0 256) 256) ~y$r_buff0_thd4~0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= (* (div ~y$r_buff1_thd4~0 256) 256) ~y$r_buff1_thd4~0)), 49#L796true, 35#L880true, Black: 85#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p3_EAX~0 0) (= ~a~0 1) (= ~__unbuffered_p3_EBX~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y$r_buff0_thd4~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 87#(and (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p3_EAX~0 0) (= ~a~0 1) (= ~__unbuffered_p3_EBX~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y$r_buff0_thd4~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), 22#L816true]) [2024-06-27 18:27:13,281 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is not cut-off event [2024-06-27 18:27:13,281 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-06-27 18:27:13,281 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-06-27 18:27:13,281 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-06-27 18:27:13,369 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([402] L784-->L796: Formula: (and (= 2 v_~y$w_buff0~0_117) (= v_~y$r_buff0_thd4~0_81 v_~y$r_buff1_thd4~0_83) (= v_~y$w_buff1~0_100 v_~y$w_buff0~0_118) (= v_~y$r_buff0_thd3~0_67 v_~y$r_buff1_thd3~0_41) (= v_~y$w_buff0_used~0_159 1) (= v_~y$w_buff0_used~0_160 v_~y$w_buff1_used~0_142) (= v_~y$r_buff0_thd0~0_101 v_~y$r_buff1_thd0~0_103) (= v_~y$r_buff0_thd1~0_61 v_~y$r_buff1_thd1~0_53) (= v_~y$r_buff0_thd3~0_66 1) (= v_~y$r_buff0_thd2~0_85 v_~y$r_buff1_thd2~0_73) (not (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_142 256) 0)) (not (= (mod v_~y$w_buff0_used~0_159 256) 0)))) 1 0) 0))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_81, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_160, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_101, ~y$w_buff0~0=v_~y$w_buff0~0_118, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_85, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_61} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_159, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_73, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_81, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_53, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_83, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_41, ~y$w_buff1~0=v_~y$w_buff1~0_100, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_66, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_101, ~y$w_buff0~0=v_~y$w_buff0~0_117, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_85, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_61, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_3|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_103, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_3|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_142} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0][32], [P1Thread1of1ForFork1InUse, P0Thread1of1ForFork3InUse, 18#L759true, Black: 99#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~__unbuffered_p3_EAX~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p3_EBX~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~a~0 0) (= (* (div ~y$r_buff0_thd4~0 256) 256) ~y$r_buff0_thd4~0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= (* (div ~y$r_buff1_thd4~0 256) 256) ~y$r_buff1_thd4~0)), P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, 117#true, 43#L779true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p3_EAX~0 0) (= ~__unbuffered_p3_EBX~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y$r_buff0_thd4~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~a~0 0) (= ~y$r_buff1_thd0~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 80#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p3_EAX~0 0) (= ~a~0 1) (= ~__unbuffered_p3_EBX~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y$r_buff0_thd4~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), 51#L18-1true, Black: 111#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~__unbuffered_p3_EAX~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p3_EBX~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~a~0 0) (= (* (div ~y$r_buff0_thd4~0 256) 256) ~y$r_buff0_thd4~0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= (* (div ~y$r_buff1_thd4~0 256) 256) ~y$r_buff1_thd4~0)), 101#true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~__unbuffered_p3_EAX~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p3_EBX~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~a~0 0) (= (* (div ~y$r_buff0_thd4~0 256) 256) ~y$r_buff0_thd4~0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~y~0 1) (= (* (div ~y$r_buff1_thd4~0 256) 256) ~y$r_buff1_thd4~0)), Black: 109#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~__unbuffered_p3_EAX~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p3_EBX~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~a~0 0) (= (* (div ~y$r_buff0_thd4~0 256) 256) ~y$r_buff0_thd4~0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= (* (div ~y$r_buff1_thd4~0 256) 256) ~y$r_buff1_thd4~0)), 49#L796true, Black: 85#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p3_EAX~0 0) (= ~a~0 1) (= ~__unbuffered_p3_EBX~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y$r_buff0_thd4~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 87#(and (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p3_EAX~0 0) (= ~a~0 1) (= ~__unbuffered_p3_EBX~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y$r_buff0_thd4~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), 22#L816true]) [2024-06-27 18:27:13,370 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is not cut-off event [2024-06-27 18:27:13,370 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-06-27 18:27:13,370 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-06-27 18:27:13,370 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-06-27 18:27:13,565 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([402] L784-->L796: Formula: (and (= 2 v_~y$w_buff0~0_117) (= v_~y$r_buff0_thd4~0_81 v_~y$r_buff1_thd4~0_83) (= v_~y$w_buff1~0_100 v_~y$w_buff0~0_118) (= v_~y$r_buff0_thd3~0_67 v_~y$r_buff1_thd3~0_41) (= v_~y$w_buff0_used~0_159 1) (= v_~y$w_buff0_used~0_160 v_~y$w_buff1_used~0_142) (= v_~y$r_buff0_thd0~0_101 v_~y$r_buff1_thd0~0_103) (= v_~y$r_buff0_thd1~0_61 v_~y$r_buff1_thd1~0_53) (= v_~y$r_buff0_thd3~0_66 1) (= v_~y$r_buff0_thd2~0_85 v_~y$r_buff1_thd2~0_73) (not (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_142 256) 0)) (not (= (mod v_~y$w_buff0_used~0_159 256) 0)))) 1 0) 0))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_81, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_160, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_101, ~y$w_buff0~0=v_~y$w_buff0~0_118, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_85, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_61} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_159, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_73, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_81, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_53, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_83, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_41, ~y$w_buff1~0=v_~y$w_buff1~0_100, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_66, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_101, ~y$w_buff0~0=v_~y$w_buff0~0_117, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_85, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_61, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_3|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_103, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_3|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_142} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0][32], [P1Thread1of1ForFork1InUse, P0Thread1of1ForFork3InUse, 18#L759true, Black: 99#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~__unbuffered_p3_EAX~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p3_EBX~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~a~0 0) (= (* (div ~y$r_buff0_thd4~0 256) 256) ~y$r_buff0_thd4~0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= (* (div ~y$r_buff1_thd4~0 256) 256) ~y$r_buff1_thd4~0)), P2Thread1of1ForFork0InUse, 2#ULTIMATE.startEXITtrue, P3Thread1of1ForFork2InUse, 117#true, 43#L779true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p3_EAX~0 0) (= ~__unbuffered_p3_EBX~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y$r_buff0_thd4~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~a~0 0) (= ~y$r_buff1_thd0~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 80#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p3_EAX~0 0) (= ~a~0 1) (= ~__unbuffered_p3_EBX~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y$r_buff0_thd4~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 111#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~__unbuffered_p3_EAX~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p3_EBX~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~a~0 0) (= (* (div ~y$r_buff0_thd4~0 256) 256) ~y$r_buff0_thd4~0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= (* (div ~y$r_buff1_thd4~0 256) 256) ~y$r_buff1_thd4~0)), 101#true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~__unbuffered_p3_EAX~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p3_EBX~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~a~0 0) (= (* (div ~y$r_buff0_thd4~0 256) 256) ~y$r_buff0_thd4~0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~y~0 1) (= (* (div ~y$r_buff1_thd4~0 256) 256) ~y$r_buff1_thd4~0)), Black: 109#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~__unbuffered_p3_EAX~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p3_EBX~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~a~0 0) (= (* (div ~y$r_buff0_thd4~0 256) 256) ~y$r_buff0_thd4~0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= (* (div ~y$r_buff1_thd4~0 256) 256) ~y$r_buff1_thd4~0)), 49#L796true, Black: 85#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p3_EAX~0 0) (= ~a~0 1) (= ~__unbuffered_p3_EBX~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y$r_buff0_thd4~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 87#(and (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p3_EAX~0 0) (= ~a~0 1) (= ~__unbuffered_p3_EBX~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y$r_buff0_thd4~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), 22#L816true]) [2024-06-27 18:27:13,566 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is not cut-off event [2024-06-27 18:27:13,566 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2024-06-27 18:27:13,566 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2024-06-27 18:27:13,566 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2024-06-27 18:27:13,750 INFO L124 PetriNetUnfolderBase]: 7873/13990 cut-off events. [2024-06-27 18:27:13,751 INFO L125 PetriNetUnfolderBase]: For 19265/20677 co-relation queries the response was YES. [2024-06-27 18:27:13,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35251 conditions, 13990 events. 7873/13990 cut-off events. For 19265/20677 co-relation queries the response was YES. Maximal size of possible extension queue 907. Compared 121304 event pairs, 3489 based on Foata normal form. 17/12585 useless extension candidates. Maximal degree in co-relation 35230. Up to 9096 conditions per place. [2024-06-27 18:27:13,866 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 40 selfloop transitions, 10 changer transitions 0/99 dead transitions. [2024-06-27 18:27:13,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 99 transitions, 542 flow [2024-06-27 18:27:13,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 18:27:13,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 18:27:13,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 133 transitions. [2024-06-27 18:27:13,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.764367816091954 [2024-06-27 18:27:13,867 INFO L175 Difference]: Start difference. First operand has 79 places, 94 transitions, 474 flow. Second operand 3 states and 133 transitions. [2024-06-27 18:27:13,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 99 transitions, 542 flow [2024-06-27 18:27:13,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 99 transitions, 520 flow, removed 10 selfloop flow, removed 1 redundant places. [2024-06-27 18:27:13,883 INFO L231 Difference]: Finished difference. Result has 79 places, 85 transitions, 408 flow [2024-06-27 18:27:13,883 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=79, PETRI_TRANSITIONS=85} [2024-06-27 18:27:13,884 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 13 predicate places. [2024-06-27 18:27:13,884 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 85 transitions, 408 flow [2024-06-27 18:27:13,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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-06-27 18:27:13,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:27:13,885 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:27:13,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 18:27:13,885 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-27 18:27:13,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:27:13,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1892650573, now seen corresponding path program 1 times [2024-06-27 18:27:13,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:27:13,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143797935] [2024-06-27 18:27:13,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:27:13,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:27:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:27:14,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:27:14,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:27:14,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143797935] [2024-06-27 18:27:14,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143797935] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:27:14,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:27:14,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 18:27:14,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464921393] [2024-06-27 18:27:14,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:27:14,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 18:27:14,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:27:14,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 18:27:14,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-27 18:27:14,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 58 [2024-06-27 18:27:14,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 85 transitions, 408 flow. Second operand has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 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-06-27 18:27:14,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:27:14,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 58 [2024-06-27 18:27:14,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:27:18,525 INFO L124 PetriNetUnfolderBase]: 32958/45252 cut-off events. [2024-06-27 18:27:18,525 INFO L125 PetriNetUnfolderBase]: For 88770/88785 co-relation queries the response was YES. [2024-06-27 18:27:18,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133984 conditions, 45252 events. 32958/45252 cut-off events. For 88770/88785 co-relation queries the response was YES. Maximal size of possible extension queue 1464. Compared 282272 event pairs, 15974 based on Foata normal form. 15/44840 useless extension candidates. Maximal degree in co-relation 133961. Up to 43390 conditions per place. [2024-06-27 18:27:18,806 INFO L140 encePairwiseOnDemand]: 47/58 looper letters, 98 selfloop transitions, 28 changer transitions 4/140 dead transitions. [2024-06-27 18:27:18,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 140 transitions, 880 flow [2024-06-27 18:27:18,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:27:18,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:27:18,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 190 transitions. [2024-06-27 18:27:18,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5459770114942529 [2024-06-27 18:27:18,808 INFO L175 Difference]: Start difference. First operand has 79 places, 85 transitions, 408 flow. Second operand 6 states and 190 transitions. [2024-06-27 18:27:18,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 140 transitions, 880 flow [2024-06-27 18:27:18,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 140 transitions, 856 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 18:27:18,829 INFO L231 Difference]: Finished difference. Result has 83 places, 92 transitions, 525 flow [2024-06-27 18:27:18,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=525, PETRI_PLACES=83, PETRI_TRANSITIONS=92} [2024-06-27 18:27:18,830 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 17 predicate places. [2024-06-27 18:27:18,830 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 92 transitions, 525 flow [2024-06-27 18:27:18,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 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-06-27 18:27:18,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:27:18,830 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:27:18,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 18:27:18,830 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-27 18:27:18,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:27:18,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1599799263, now seen corresponding path program 2 times [2024-06-27 18:27:18,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:27:18,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200014858] [2024-06-27 18:27:18,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:27:18,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:27:18,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:27:19,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:27:19,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:27:19,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200014858] [2024-06-27 18:27:19,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200014858] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:27:19,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:27:19,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 18:27:19,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515369021] [2024-06-27 18:27:19,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:27:19,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 18:27:19,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:27:19,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 18:27:19,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-27 18:27:19,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 58 [2024-06-27 18:27:19,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 92 transitions, 525 flow. Second operand has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 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-06-27 18:27:19,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:27:19,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 58 [2024-06-27 18:27:19,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:27:23,470 INFO L124 PetriNetUnfolderBase]: 29381/40479 cut-off events. [2024-06-27 18:27:23,470 INFO L125 PetriNetUnfolderBase]: For 98271/98278 co-relation queries the response was YES. [2024-06-27 18:27:23,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126790 conditions, 40479 events. 29381/40479 cut-off events. For 98271/98278 co-relation queries the response was YES. Maximal size of possible extension queue 1364. Compared 250872 event pairs, 14256 based on Foata normal form. 9/40083 useless extension candidates. Maximal degree in co-relation 126765. Up to 38741 conditions per place. [2024-06-27 18:27:23,772 INFO L140 encePairwiseOnDemand]: 47/58 looper letters, 93 selfloop transitions, 28 changer transitions 0/131 dead transitions. [2024-06-27 18:27:23,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 131 transitions, 865 flow [2024-06-27 18:27:23,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:27:23,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:27:23,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 180 transitions. [2024-06-27 18:27:23,774 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5172413793103449 [2024-06-27 18:27:23,774 INFO L175 Difference]: Start difference. First operand has 83 places, 92 transitions, 525 flow. Second operand 6 states and 180 transitions. [2024-06-27 18:27:23,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 131 transitions, 865 flow [2024-06-27 18:27:23,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 131 transitions, 804 flow, removed 22 selfloop flow, removed 2 redundant places. [2024-06-27 18:27:23,829 INFO L231 Difference]: Finished difference. Result has 86 places, 92 transitions, 532 flow [2024-06-27 18:27:23,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=532, PETRI_PLACES=86, PETRI_TRANSITIONS=92} [2024-06-27 18:27:23,830 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 20 predicate places. [2024-06-27 18:27:23,830 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 92 transitions, 532 flow [2024-06-27 18:27:23,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 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-06-27 18:27:23,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:27:23,830 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:27:23,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 18:27:23,830 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-27 18:27:23,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:27:23,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1387480219, now seen corresponding path program 1 times [2024-06-27 18:27:23,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:27:23,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561017108] [2024-06-27 18:27:23,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:27:23,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:27:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:27:24,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:27:24,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:27:24,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561017108] [2024-06-27 18:27:24,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561017108] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:27:24,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:27:24,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:27:24,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490794842] [2024-06-27 18:27:24,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:27:24,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:27:24,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:27:24,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:27:24,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:27:24,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 58 [2024-06-27 18:27:24,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 92 transitions, 532 flow. Second operand has 8 states, 8 states have (on average 15.375) internal successors, (123), 8 states have internal predecessors, (123), 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-06-27 18:27:24,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:27:24,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 58 [2024-06-27 18:27:24,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand