./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-05-07_14-17-48.files/mutex-meet/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b44c8288 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/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i ./goblint.2024-05-07_14-17-48.files/mutex-meet/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.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-wip.fs.witness-ghost-b44c828-m [2024-05-12 11:54:51,062 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 11:54:51,124 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 11:54:51,127 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 11:54:51,127 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 11:54:51,147 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 11:54:51,147 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 11:54:51,148 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 11:54:51,149 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 11:54:51,152 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 11:54:51,152 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 11:54:51,152 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 11:54:51,153 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 11:54:51,154 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 11:54:51,154 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 11:54:51,155 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 11:54:51,155 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 11:54:51,155 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 11:54:51,155 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 11:54:51,155 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 11:54:51,156 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 11:54:51,157 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 11:54:51,157 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 11:54:51,157 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 11:54:51,157 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 11:54:51,158 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 11:54:51,158 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 11:54:51,158 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 11:54:51,159 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 11:54:51,159 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 11:54:51,160 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 11:54:51,160 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 11:54:51,160 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 11:54:51,160 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 11:54:51,161 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 11:54:51,161 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 11:54:51,161 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 11:54:51,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 11:54:51,161 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 11:54:51,161 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 11:54:51,162 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 11:54:51,162 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 11:54:51,162 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 11:54:51,162 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-05-12 11:54:51,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 11:54:51,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 11:54:51,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 11:54:51,401 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 11:54:51,402 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 11:54:51,403 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-05-12 11:54:52,403 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 11:54:52,660 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 11:54:52,664 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-05-12 11:54:52,680 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38c41fbf7/c33d78b722a447a5badf4d9f02cede8f/FLAGe636417a9 [2024-05-12 11:54:52,988 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38c41fbf7/c33d78b722a447a5badf4d9f02cede8f [2024-05-12 11:54:52,990 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 11:54:52,991 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 11:54:52,993 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-07_14-17-48.files/mutex-meet/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.yml/witness.yml [2024-05-12 11:54:53,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 11:54:53,174 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 11:54:53,176 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 11:54:53,177 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 11:54:53,180 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 11:54:53,181 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 11:54:52" (1/2) ... [2024-05-12 11:54:53,181 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4802497e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:54:53, skipping insertion in model container [2024-05-12 11:54:53,181 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 11:54:52" (1/2) ... [2024-05-12 11:54:53,183 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@771647cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:54:53, skipping insertion in model container [2024-05-12 11:54:53,183 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:54:53" (2/2) ... [2024-05-12 11:54:53,183 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4802497e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:54:53, skipping insertion in model container [2024-05-12 11:54:53,184 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:54:53" (2/2) ... [2024-05-12 11:54:53,184 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 11:54:53,262 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 11:54:53,263 INFO L97 edCorrectnessWitness]: Location invariant before [L836-L836] ((((((((((((((((((! multithreaded || z$r_buff0_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && y <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1))) [2024-05-12 11:54:53,263 INFO L97 edCorrectnessWitness]: Location invariant before [L838-L838] ((((((((((((((((((! multithreaded || z$r_buff0_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && y <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1))) [2024-05-12 11:54:53,264 INFO L97 edCorrectnessWitness]: Location invariant before [L839-L839] ((((((((((((((((((! multithreaded || z$r_buff0_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && y <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1))) [2024-05-12 11:54:53,264 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 11:54:53,265 INFO L106 edCorrectnessWitness]: ghost_update [L834-L834] multithreaded = 1; [2024-05-12 11:54:53,302 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 11:54:53,438 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] [2024-05-12 11:54:53,587 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 11:54:53,598 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-05-12 11:54:53,643 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-05-12 11:54:53,968 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 11:54:54,011 INFO L206 MainTranslator]: Completed translation [2024-05-12 11:54:54,011 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:54:54 WrapperNode [2024-05-12 11:54:54,012 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 11:54:54,013 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 11:54:54,014 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 11:54:54,014 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 11:54:54,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:54:54" (1/1) ... [2024-05-12 11:54:54,058 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:54:54" (1/1) ... [2024-05-12 11:54:54,209 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2024-05-12 11:54:54,209 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 11:54:54,210 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 11:54:54,210 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 11:54:54,210 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 11:54:54,218 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:54:54" (1/1) ... [2024-05-12 11:54:54,219 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:54:54" (1/1) ... [2024-05-12 11:54:54,246 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:54:54" (1/1) ... [2024-05-12 11:54:54,295 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-05-12 11:54:54,296 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:54:54" (1/1) ... [2024-05-12 11:54:54,297 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:54:54" (1/1) ... [2024-05-12 11:54:54,342 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:54:54" (1/1) ... [2024-05-12 11:54:54,344 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:54:54" (1/1) ... [2024-05-12 11:54:54,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:54:54" (1/1) ... [2024-05-12 11:54:54,368 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:54:54" (1/1) ... [2024-05-12 11:54:54,398 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 11:54:54,399 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 11:54:54,399 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 11:54:54,399 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 11:54:54,400 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:54:54" (1/1) ... [2024-05-12 11:54:54,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 11:54:54,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 11:54:54,424 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-05-12 11:54:54,477 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-05-12 11:54:54,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 11:54:54,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 11:54:54,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 11:54:54,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-05-12 11:54:54,530 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-12 11:54:54,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 11:54:54,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 11:54:54,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 11:54:54,530 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-12 11:54:54,530 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-12 11:54:54,531 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-12 11:54:54,531 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-12 11:54:54,531 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-12 11:54:54,531 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-12 11:54:54,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 11:54:54,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 11:54:54,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 11:54:54,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-05-12 11:54:54,531 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-12 11:54:54,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 11:54:54,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 11:54:54,533 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-12 11:54:54,650 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 11:54:54,651 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 11:54:55,778 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 11:54:55,778 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 11:54:56,052 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 11:54:56,052 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-12 11:54:56,053 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 11:54:56 BoogieIcfgContainer [2024-05-12 11:54:56,053 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 11:54:56,055 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 11:54:56,055 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 11:54:56,057 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 11:54:56,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 11:54:52" (1/4) ... [2024-05-12 11:54:56,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7167abac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 11:54:56, skipping insertion in model container [2024-05-12 11:54:56,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:54:53" (2/4) ... [2024-05-12 11:54:56,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7167abac and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 11:54:56, skipping insertion in model container [2024-05-12 11:54:56,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:54:54" (3/4) ... [2024-05-12 11:54:56,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7167abac and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 11:54:56, skipping insertion in model container [2024-05-12 11:54:56,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 11:54:56" (4/4) ... [2024-05-12 11:54:56,061 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-05-12 11:54:56,074 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 11:54:56,074 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-05-12 11:54:56,074 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 11:54:56,186 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-12 11:54:56,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 47 transitions, 106 flow [2024-05-12 11:54:56,256 INFO L124 PetriNetUnfolderBase]: 1/44 cut-off events. [2024-05-12 11:54:56,257 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 11:54:56,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 44 events. 1/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2024-05-12 11:54:56,260 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 47 transitions, 106 flow [2024-05-12 11:54:56,263 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 44 transitions, 97 flow [2024-05-12 11:54:56,273 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 11:54:56,309 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;@1061b5bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 11:54:56,311 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-05-12 11:54:56,320 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 11:54:56,320 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-05-12 11:54:56,320 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 11:54:56,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:54:56,321 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 11:54:56,334 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:54:56,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:54:56,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1707934353, now seen corresponding path program 1 times [2024-05-12 11:54:56,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:54:56,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141949323] [2024-05-12 11:54:56,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:54:56,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:54:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:55:01,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:55:01,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:55:01,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141949323] [2024-05-12 11:55:01,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141949323] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:55:01,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:55:01,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 11:55:01,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154048858] [2024-05-12 11:55:01,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:55:01,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 11:55:01,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:55:01,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 11:55:01,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 11:55:01,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 11:55:01,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-05-12 11:55:01,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:55:01,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 11:55:01,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:55:03,087 INFO L124 PetriNetUnfolderBase]: 3699/6217 cut-off events. [2024-05-12 11:55:03,087 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-05-12 11:55:03,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11645 conditions, 6217 events. 3699/6217 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 40900 event pairs, 2881 based on Foata normal form. 211/5937 useless extension candidates. Maximal degree in co-relation 11630. Up to 5323 conditions per place. [2024-05-12 11:55:03,122 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 43 selfloop transitions, 5 changer transitions 0/58 dead transitions. [2024-05-12 11:55:03,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 58 transitions, 227 flow [2024-05-12 11:55:03,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 11:55:03,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 11:55:03,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2024-05-12 11:55:03,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6524822695035462 [2024-05-12 11:55:03,133 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 97 flow. Second operand 3 states and 92 transitions. [2024-05-12 11:55:03,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 58 transitions, 227 flow [2024-05-12 11:55:03,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 58 transitions, 222 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-05-12 11:55:03,140 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 129 flow [2024-05-12 11:55:03,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2024-05-12 11:55:03,143 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 0 predicate places. [2024-05-12 11:55:03,144 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 129 flow [2024-05-12 11:55:03,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-05-12 11:55:03,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:55:03,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 11:55:03,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 11:55:03,145 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:55:03,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:55:03,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1707933034, now seen corresponding path program 1 times [2024-05-12 11:55:03,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:55:03,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83856180] [2024-05-12 11:55:03,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:55:03,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:55:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:55:03,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:55:03,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:55:03,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83856180] [2024-05-12 11:55:03,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83856180] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:55:03,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:55:03,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 11:55:03,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303112936] [2024-05-12 11:55:03,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:55:03,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 11:55:03,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:55:03,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 11:55:03,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 11:55:03,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 47 [2024-05-12 11:55:03,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 129 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-05-12 11:55:03,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:55:03,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 47 [2024-05-12 11:55:03,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:55:03,560 INFO L124 PetriNetUnfolderBase]: 950/1774 cut-off events. [2024-05-12 11:55:03,561 INFO L125 PetriNetUnfolderBase]: For 157/157 co-relation queries the response was YES. [2024-05-12 11:55:03,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3478 conditions, 1774 events. 950/1774 cut-off events. For 157/157 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 11592 event pairs, 463 based on Foata normal form. 0/1666 useless extension candidates. Maximal degree in co-relation 3463. Up to 1207 conditions per place. [2024-05-12 11:55:03,569 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 37 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2024-05-12 11:55:03,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 61 transitions, 236 flow [2024-05-12 11:55:03,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 11:55:03,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 11:55:03,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-05-12 11:55:03,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.75177304964539 [2024-05-12 11:55:03,571 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 129 flow. Second operand 3 states and 106 transitions. [2024-05-12 11:55:03,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 61 transitions, 236 flow [2024-05-12 11:55:03,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 61 transitions, 232 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 11:55:03,573 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 122 flow [2024-05-12 11:55:03,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2024-05-12 11:55:03,574 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 0 predicate places. [2024-05-12 11:55:03,574 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 122 flow [2024-05-12 11:55:03,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-05-12 11:55:03,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:55:03,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:55:03,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 11:55:03,575 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:55:03,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:55:03,575 INFO L85 PathProgramCache]: Analyzing trace with hash -647379475, now seen corresponding path program 1 times [2024-05-12 11:55:03,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:55:03,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108749008] [2024-05-12 11:55:03,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:55:03,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:55:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:55:07,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:55:07,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:55:07,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108749008] [2024-05-12 11:55:07,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108749008] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:55:07,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:55:07,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 11:55:07,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975604409] [2024-05-12 11:55:07,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:55:07,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 11:55:07,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:55:07,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 11:55:07,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 11:55:07,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 11:55:07,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-05-12 11:55:07,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:55:07,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 11:55:07,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:55:08,490 INFO L124 PetriNetUnfolderBase]: 3141/5161 cut-off events. [2024-05-12 11:55:08,490 INFO L125 PetriNetUnfolderBase]: For 1188/1188 co-relation queries the response was YES. [2024-05-12 11:55:08,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10944 conditions, 5161 events. 3141/5161 cut-off events. For 1188/1188 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 31797 event pairs, 2030 based on Foata normal form. 3/4982 useless extension candidates. Maximal degree in co-relation 10928. Up to 4514 conditions per place. [2024-05-12 11:55:08,511 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 51 selfloop transitions, 8 changer transitions 2/71 dead transitions. [2024-05-12 11:55:08,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 71 transitions, 316 flow [2024-05-12 11:55:08,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 11:55:08,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 11:55:08,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2024-05-12 11:55:08,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.601063829787234 [2024-05-12 11:55:08,513 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 122 flow. Second operand 4 states and 113 transitions. [2024-05-12 11:55:08,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 71 transitions, 316 flow [2024-05-12 11:55:08,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 71 transitions, 308 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 11:55:08,514 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 183 flow [2024-05-12 11:55:08,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=183, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2024-05-12 11:55:08,515 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2024-05-12 11:55:08,515 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 183 flow [2024-05-12 11:55:08,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-05-12 11:55:08,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:55:08,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:55:08,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 11:55:08,516 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:55:08,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:55:08,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1406073680, now seen corresponding path program 1 times [2024-05-12 11:55:08,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:55:08,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466039917] [2024-05-12 11:55:08,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:55:08,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:55:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:55:12,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:55:12,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:55:12,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466039917] [2024-05-12 11:55:12,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466039917] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:55:12,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:55:12,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 11:55:12,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503571886] [2024-05-12 11:55:12,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:55:12,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 11:55:12,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:55:12,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 11:55:12,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-12 11:55:12,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 11:55:12,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 183 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 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-05-12 11:55:12,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:55:12,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 11:55:12,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:55:13,272 INFO L124 PetriNetUnfolderBase]: 2799/4687 cut-off events. [2024-05-12 11:55:13,272 INFO L125 PetriNetUnfolderBase]: For 2076/2076 co-relation queries the response was YES. [2024-05-12 11:55:13,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10812 conditions, 4687 events. 2799/4687 cut-off events. For 2076/2076 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 29254 event pairs, 1294 based on Foata normal form. 7/4509 useless extension candidates. Maximal degree in co-relation 10794. Up to 3877 conditions per place. [2024-05-12 11:55:13,297 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 69 selfloop transitions, 18 changer transitions 0/97 dead transitions. [2024-05-12 11:55:13,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 97 transitions, 503 flow [2024-05-12 11:55:13,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 11:55:13,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 11:55:13,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 147 transitions. [2024-05-12 11:55:13,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.625531914893617 [2024-05-12 11:55:13,299 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 183 flow. Second operand 5 states and 147 transitions. [2024-05-12 11:55:13,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 97 transitions, 503 flow [2024-05-12 11:55:13,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 97 transitions, 492 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-05-12 11:55:13,302 INFO L231 Difference]: Finished difference. Result has 61 places, 63 transitions, 299 flow [2024-05-12 11:55:13,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=299, PETRI_PLACES=61, PETRI_TRANSITIONS=63} [2024-05-12 11:55:13,303 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 8 predicate places. [2024-05-12 11:55:13,303 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 63 transitions, 299 flow [2024-05-12 11:55:13,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 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-05-12 11:55:13,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:55:13,304 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:55:13,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 11:55:13,304 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:55:13,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:55:13,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1802248536, now seen corresponding path program 1 times [2024-05-12 11:55:13,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:55:13,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146340218] [2024-05-12 11:55:13,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:55:13,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:55:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:55:17,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:55:17,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:55:17,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146340218] [2024-05-12 11:55:17,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146340218] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:55:17,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:55:17,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 11:55:17,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810000329] [2024-05-12 11:55:17,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:55:17,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 11:55:17,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:55:17,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 11:55:17,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-12 11:55:17,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 11:55:17,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 63 transitions, 299 flow. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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-05-12 11:55:17,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:55:17,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 11:55:17,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:55:18,783 INFO L124 PetriNetUnfolderBase]: 2844/4748 cut-off events. [2024-05-12 11:55:18,784 INFO L125 PetriNetUnfolderBase]: For 5295/5295 co-relation queries the response was YES. [2024-05-12 11:55:18,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13149 conditions, 4748 events. 2844/4748 cut-off events. For 5295/5295 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 29573 event pairs, 1064 based on Foata normal form. 7/4571 useless extension candidates. Maximal degree in co-relation 13127. Up to 3876 conditions per place. [2024-05-12 11:55:18,805 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 80 selfloop transitions, 22 changer transitions 0/112 dead transitions. [2024-05-12 11:55:18,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 112 transitions, 673 flow [2024-05-12 11:55:18,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:55:18,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:55:18,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 175 transitions. [2024-05-12 11:55:18,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6205673758865248 [2024-05-12 11:55:18,807 INFO L175 Difference]: Start difference. First operand has 61 places, 63 transitions, 299 flow. Second operand 6 states and 175 transitions. [2024-05-12 11:55:18,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 112 transitions, 673 flow [2024-05-12 11:55:18,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 112 transitions, 665 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-05-12 11:55:18,812 INFO L231 Difference]: Finished difference. Result has 67 places, 67 transitions, 376 flow [2024-05-12 11:55:18,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=376, PETRI_PLACES=67, PETRI_TRANSITIONS=67} [2024-05-12 11:55:18,812 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 14 predicate places. [2024-05-12 11:55:18,813 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 67 transitions, 376 flow [2024-05-12 11:55:18,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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-05-12 11:55:18,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:55:18,813 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:55:18,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-12 11:55:18,813 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:55:18,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:55:18,814 INFO L85 PathProgramCache]: Analyzing trace with hash 35130755, now seen corresponding path program 1 times [2024-05-12 11:55:18,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:55:18,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811492253] [2024-05-12 11:55:18,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:55:18,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:55:18,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:55:23,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:55:23,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:55:23,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811492253] [2024-05-12 11:55:23,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811492253] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:55:23,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:55:23,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:55:23,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969128537] [2024-05-12 11:55:23,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:55:23,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:55:23,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:55:23,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:55:23,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:55:23,258 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 11:55:23,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 67 transitions, 376 flow. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:55:23,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:55:23,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 11:55:23,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:55:24,580 INFO L124 PetriNetUnfolderBase]: 3033/4622 cut-off events. [2024-05-12 11:55:24,580 INFO L125 PetriNetUnfolderBase]: For 8493/8493 co-relation queries the response was YES. [2024-05-12 11:55:24,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15011 conditions, 4622 events. 3033/4622 cut-off events. For 8493/8493 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 26456 event pairs, 617 based on Foata normal form. 28/4608 useless extension candidates. Maximal degree in co-relation 14986. Up to 3767 conditions per place. [2024-05-12 11:55:24,650 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 98 selfloop transitions, 38 changer transitions 0/146 dead transitions. [2024-05-12 11:55:24,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 146 transitions, 1002 flow [2024-05-12 11:55:24,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:55:24,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:55:24,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 207 transitions. [2024-05-12 11:55:24,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6291793313069909 [2024-05-12 11:55:24,652 INFO L175 Difference]: Start difference. First operand has 67 places, 67 transitions, 376 flow. Second operand 7 states and 207 transitions. [2024-05-12 11:55:24,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 146 transitions, 1002 flow [2024-05-12 11:55:24,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 146 transitions, 949 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-05-12 11:55:24,665 INFO L231 Difference]: Finished difference. Result has 72 places, 85 transitions, 601 flow [2024-05-12 11:55:24,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=601, PETRI_PLACES=72, PETRI_TRANSITIONS=85} [2024-05-12 11:55:24,668 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 19 predicate places. [2024-05-12 11:55:24,668 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 85 transitions, 601 flow [2024-05-12 11:55:24,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:55:24,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:55:24,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:55:24,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-12 11:55:24,669 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:55:24,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:55:24,669 INFO L85 PathProgramCache]: Analyzing trace with hash -2086859144, now seen corresponding path program 1 times [2024-05-12 11:55:24,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:55:24,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381264457] [2024-05-12 11:55:24,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:55:24,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:55:24,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:55:34,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:55:34,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:55:34,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381264457] [2024-05-12 11:55:34,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381264457] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:55:34,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:55:34,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 11:55:34,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132946070] [2024-05-12 11:55:34,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:55:34,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 11:55:34,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:55:34,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 11:55:34,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-05-12 11:55:34,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2024-05-12 11:55:34,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 85 transitions, 601 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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-05-12 11:55:34,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:55:34,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2024-05-12 11:55:34,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:55:35,760 INFO L124 PetriNetUnfolderBase]: 3511/5944 cut-off events. [2024-05-12 11:55:35,761 INFO L125 PetriNetUnfolderBase]: For 15928/15928 co-relation queries the response was YES. [2024-05-12 11:55:35,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20085 conditions, 5944 events. 3511/5944 cut-off events. For 15928/15928 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 38486 event pairs, 1329 based on Foata normal form. 4/5747 useless extension candidates. Maximal degree in co-relation 20056. Up to 5051 conditions per place. [2024-05-12 11:55:35,843 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 82 selfloop transitions, 13 changer transitions 0/104 dead transitions. [2024-05-12 11:55:35,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 104 transitions, 841 flow [2024-05-12 11:55:35,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 11:55:35,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 11:55:35,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2024-05-12 11:55:35,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5063829787234042 [2024-05-12 11:55:35,846 INFO L175 Difference]: Start difference. First operand has 72 places, 85 transitions, 601 flow. Second operand 5 states and 119 transitions. [2024-05-12 11:55:35,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 104 transitions, 841 flow [2024-05-12 11:55:35,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 104 transitions, 797 flow, removed 22 selfloop flow, removed 0 redundant places. [2024-05-12 11:55:35,862 INFO L231 Difference]: Finished difference. Result has 77 places, 85 transitions, 594 flow [2024-05-12 11:55:35,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=594, PETRI_PLACES=77, PETRI_TRANSITIONS=85} [2024-05-12 11:55:35,863 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 24 predicate places. [2024-05-12 11:55:35,863 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 85 transitions, 594 flow [2024-05-12 11:55:35,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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-05-12 11:55:35,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:55:35,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:55:35,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-12 11:55:35,864 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:55:35,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:55:35,864 INFO L85 PathProgramCache]: Analyzing trace with hash -901984556, now seen corresponding path program 1 times [2024-05-12 11:55:35,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:55:35,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509897764] [2024-05-12 11:55:35,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:55:35,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:55:35,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:55:43,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:55:43,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:55:43,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509897764] [2024-05-12 11:55:43,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509897764] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:55:43,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:55:43,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:55:43,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236062953] [2024-05-12 11:55:43,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:55:43,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:55:43,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:55:43,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:55:43,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:55:43,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2024-05-12 11:55:43,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 85 transitions, 594 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 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-05-12 11:55:43,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:55:43,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2024-05-12 11:55:43,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:55:45,156 INFO L124 PetriNetUnfolderBase]: 3547/5824 cut-off events. [2024-05-12 11:55:45,157 INFO L125 PetriNetUnfolderBase]: For 14645/14645 co-relation queries the response was YES. [2024-05-12 11:55:45,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19307 conditions, 5824 events. 3547/5824 cut-off events. For 14645/14645 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 36369 event pairs, 1052 based on Foata normal form. 8/5634 useless extension candidates. Maximal degree in co-relation 19274. Up to 4907 conditions per place. [2024-05-12 11:55:45,191 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 90 selfloop transitions, 21 changer transitions 0/120 dead transitions. [2024-05-12 11:55:45,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 120 transitions, 961 flow [2024-05-12 11:55:45,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:55:45,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:55:45,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2024-05-12 11:55:45,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5354609929078015 [2024-05-12 11:55:45,193 INFO L175 Difference]: Start difference. First operand has 77 places, 85 transitions, 594 flow. Second operand 6 states and 151 transitions. [2024-05-12 11:55:45,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 120 transitions, 961 flow [2024-05-12 11:55:45,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 120 transitions, 924 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-05-12 11:55:45,205 INFO L231 Difference]: Finished difference. Result has 79 places, 88 transitions, 642 flow [2024-05-12 11:55:45,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=642, PETRI_PLACES=79, PETRI_TRANSITIONS=88} [2024-05-12 11:55:45,206 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 26 predicate places. [2024-05-12 11:55:45,206 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 88 transitions, 642 flow [2024-05-12 11:55:45,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 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-05-12 11:55:45,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:55:45,207 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:55:45,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-12 11:55:45,207 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:55:45,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:55:45,207 INFO L85 PathProgramCache]: Analyzing trace with hash 2097289910, now seen corresponding path program 2 times [2024-05-12 11:55:45,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:55:45,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957103091] [2024-05-12 11:55:45,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:55:45,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:55:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:55:52,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:55:52,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:55:52,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957103091] [2024-05-12 11:55:52,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957103091] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:55:52,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:55:52,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:55:52,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986394709] [2024-05-12 11:55:52,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:55:52,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:55:52,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:55:52,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:55:52,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:55:52,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2024-05-12 11:55:52,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 88 transitions, 642 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 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-05-12 11:55:52,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:55:52,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2024-05-12 11:55:52,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:55:54,391 INFO L124 PetriNetUnfolderBase]: 3521/5951 cut-off events. [2024-05-12 11:55:54,391 INFO L125 PetriNetUnfolderBase]: For 16133/16133 co-relation queries the response was YES. [2024-05-12 11:55:54,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19669 conditions, 5951 events. 3521/5951 cut-off events. For 16133/16133 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 38547 event pairs, 1323 based on Foata normal form. 4/5755 useless extension candidates. Maximal degree in co-relation 19636. Up to 5050 conditions per place. [2024-05-12 11:55:54,426 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 90 selfloop transitions, 13 changer transitions 0/112 dead transitions. [2024-05-12 11:55:54,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 112 transitions, 910 flow [2024-05-12 11:55:54,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:55:54,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:55:54,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2024-05-12 11:55:54,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49645390070921985 [2024-05-12 11:55:54,428 INFO L175 Difference]: Start difference. First operand has 79 places, 88 transitions, 642 flow. Second operand 6 states and 140 transitions. [2024-05-12 11:55:54,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 112 transitions, 910 flow [2024-05-12 11:55:54,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 112 transitions, 877 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-05-12 11:55:54,445 INFO L231 Difference]: Finished difference. Result has 82 places, 88 transitions, 643 flow [2024-05-12 11:55:54,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=643, PETRI_PLACES=82, PETRI_TRANSITIONS=88} [2024-05-12 11:55:54,446 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 29 predicate places. [2024-05-12 11:55:54,446 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 88 transitions, 643 flow [2024-05-12 11:55:54,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 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-05-12 11:55:54,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:55:54,446 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:55:54,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-12 11:55:54,449 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:55:54,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:55:54,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1131592148, now seen corresponding path program 1 times [2024-05-12 11:55:54,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:55:54,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304994048] [2024-05-12 11:55:54,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:55:54,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:55:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:56:05,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:56:05,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:56:05,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304994048] [2024-05-12 11:56:05,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304994048] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:56:05,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:56:05,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:56:05,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973346690] [2024-05-12 11:56:05,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:56:05,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:56:05,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:56:05,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:56:05,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:56:06,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 11:56:06,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 88 transitions, 643 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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-05-12 11:56:06,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:56:06,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 11:56:06,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:56:08,059 INFO L124 PetriNetUnfolderBase]: 4304/7179 cut-off events. [2024-05-12 11:56:08,059 INFO L125 PetriNetUnfolderBase]: For 21029/21029 co-relation queries the response was YES. [2024-05-12 11:56:08,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23391 conditions, 7179 events. 4304/7179 cut-off events. For 21029/21029 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 46214 event pairs, 1636 based on Foata normal form. 4/6939 useless extension candidates. Maximal degree in co-relation 23357. Up to 6110 conditions per place. [2024-05-12 11:56:08,099 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 103 selfloop transitions, 20 changer transitions 0/131 dead transitions. [2024-05-12 11:56:08,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 131 transitions, 1051 flow [2024-05-12 11:56:08,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:56:08,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:56:08,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 159 transitions. [2024-05-12 11:56:08,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48328267477203646 [2024-05-12 11:56:08,101 INFO L175 Difference]: Start difference. First operand has 82 places, 88 transitions, 643 flow. Second operand 7 states and 159 transitions. [2024-05-12 11:56:08,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 131 transitions, 1051 flow [2024-05-12 11:56:08,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 131 transitions, 986 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-05-12 11:56:08,119 INFO L231 Difference]: Finished difference. Result has 84 places, 95 transitions, 705 flow [2024-05-12 11:56:08,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=705, PETRI_PLACES=84, PETRI_TRANSITIONS=95} [2024-05-12 11:56:08,120 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 31 predicate places. [2024-05-12 11:56:08,120 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 95 transitions, 705 flow [2024-05-12 11:56:08,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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-05-12 11:56:08,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:56:08,121 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:56:08,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-12 11:56:08,121 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:56:08,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:56:08,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1605120702, now seen corresponding path program 1 times [2024-05-12 11:56:08,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:56:08,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189988418] [2024-05-12 11:56:08,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:56:08,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:56:08,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:56:21,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:56:21,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:56:21,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189988418] [2024-05-12 11:56:21,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189988418] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:56:21,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:56:21,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:56:21,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011262279] [2024-05-12 11:56:21,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:56:21,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:56:21,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:56:21,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:56:21,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:56:21,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 11:56:21,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 95 transitions, 705 flow. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 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-05-12 11:56:21,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:56:21,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 11:56:21,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:56:22,886 INFO L124 PetriNetUnfolderBase]: 4295/6881 cut-off events. [2024-05-12 11:56:22,886 INFO L125 PetriNetUnfolderBase]: For 23156/23156 co-relation queries the response was YES. [2024-05-12 11:56:22,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23834 conditions, 6881 events. 4295/6881 cut-off events. For 23156/23156 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 42174 event pairs, 1682 based on Foata normal form. 3/6713 useless extension candidates. Maximal degree in co-relation 23799. Up to 6150 conditions per place. [2024-05-12 11:56:22,927 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 96 selfloop transitions, 11 changer transitions 0/115 dead transitions. [2024-05-12 11:56:22,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 115 transitions, 985 flow [2024-05-12 11:56:22,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 11:56:22,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 11:56:22,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2024-05-12 11:56:22,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4765957446808511 [2024-05-12 11:56:22,929 INFO L175 Difference]: Start difference. First operand has 84 places, 95 transitions, 705 flow. Second operand 5 states and 112 transitions. [2024-05-12 11:56:22,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 115 transitions, 985 flow [2024-05-12 11:56:22,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 115 transitions, 938 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-05-12 11:56:22,948 INFO L231 Difference]: Finished difference. Result has 85 places, 98 transitions, 717 flow [2024-05-12 11:56:22,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=717, PETRI_PLACES=85, PETRI_TRANSITIONS=98} [2024-05-12 11:56:22,948 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 32 predicate places. [2024-05-12 11:56:22,949 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 98 transitions, 717 flow [2024-05-12 11:56:22,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 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-05-12 11:56:22,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:56:22,949 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:56:22,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-12 11:56:22,949 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:56:22,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:56:22,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1818367221, now seen corresponding path program 1 times [2024-05-12 11:56:22,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:56:22,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903791988] [2024-05-12 11:56:22,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:56:22,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:56:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:56:31,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:56:31,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:56:31,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903791988] [2024-05-12 11:56:31,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903791988] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:56:31,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:56:31,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:56:31,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943947590] [2024-05-12 11:56:31,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:56:31,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:56:31,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:56:31,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:56:31,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:56:31,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2024-05-12 11:56:31,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 98 transitions, 717 flow. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 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-05-12 11:56:31,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:56:31,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2024-05-12 11:56:31,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:56:33,925 INFO L124 PetriNetUnfolderBase]: 4182/6618 cut-off events. [2024-05-12 11:56:33,925 INFO L125 PetriNetUnfolderBase]: For 25002/25002 co-relation queries the response was YES. [2024-05-12 11:56:33,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23872 conditions, 6618 events. 4182/6618 cut-off events. For 25002/25002 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 40598 event pairs, 1069 based on Foata normal form. 4/6452 useless extension candidates. Maximal degree in co-relation 23836. Up to 5585 conditions per place. [2024-05-12 11:56:33,990 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 108 selfloop transitions, 30 changer transitions 0/148 dead transitions. [2024-05-12 11:56:33,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 148 transitions, 1203 flow [2024-05-12 11:56:33,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:56:33,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:56:33,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 178 transitions. [2024-05-12 11:56:33,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.541033434650456 [2024-05-12 11:56:33,992 INFO L175 Difference]: Start difference. First operand has 85 places, 98 transitions, 717 flow. Second operand 7 states and 178 transitions. [2024-05-12 11:56:33,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 148 transitions, 1203 flow [2024-05-12 11:56:34,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 148 transitions, 1170 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-05-12 11:56:34,017 INFO L231 Difference]: Finished difference. Result has 89 places, 104 transitions, 806 flow [2024-05-12 11:56:34,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=806, PETRI_PLACES=89, PETRI_TRANSITIONS=104} [2024-05-12 11:56:34,019 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 36 predicate places. [2024-05-12 11:56:34,020 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 104 transitions, 806 flow [2024-05-12 11:56:34,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 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-05-12 11:56:34,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:56:34,020 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:56:34,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-05-12 11:56:34,020 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:56:34,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:56:34,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1009389225, now seen corresponding path program 2 times [2024-05-12 11:56:34,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:56:34,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668580331] [2024-05-12 11:56:34,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:56:34,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:56:34,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:56:42,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:56:42,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:56:42,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668580331] [2024-05-12 11:56:42,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668580331] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:56:42,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:56:42,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:56:42,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405936735] [2024-05-12 11:56:42,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:56:42,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:56:42,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:56:42,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:56:42,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:56:42,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2024-05-12 11:56:42,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 104 transitions, 806 flow. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 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-05-12 11:56:42,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:56:42,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2024-05-12 11:56:42,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:56:44,436 INFO L124 PetriNetUnfolderBase]: 4076/6387 cut-off events. [2024-05-12 11:56:44,437 INFO L125 PetriNetUnfolderBase]: For 28473/28473 co-relation queries the response was YES. [2024-05-12 11:56:44,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24153 conditions, 6387 events. 4076/6387 cut-off events. For 28473/28473 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 38735 event pairs, 1179 based on Foata normal form. 4/6256 useless extension candidates. Maximal degree in co-relation 24116. Up to 5607 conditions per place. [2024-05-12 11:56:44,475 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 107 selfloop transitions, 26 changer transitions 0/143 dead transitions. [2024-05-12 11:56:44,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 143 transitions, 1180 flow [2024-05-12 11:56:44,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:56:44,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:56:44,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 173 transitions. [2024-05-12 11:56:44,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5258358662613982 [2024-05-12 11:56:44,477 INFO L175 Difference]: Start difference. First operand has 89 places, 104 transitions, 806 flow. Second operand 7 states and 173 transitions. [2024-05-12 11:56:44,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 143 transitions, 1180 flow [2024-05-12 11:56:44,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 143 transitions, 1132 flow, removed 12 selfloop flow, removed 3 redundant places. [2024-05-12 11:56:44,504 INFO L231 Difference]: Finished difference. Result has 93 places, 104 transitions, 818 flow [2024-05-12 11:56:44,504 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=818, PETRI_PLACES=93, PETRI_TRANSITIONS=104} [2024-05-12 11:56:44,505 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 40 predicate places. [2024-05-12 11:56:44,505 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 104 transitions, 818 flow [2024-05-12 11:56:44,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 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-05-12 11:56:44,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:56:44,505 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:56:44,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-05-12 11:56:44,506 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:56:44,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:56:44,506 INFO L85 PathProgramCache]: Analyzing trace with hash -2110261121, now seen corresponding path program 1 times [2024-05-12 11:56:44,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:56:44,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467979353] [2024-05-12 11:56:44,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:56:44,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:56:44,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:56:52,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:56:52,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:56:52,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467979353] [2024-05-12 11:56:52,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467979353] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:56:52,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:56:52,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:56:52,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47937473] [2024-05-12 11:56:52,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:56:52,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:56:52,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:56:52,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:56:52,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:56:52,329 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2024-05-12 11:56:52,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 104 transitions, 818 flow. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 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-05-12 11:56:52,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:56:52,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2024-05-12 11:56:52,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:56:53,632 INFO L124 PetriNetUnfolderBase]: 3796/6029 cut-off events. [2024-05-12 11:56:53,633 INFO L125 PetriNetUnfolderBase]: For 31311/31311 co-relation queries the response was YES. [2024-05-12 11:56:53,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23588 conditions, 6029 events. 3796/6029 cut-off events. For 31311/31311 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 36904 event pairs, 1746 based on Foata normal form. 2/5896 useless extension candidates. Maximal degree in co-relation 23549. Up to 5394 conditions per place. [2024-05-12 11:56:53,670 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 109 selfloop transitions, 24 changer transitions 0/142 dead transitions. [2024-05-12 11:56:53,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 142 transitions, 1241 flow [2024-05-12 11:56:53,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:56:53,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:56:53,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 162 transitions. [2024-05-12 11:56:53,671 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49240121580547114 [2024-05-12 11:56:53,671 INFO L175 Difference]: Start difference. First operand has 93 places, 104 transitions, 818 flow. Second operand 7 states and 162 transitions. [2024-05-12 11:56:53,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 142 transitions, 1241 flow [2024-05-12 11:56:53,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 142 transitions, 1148 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-05-12 11:56:53,700 INFO L231 Difference]: Finished difference. Result has 94 places, 110 transitions, 864 flow [2024-05-12 11:56:53,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=864, PETRI_PLACES=94, PETRI_TRANSITIONS=110} [2024-05-12 11:56:53,701 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 41 predicate places. [2024-05-12 11:56:53,701 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 110 transitions, 864 flow [2024-05-12 11:56:53,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 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-05-12 11:56:53,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:56:53,701 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:56:53,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-05-12 11:56:53,702 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:56:53,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:56:53,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1823643232, now seen corresponding path program 1 times [2024-05-12 11:56:53,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:56:53,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839159419] [2024-05-12 11:56:53,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:56:53,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:56:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:57:02,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:57:02,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:57:02,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839159419] [2024-05-12 11:57:02,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839159419] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:57:02,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:57:02,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:57:02,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737380471] [2024-05-12 11:57:02,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:57:02,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:57:02,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:57:02,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:57:02,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:57:02,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2024-05-12 11:57:02,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 110 transitions, 864 flow. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:57:02,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:57:02,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2024-05-12 11:57:02,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:57:04,956 INFO L124 PetriNetUnfolderBase]: 4444/6712 cut-off events. [2024-05-12 11:57:04,956 INFO L125 PetriNetUnfolderBase]: For 37567/37567 co-relation queries the response was YES. [2024-05-12 11:57:04,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26739 conditions, 6712 events. 4444/6712 cut-off events. For 37567/37567 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 39159 event pairs, 541 based on Foata normal form. 16/6665 useless extension candidates. Maximal degree in co-relation 26699. Up to 4996 conditions per place. [2024-05-12 11:57:04,998 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 117 selfloop transitions, 53 changer transitions 0/180 dead transitions. [2024-05-12 11:57:04,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 180 transitions, 1564 flow [2024-05-12 11:57:04,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:57:05,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:57:05,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 210 transitions. [2024-05-12 11:57:05,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5585106382978723 [2024-05-12 11:57:05,001 INFO L175 Difference]: Start difference. First operand has 94 places, 110 transitions, 864 flow. Second operand 8 states and 210 transitions. [2024-05-12 11:57:05,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 180 transitions, 1564 flow [2024-05-12 11:57:05,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 180 transitions, 1520 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-05-12 11:57:05,032 INFO L231 Difference]: Finished difference. Result has 98 places, 115 transitions, 1015 flow [2024-05-12 11:57:05,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=820, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1015, PETRI_PLACES=98, PETRI_TRANSITIONS=115} [2024-05-12 11:57:05,032 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 45 predicate places. [2024-05-12 11:57:05,032 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 115 transitions, 1015 flow [2024-05-12 11:57:05,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:57:05,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:57:05,033 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:57:05,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-05-12 11:57:05,033 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:57:05,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:57:05,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1823582782, now seen corresponding path program 2 times [2024-05-12 11:57:05,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:57:05,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531670728] [2024-05-12 11:57:05,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:57:05,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:57:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:57:13,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:57:13,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:57:13,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531670728] [2024-05-12 11:57:13,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531670728] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:57:13,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:57:13,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:57:13,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257189511] [2024-05-12 11:57:13,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:57:13,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:57:13,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:57:13,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:57:13,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:57:13,734 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2024-05-12 11:57:13,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 115 transitions, 1015 flow. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:57:13,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:57:13,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2024-05-12 11:57:13,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:57:15,853 INFO L124 PetriNetUnfolderBase]: 4621/6983 cut-off events. [2024-05-12 11:57:15,853 INFO L125 PetriNetUnfolderBase]: For 46624/46624 co-relation queries the response was YES. [2024-05-12 11:57:15,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29640 conditions, 6983 events. 4621/6983 cut-off events. For 46624/46624 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 41183 event pairs, 957 based on Foata normal form. 20/6940 useless extension candidates. Maximal degree in co-relation 29598. Up to 5878 conditions per place. [2024-05-12 11:57:15,895 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 114 selfloop transitions, 55 changer transitions 0/179 dead transitions. [2024-05-12 11:57:15,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 179 transitions, 1648 flow [2024-05-12 11:57:15,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:57:15,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:57:15,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 206 transitions. [2024-05-12 11:57:15,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5478723404255319 [2024-05-12 11:57:15,897 INFO L175 Difference]: Start difference. First operand has 98 places, 115 transitions, 1015 flow. Second operand 8 states and 206 transitions. [2024-05-12 11:57:15,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 179 transitions, 1648 flow [2024-05-12 11:57:15,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 179 transitions, 1589 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-05-12 11:57:15,951 INFO L231 Difference]: Finished difference. Result has 103 places, 119 transitions, 1132 flow [2024-05-12 11:57:15,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=962, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1132, PETRI_PLACES=103, PETRI_TRANSITIONS=119} [2024-05-12 11:57:15,951 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 50 predicate places. [2024-05-12 11:57:15,951 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 119 transitions, 1132 flow [2024-05-12 11:57:15,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:57:15,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:57:15,952 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:57:15,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-05-12 11:57:15,952 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:57:15,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:57:15,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1820786272, now seen corresponding path program 3 times [2024-05-12 11:57:15,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:57:15,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984168307] [2024-05-12 11:57:15,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:57:15,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:57:16,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:57:24,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:57:24,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:57:24,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984168307] [2024-05-12 11:57:24,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984168307] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:57:24,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:57:24,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:57:24,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500285236] [2024-05-12 11:57:24,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:57:24,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:57:24,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:57:24,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:57:24,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:57:24,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2024-05-12 11:57:24,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 119 transitions, 1132 flow. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:57:24,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:57:24,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2024-05-12 11:57:24,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:57:26,880 INFO L124 PetriNetUnfolderBase]: 4595/6931 cut-off events. [2024-05-12 11:57:26,880 INFO L125 PetriNetUnfolderBase]: For 48209/48209 co-relation queries the response was YES. [2024-05-12 11:57:26,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29942 conditions, 6931 events. 4595/6931 cut-off events. For 48209/48209 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 40619 event pairs, 981 based on Foata normal form. 20/6899 useless extension candidates. Maximal degree in co-relation 29898. Up to 5992 conditions per place. [2024-05-12 11:57:26,925 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 120 selfloop transitions, 49 changer transitions 0/179 dead transitions. [2024-05-12 11:57:26,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 179 transitions, 1743 flow [2024-05-12 11:57:26,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:57:26,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:57:26,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 203 transitions. [2024-05-12 11:57:26,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5398936170212766 [2024-05-12 11:57:26,927 INFO L175 Difference]: Start difference. First operand has 103 places, 119 transitions, 1132 flow. Second operand 8 states and 203 transitions. [2024-05-12 11:57:26,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 179 transitions, 1743 flow [2024-05-12 11:57:26,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 179 transitions, 1614 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-05-12 11:57:26,983 INFO L231 Difference]: Finished difference. Result has 107 places, 122 transitions, 1161 flow [2024-05-12 11:57:26,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1007, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1161, PETRI_PLACES=107, PETRI_TRANSITIONS=122} [2024-05-12 11:57:26,983 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 54 predicate places. [2024-05-12 11:57:26,983 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 122 transitions, 1161 flow [2024-05-12 11:57:26,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:57:26,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:57:26,984 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:57:26,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-05-12 11:57:26,984 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:57:26,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:57:26,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1705310404, now seen corresponding path program 1 times [2024-05-12 11:57:26,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:57:26,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655834450] [2024-05-12 11:57:26,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:57:26,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:57:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:57:35,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:57:35,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:57:35,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655834450] [2024-05-12 11:57:35,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655834450] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:57:35,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:57:35,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:57:35,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246018678] [2024-05-12 11:57:35,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:57:35,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:57:35,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:57:35,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:57:35,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:57:35,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 11:57:35,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 122 transitions, 1161 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:57:35,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:57:35,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 11:57:35,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:57:37,835 INFO L124 PetriNetUnfolderBase]: 4959/7876 cut-off events. [2024-05-12 11:57:37,836 INFO L125 PetriNetUnfolderBase]: For 51115/51118 co-relation queries the response was YES. [2024-05-12 11:57:37,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32522 conditions, 7876 events. 4959/7876 cut-off events. For 51115/51118 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 49314 event pairs, 1331 based on Foata normal form. 10/7675 useless extension candidates. Maximal degree in co-relation 32476. Up to 6749 conditions per place. [2024-05-12 11:57:37,887 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 138 selfloop transitions, 32 changer transitions 0/178 dead transitions. [2024-05-12 11:57:37,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 178 transitions, 1711 flow [2024-05-12 11:57:37,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:57:37,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:57:37,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 192 transitions. [2024-05-12 11:57:37,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5106382978723404 [2024-05-12 11:57:37,898 INFO L175 Difference]: Start difference. First operand has 107 places, 122 transitions, 1161 flow. Second operand 8 states and 192 transitions. [2024-05-12 11:57:37,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 178 transitions, 1711 flow [2024-05-12 11:57:37,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 178 transitions, 1605 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-05-12 11:57:37,948 INFO L231 Difference]: Finished difference. Result has 111 places, 129 transitions, 1214 flow [2024-05-12 11:57:37,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1057, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1214, PETRI_PLACES=111, PETRI_TRANSITIONS=129} [2024-05-12 11:57:37,948 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 58 predicate places. [2024-05-12 11:57:37,948 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 129 transitions, 1214 flow [2024-05-12 11:57:37,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:57:37,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:57:37,949 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:57:37,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-05-12 11:57:37,949 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:57:37,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:57:37,949 INFO L85 PathProgramCache]: Analyzing trace with hash 627334784, now seen corresponding path program 1 times [2024-05-12 11:57:37,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:57:37,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777503357] [2024-05-12 11:57:37,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:57:37,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:57:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:57:48,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:57:48,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:57:48,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777503357] [2024-05-12 11:57:48,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777503357] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:57:48,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:57:48,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:57:48,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001671521] [2024-05-12 11:57:48,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:57:48,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:57:48,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:57:48,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:57:48,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:57:48,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 11:57:48,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 129 transitions, 1214 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 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-05-12 11:57:48,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:57:48,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 11:57:48,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:57:50,434 INFO L124 PetriNetUnfolderBase]: 5055/7979 cut-off events. [2024-05-12 11:57:50,434 INFO L125 PetriNetUnfolderBase]: For 55961/55961 co-relation queries the response was YES. [2024-05-12 11:57:50,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33894 conditions, 7979 events. 5055/7979 cut-off events. For 55961/55961 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 49720 event pairs, 1498 based on Foata normal form. 3/7782 useless extension candidates. Maximal degree in co-relation 33846. Up to 7217 conditions per place. [2024-05-12 11:57:50,479 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 145 selfloop transitions, 19 changer transitions 0/172 dead transitions. [2024-05-12 11:57:50,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 172 transitions, 1730 flow [2024-05-12 11:57:50,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:57:50,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:57:50,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 158 transitions. [2024-05-12 11:57:50,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48024316109422494 [2024-05-12 11:57:50,480 INFO L175 Difference]: Start difference. First operand has 111 places, 129 transitions, 1214 flow. Second operand 7 states and 158 transitions. [2024-05-12 11:57:50,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 172 transitions, 1730 flow [2024-05-12 11:57:50,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 172 transitions, 1650 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-05-12 11:57:50,530 INFO L231 Difference]: Finished difference. Result has 114 places, 139 transitions, 1267 flow [2024-05-12 11:57:50,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1134, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1267, PETRI_PLACES=114, PETRI_TRANSITIONS=139} [2024-05-12 11:57:50,531 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 61 predicate places. [2024-05-12 11:57:50,531 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 139 transitions, 1267 flow [2024-05-12 11:57:50,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 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-05-12 11:57:50,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:57:50,532 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:57:50,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-05-12 11:57:50,532 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:57:50,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:57:50,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1092142884, now seen corresponding path program 2 times [2024-05-12 11:57:50,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:57:50,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459953893] [2024-05-12 11:57:50,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:57:50,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:57:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:57:59,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:57:59,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:57:59,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459953893] [2024-05-12 11:57:59,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459953893] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:57:59,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:57:59,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:57:59,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962362047] [2024-05-12 11:57:59,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:57:59,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:57:59,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:57:59,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:57:59,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:57:59,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 11:57:59,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 139 transitions, 1267 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:57:59,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:57:59,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 11:57:59,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:58:02,019 INFO L124 PetriNetUnfolderBase]: 5092/8041 cut-off events. [2024-05-12 11:58:02,019 INFO L125 PetriNetUnfolderBase]: For 62701/62701 co-relation queries the response was YES. [2024-05-12 11:58:02,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35226 conditions, 8041 events. 5092/8041 cut-off events. For 62701/62701 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 50192 event pairs, 1750 based on Foata normal form. 4/7880 useless extension candidates. Maximal degree in co-relation 35176. Up to 7277 conditions per place. [2024-05-12 11:58:02,077 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 155 selfloop transitions, 19 changer transitions 0/182 dead transitions. [2024-05-12 11:58:02,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 182 transitions, 1758 flow [2024-05-12 11:58:02,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:58:02,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:58:02,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 178 transitions. [2024-05-12 11:58:02,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4734042553191489 [2024-05-12 11:58:02,079 INFO L175 Difference]: Start difference. First operand has 114 places, 139 transitions, 1267 flow. Second operand 8 states and 178 transitions. [2024-05-12 11:58:02,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 182 transitions, 1758 flow [2024-05-12 11:58:02,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 182 transitions, 1725 flow, removed 13 selfloop flow, removed 2 redundant places. [2024-05-12 11:58:02,137 INFO L231 Difference]: Finished difference. Result has 121 places, 143 transitions, 1329 flow [2024-05-12 11:58:02,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1234, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1329, PETRI_PLACES=121, PETRI_TRANSITIONS=143} [2024-05-12 11:58:02,138 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 68 predicate places. [2024-05-12 11:58:02,138 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 143 transitions, 1329 flow [2024-05-12 11:58:02,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:58:02,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:58:02,138 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:58:02,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-05-12 11:58:02,139 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:58:02,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:58:02,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1301655620, now seen corresponding path program 3 times [2024-05-12 11:58:02,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:58:02,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860709312] [2024-05-12 11:58:02,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:58:02,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:58:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:58:10,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:58:10,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:58:10,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860709312] [2024-05-12 11:58:10,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860709312] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:58:10,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:58:10,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:58:10,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58490139] [2024-05-12 11:58:10,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:58:10,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:58:10,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:58:10,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:58:10,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:58:10,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 11:58:10,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 143 transitions, 1329 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:58:10,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:58:10,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 11:58:10,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:58:12,678 INFO L124 PetriNetUnfolderBase]: 5134/8103 cut-off events. [2024-05-12 11:58:12,678 INFO L125 PetriNetUnfolderBase]: For 68612/68612 co-relation queries the response was YES. [2024-05-12 11:58:12,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36093 conditions, 8103 events. 5134/8103 cut-off events. For 68612/68612 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 50550 event pairs, 1743 based on Foata normal form. 4/7942 useless extension candidates. Maximal degree in co-relation 36040. Up to 7277 conditions per place. [2024-05-12 11:58:12,740 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 156 selfloop transitions, 27 changer transitions 0/191 dead transitions. [2024-05-12 11:58:12,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 191 transitions, 1902 flow [2024-05-12 11:58:12,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:58:12,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:58:12,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 179 transitions. [2024-05-12 11:58:12,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47606382978723405 [2024-05-12 11:58:12,742 INFO L175 Difference]: Start difference. First operand has 121 places, 143 transitions, 1329 flow. Second operand 8 states and 179 transitions. [2024-05-12 11:58:12,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 191 transitions, 1902 flow [2024-05-12 11:58:12,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 191 transitions, 1849 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-05-12 11:58:12,804 INFO L231 Difference]: Finished difference. Result has 127 places, 152 transitions, 1477 flow [2024-05-12 11:58:12,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1276, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1477, PETRI_PLACES=127, PETRI_TRANSITIONS=152} [2024-05-12 11:58:12,804 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 74 predicate places. [2024-05-12 11:58:12,804 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 152 transitions, 1477 flow [2024-05-12 11:58:12,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:58:12,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:58:12,805 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:58:12,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-05-12 11:58:12,805 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:58:12,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:58:12,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1566430340, now seen corresponding path program 4 times [2024-05-12 11:58:12,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:58:12,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793090333] [2024-05-12 11:58:12,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:58:12,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:58:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:58:21,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:58:21,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:58:21,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793090333] [2024-05-12 11:58:21,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793090333] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:58:21,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:58:21,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:58:21,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777582530] [2024-05-12 11:58:21,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:58:21,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:58:21,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:58:21,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:58:21,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:58:21,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 11:58:21,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 152 transitions, 1477 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 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-05-12 11:58:21,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:58:21,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 11:58:21,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:58:23,805 INFO L124 PetriNetUnfolderBase]: 5171/8166 cut-off events. [2024-05-12 11:58:23,805 INFO L125 PetriNetUnfolderBase]: For 76441/76441 co-relation queries the response was YES. [2024-05-12 11:58:23,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37328 conditions, 8166 events. 5171/8166 cut-off events. For 76441/76441 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 50976 event pairs, 1756 based on Foata normal form. 4/8003 useless extension candidates. Maximal degree in co-relation 37272. Up to 7345 conditions per place. [2024-05-12 11:58:23,953 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 167 selfloop transitions, 24 changer transitions 0/199 dead transitions. [2024-05-12 11:58:23,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 199 transitions, 2051 flow [2024-05-12 11:58:23,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:58:23,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:58:23,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 182 transitions. [2024-05-12 11:58:23,954 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48404255319148937 [2024-05-12 11:58:23,954 INFO L175 Difference]: Start difference. First operand has 127 places, 152 transitions, 1477 flow. Second operand 8 states and 182 transitions. [2024-05-12 11:58:23,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 199 transitions, 2051 flow [2024-05-12 11:58:24,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 199 transitions, 1979 flow, removed 20 selfloop flow, removed 4 redundant places. [2024-05-12 11:58:24,027 INFO L231 Difference]: Finished difference. Result has 132 places, 157 transitions, 1542 flow [2024-05-12 11:58:24,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1409, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1542, PETRI_PLACES=132, PETRI_TRANSITIONS=157} [2024-05-12 11:58:24,028 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 79 predicate places. [2024-05-12 11:58:24,028 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 157 transitions, 1542 flow [2024-05-12 11:58:24,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 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-05-12 11:58:24,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:58:24,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:58:24,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-05-12 11:58:24,028 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:58:24,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:58:24,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1301655868, now seen corresponding path program 1 times [2024-05-12 11:58:24,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:58:24,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426146418] [2024-05-12 11:58:24,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:58:24,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:58:24,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:58:31,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:58:31,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:58:31,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426146418] [2024-05-12 11:58:31,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426146418] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:58:31,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:58:31,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:58:31,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668445919] [2024-05-12 11:58:31,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:58:31,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:58:31,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:58:31,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:58:31,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:58:31,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2024-05-12 11:58:31,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 157 transitions, 1542 flow. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:58:31,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:58:31,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2024-05-12 11:58:31,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:58:33,461 INFO L124 PetriNetUnfolderBase]: 4478/7204 cut-off events. [2024-05-12 11:58:33,462 INFO L125 PetriNetUnfolderBase]: For 72696/72699 co-relation queries the response was YES. [2024-05-12 11:58:33,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33563 conditions, 7204 events. 4478/7204 cut-off events. For 72696/72699 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 46108 event pairs, 1600 based on Foata normal form. 4/7033 useless extension candidates. Maximal degree in co-relation 33505. Up to 6350 conditions per place. [2024-05-12 11:58:33,509 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 151 selfloop transitions, 35 changer transitions 0/195 dead transitions. [2024-05-12 11:58:33,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 195 transitions, 2075 flow [2024-05-12 11:58:33,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:58:33,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:58:33,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 164 transitions. [2024-05-12 11:58:33,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49848024316109424 [2024-05-12 11:58:33,510 INFO L175 Difference]: Start difference. First operand has 132 places, 157 transitions, 1542 flow. Second operand 7 states and 164 transitions. [2024-05-12 11:58:33,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 195 transitions, 2075 flow [2024-05-12 11:58:33,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 195 transitions, 1972 flow, removed 30 selfloop flow, removed 5 redundant places. [2024-05-12 11:58:33,581 INFO L231 Difference]: Finished difference. Result has 134 places, 163 transitions, 1599 flow [2024-05-12 11:58:33,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1447, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1599, PETRI_PLACES=134, PETRI_TRANSITIONS=163} [2024-05-12 11:58:33,582 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 81 predicate places. [2024-05-12 11:58:33,582 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 163 transitions, 1599 flow [2024-05-12 11:58:33,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:58:33,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:58:33,583 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:58:33,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-05-12 11:58:33,583 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:58:33,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:58:33,583 INFO L85 PathProgramCache]: Analyzing trace with hash 729842326, now seen corresponding path program 5 times [2024-05-12 11:58:33,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:58:33,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612383928] [2024-05-12 11:58:33,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:58:33,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:58:33,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:58:41,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:58:41,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:58:41,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612383928] [2024-05-12 11:58:41,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612383928] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:58:41,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:58:41,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:58:41,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610969807] [2024-05-12 11:58:41,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:58:41,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:58:41,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:58:41,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:58:41,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:58:41,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2024-05-12 11:58:41,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 163 transitions, 1599 flow. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 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-05-12 11:58:41,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:58:41,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2024-05-12 11:58:41,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:58:43,036 INFO L124 PetriNetUnfolderBase]: 4486/7246 cut-off events. [2024-05-12 11:58:43,037 INFO L125 PetriNetUnfolderBase]: For 76392/76392 co-relation queries the response was YES. [2024-05-12 11:58:43,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33675 conditions, 7246 events. 4486/7246 cut-off events. For 76392/76392 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 46636 event pairs, 1814 based on Foata normal form. 4/7068 useless extension candidates. Maximal degree in co-relation 33616. Up to 6405 conditions per place. [2024-05-12 11:58:43,098 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 170 selfloop transitions, 26 changer transitions 0/205 dead transitions. [2024-05-12 11:58:43,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 205 transitions, 2143 flow [2024-05-12 11:58:43,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:58:43,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:58:43,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2024-05-12 11:58:43,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5197568389057751 [2024-05-12 11:58:43,099 INFO L175 Difference]: Start difference. First operand has 134 places, 163 transitions, 1599 flow. Second operand 7 states and 171 transitions. [2024-05-12 11:58:43,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 205 transitions, 2143 flow [2024-05-12 11:58:43,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 205 transitions, 2082 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-05-12 11:58:43,172 INFO L231 Difference]: Finished difference. Result has 137 places, 168 transitions, 1668 flow [2024-05-12 11:58:43,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1538, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1668, PETRI_PLACES=137, PETRI_TRANSITIONS=168} [2024-05-12 11:58:43,172 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 84 predicate places. [2024-05-12 11:58:43,173 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 168 transitions, 1668 flow [2024-05-12 11:58:43,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 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-05-12 11:58:43,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:58:43,173 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:58:43,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-05-12 11:58:43,173 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:58:43,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:58:43,173 INFO L85 PathProgramCache]: Analyzing trace with hash 627749564, now seen corresponding path program 2 times [2024-05-12 11:58:43,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:58:43,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861288748] [2024-05-12 11:58:43,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:58:43,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:58:43,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:58:52,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:58:52,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:58:52,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861288748] [2024-05-12 11:58:52,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861288748] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:58:52,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:58:52,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:58:52,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097555802] [2024-05-12 11:58:52,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:58:52,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:58:52,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:58:52,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:58:52,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:58:53,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 11:58:53,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 168 transitions, 1668 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 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-05-12 11:58:53,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:58:53,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 11:58:53,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:58:55,108 INFO L124 PetriNetUnfolderBase]: 5206/8228 cut-off events. [2024-05-12 11:58:55,108 INFO L125 PetriNetUnfolderBase]: For 86800/86800 co-relation queries the response was YES. [2024-05-12 11:58:55,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38503 conditions, 8228 events. 5206/8228 cut-off events. For 86800/86800 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 51513 event pairs, 1775 based on Foata normal form. 3/8058 useless extension candidates. Maximal degree in co-relation 38443. Up to 7486 conditions per place. [2024-05-12 11:58:55,167 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 166 selfloop transitions, 13 changer transitions 0/187 dead transitions. [2024-05-12 11:58:55,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 187 transitions, 2080 flow [2024-05-12 11:58:55,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:58:55,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:58:55,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2024-05-12 11:58:55,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4574468085106383 [2024-05-12 11:58:55,168 INFO L175 Difference]: Start difference. First operand has 137 places, 168 transitions, 1668 flow. Second operand 6 states and 129 transitions. [2024-05-12 11:58:55,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 187 transitions, 2080 flow [2024-05-12 11:58:55,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 187 transitions, 1982 flow, removed 27 selfloop flow, removed 4 redundant places. [2024-05-12 11:58:55,247 INFO L231 Difference]: Finished difference. Result has 139 places, 168 transitions, 1602 flow [2024-05-12 11:58:55,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1570, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1602, PETRI_PLACES=139, PETRI_TRANSITIONS=168} [2024-05-12 11:58:55,248 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 86 predicate places. [2024-05-12 11:58:55,248 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 168 transitions, 1602 flow [2024-05-12 11:58:55,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 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-05-12 11:58:55,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:58:55,248 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:58:55,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-05-12 11:58:55,249 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:58:55,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:58:55,249 INFO L85 PathProgramCache]: Analyzing trace with hash -2103937495, now seen corresponding path program 1 times [2024-05-12 11:58:55,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:58:55,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695572234] [2024-05-12 11:58:55,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:58:55,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:58:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:59:08,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:59:08,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:59:08,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695572234] [2024-05-12 11:59:08,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695572234] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:59:08,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:59:08,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:59:08,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381072931] [2024-05-12 11:59:08,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:59:08,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:59:08,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:59:08,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:59:08,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:59:08,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 11:59:08,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 168 transitions, 1602 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 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-05-12 11:59:08,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:59:08,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 11:59:08,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:59:11,169 INFO L124 PetriNetUnfolderBase]: 5257/8338 cut-off events. [2024-05-12 11:59:11,170 INFO L125 PetriNetUnfolderBase]: For 89713/89713 co-relation queries the response was YES. [2024-05-12 11:59:11,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38689 conditions, 8338 events. 5257/8338 cut-off events. For 89713/89713 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 52649 event pairs, 1746 based on Foata normal form. 3/8156 useless extension candidates. Maximal degree in co-relation 38627. Up to 7458 conditions per place. [2024-05-12 11:59:11,236 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 176 selfloop transitions, 25 changer transitions 0/209 dead transitions. [2024-05-12 11:59:11,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 209 transitions, 2216 flow [2024-05-12 11:59:11,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:59:11,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:59:11,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 159 transitions. [2024-05-12 11:59:11,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48328267477203646 [2024-05-12 11:59:11,238 INFO L175 Difference]: Start difference. First operand has 139 places, 168 transitions, 1602 flow. Second operand 7 states and 159 transitions. [2024-05-12 11:59:11,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 209 transitions, 2216 flow [2024-05-12 11:59:11,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 209 transitions, 2176 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-05-12 11:59:11,328 INFO L231 Difference]: Finished difference. Result has 141 places, 174 transitions, 1677 flow [2024-05-12 11:59:11,328 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1562, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1677, PETRI_PLACES=141, PETRI_TRANSITIONS=174} [2024-05-12 11:59:11,329 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 88 predicate places. [2024-05-12 11:59:11,329 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 174 transitions, 1677 flow [2024-05-12 11:59:11,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 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-05-12 11:59:11,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:59:11,329 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:59:11,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-05-12 11:59:11,329 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:59:11,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:59:11,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1985332347, now seen corresponding path program 2 times [2024-05-12 11:59:11,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:59:11,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970898880] [2024-05-12 11:59:11,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:59:11,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:59:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:59:24,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:59:24,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:59:24,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970898880] [2024-05-12 11:59:24,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970898880] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:59:24,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:59:24,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:59:24,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451020039] [2024-05-12 11:59:24,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:59:24,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:59:24,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:59:24,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:59:24,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:59:24,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 11:59:24,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 174 transitions, 1677 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 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-05-12 11:59:24,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:59:24,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 11:59:24,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:59:26,393 INFO L124 PetriNetUnfolderBase]: 5248/8302 cut-off events. [2024-05-12 11:59:26,394 INFO L125 PetriNetUnfolderBase]: For 95503/95506 co-relation queries the response was YES. [2024-05-12 11:59:26,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39497 conditions, 8302 events. 5248/8302 cut-off events. For 95503/95506 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 52082 event pairs, 1740 based on Foata normal form. 5/8129 useless extension candidates. Maximal degree in co-relation 39434. Up to 7451 conditions per place. [2024-05-12 11:59:26,561 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 167 selfloop transitions, 23 changer transitions 0/198 dead transitions. [2024-05-12 11:59:26,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 198 transitions, 2133 flow [2024-05-12 11:59:26,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:59:26,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:59:26,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 135 transitions. [2024-05-12 11:59:26,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4787234042553192 [2024-05-12 11:59:26,563 INFO L175 Difference]: Start difference. First operand has 141 places, 174 transitions, 1677 flow. Second operand 6 states and 135 transitions. [2024-05-12 11:59:26,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 198 transitions, 2133 flow [2024-05-12 11:59:26,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 198 transitions, 2083 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-05-12 11:59:26,657 INFO L231 Difference]: Finished difference. Result has 144 places, 174 transitions, 1680 flow [2024-05-12 11:59:26,657 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1627, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1680, PETRI_PLACES=144, PETRI_TRANSITIONS=174} [2024-05-12 11:59:26,657 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 91 predicate places. [2024-05-12 11:59:26,657 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 174 transitions, 1680 flow [2024-05-12 11:59:26,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 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-05-12 11:59:26,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:59:26,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:59:26,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-05-12 11:59:26,658 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:59:26,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:59:26,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1897206905, now seen corresponding path program 1 times [2024-05-12 11:59:26,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:59:26,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447869782] [2024-05-12 11:59:26,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:59:26,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:59:26,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:59:36,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:59:36,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:59:36,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447869782] [2024-05-12 11:59:36,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447869782] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:59:36,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:59:36,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:59:36,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299852705] [2024-05-12 11:59:36,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:59:36,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:59:36,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:59:36,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:59:36,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:59:36,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 11:59:36,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 174 transitions, 1680 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 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-05-12 11:59:36,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:59:36,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 11:59:36,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:59:38,761 INFO L124 PetriNetUnfolderBase]: 5545/8733 cut-off events. [2024-05-12 11:59:38,762 INFO L125 PetriNetUnfolderBase]: For 103384/103387 co-relation queries the response was YES. [2024-05-12 11:59:38,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41361 conditions, 8733 events. 5545/8733 cut-off events. For 103384/103387 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 55046 event pairs, 1569 based on Foata normal form. 8/8520 useless extension candidates. Maximal degree in co-relation 41296. Up to 7414 conditions per place. [2024-05-12 11:59:38,835 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 189 selfloop transitions, 41 changer transitions 0/238 dead transitions. [2024-05-12 11:59:38,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 238 transitions, 2572 flow [2024-05-12 11:59:38,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:59:38,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:59:38,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions. [2024-05-12 11:59:38,836 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5319148936170213 [2024-05-12 11:59:38,836 INFO L175 Difference]: Start difference. First operand has 144 places, 174 transitions, 1680 flow. Second operand 7 states and 175 transitions. [2024-05-12 11:59:38,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 238 transitions, 2572 flow [2024-05-12 11:59:38,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 238 transitions, 2494 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-05-12 11:59:38,951 INFO L231 Difference]: Finished difference. Result has 148 places, 194 transitions, 1959 flow [2024-05-12 11:59:38,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1614, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1959, PETRI_PLACES=148, PETRI_TRANSITIONS=194} [2024-05-12 11:59:38,952 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 95 predicate places. [2024-05-12 11:59:38,952 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 194 transitions, 1959 flow [2024-05-12 11:59:38,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 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-05-12 11:59:38,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:59:38,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:59:38,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-05-12 11:59:38,953 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:59:38,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:59:38,953 INFO L85 PathProgramCache]: Analyzing trace with hash -81188945, now seen corresponding path program 1 times [2024-05-12 11:59:38,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:59:38,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640780552] [2024-05-12 11:59:38,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:59:38,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:59:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:59:48,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:59:48,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:59:48,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640780552] [2024-05-12 11:59:48,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640780552] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:59:48,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:59:48,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:59:48,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419012151] [2024-05-12 11:59:48,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:59:48,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:59:48,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:59:48,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:59:48,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:59:48,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 11:59:48,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 194 transitions, 1959 flow. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 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-05-12 11:59:48,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:59:48,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 11:59:48,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:59:50,646 INFO L124 PetriNetUnfolderBase]: 5628/8816 cut-off events. [2024-05-12 11:59:50,646 INFO L125 PetriNetUnfolderBase]: For 116191/116194 co-relation queries the response was YES. [2024-05-12 11:59:50,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44800 conditions, 8816 events. 5628/8816 cut-off events. For 116191/116194 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 55109 event pairs, 1485 based on Foata normal form. 6/8606 useless extension candidates. Maximal degree in co-relation 44732. Up to 7651 conditions per place. [2024-05-12 11:59:50,721 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 199 selfloop transitions, 44 changer transitions 0/251 dead transitions. [2024-05-12 11:59:50,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 251 transitions, 2702 flow [2024-05-12 11:59:50,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:59:50,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:59:50,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 195 transitions. [2024-05-12 11:59:50,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5186170212765957 [2024-05-12 11:59:50,723 INFO L175 Difference]: Start difference. First operand has 148 places, 194 transitions, 1959 flow. Second operand 8 states and 195 transitions. [2024-05-12 11:59:50,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 251 transitions, 2702 flow [2024-05-12 11:59:50,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 251 transitions, 2642 flow, removed 29 selfloop flow, removed 1 redundant places. [2024-05-12 11:59:50,909 INFO L231 Difference]: Finished difference. Result has 156 places, 200 transitions, 2101 flow [2024-05-12 11:59:50,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1905, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2101, PETRI_PLACES=156, PETRI_TRANSITIONS=200} [2024-05-12 11:59:50,910 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 103 predicate places. [2024-05-12 11:59:50,910 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 200 transitions, 2101 flow [2024-05-12 11:59:50,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 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-05-12 11:59:50,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:59:50,911 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:59:50,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-05-12 11:59:50,911 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:59:50,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:59:50,911 INFO L85 PathProgramCache]: Analyzing trace with hash -425505233, now seen corresponding path program 2 times [2024-05-12 11:59:50,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:59:50,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55880761] [2024-05-12 11:59:50,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:59:50,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:59:50,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:59:59,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:59:59,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:59:59,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55880761] [2024-05-12 11:59:59,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55880761] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:59:59,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:59:59,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:59:59,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405922328] [2024-05-12 11:59:59,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:59:59,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:59:59,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:59:59,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:59:59,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:59:59,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 11:59:59,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 200 transitions, 2101 flow. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 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-05-12 11:59:59,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:59:59,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 11:59:59,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:00:02,050 INFO L124 PetriNetUnfolderBase]: 5665/8860 cut-off events. [2024-05-12 12:00:02,050 INFO L125 PetriNetUnfolderBase]: For 123867/123870 co-relation queries the response was YES. [2024-05-12 12:00:02,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45479 conditions, 8860 events. 5665/8860 cut-off events. For 123867/123870 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 55348 event pairs, 1504 based on Foata normal form. 6/8654 useless extension candidates. Maximal degree in co-relation 45407. Up to 7706 conditions per place. [2024-05-12 12:00:02,128 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 201 selfloop transitions, 41 changer transitions 0/250 dead transitions. [2024-05-12 12:00:02,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 250 transitions, 2785 flow [2024-05-12 12:00:02,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:00:02,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:00:02,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2024-05-12 12:00:02,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5079787234042553 [2024-05-12 12:00:02,130 INFO L175 Difference]: Start difference. First operand has 156 places, 200 transitions, 2101 flow. Second operand 8 states and 191 transitions. [2024-05-12 12:00:02,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 250 transitions, 2785 flow [2024-05-12 12:00:02,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 250 transitions, 2664 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-05-12 12:00:02,308 INFO L231 Difference]: Finished difference. Result has 159 places, 202 transitions, 2109 flow [2024-05-12 12:00:02,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1980, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2109, PETRI_PLACES=159, PETRI_TRANSITIONS=202} [2024-05-12 12:00:02,309 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 106 predicate places. [2024-05-12 12:00:02,309 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 202 transitions, 2109 flow [2024-05-12 12:00:02,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 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-05-12 12:00:02,310 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:00:02,310 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:00:02,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-05-12 12:00:02,310 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:00:02,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:00:02,311 INFO L85 PathProgramCache]: Analyzing trace with hash -75617315, now seen corresponding path program 3 times [2024-05-12 12:00:02,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:00:02,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424271851] [2024-05-12 12:00:02,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:00:02,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:00:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:00:10,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:00:10,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:00:10,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424271851] [2024-05-12 12:00:10,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424271851] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:00:10,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:00:10,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:00:10,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310356681] [2024-05-12 12:00:10,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:00:10,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:00:10,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:00:10,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:00:10,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:00:11,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2024-05-12 12:00:11,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 202 transitions, 2109 flow. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:00:11,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:00:11,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2024-05-12 12:00:11,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:00:13,102 INFO L124 PetriNetUnfolderBase]: 4898/8243 cut-off events. [2024-05-12 12:00:13,102 INFO L125 PetriNetUnfolderBase]: For 126960/126963 co-relation queries the response was YES. [2024-05-12 12:00:13,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41475 conditions, 8243 events. 4898/8243 cut-off events. For 126960/126963 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 55668 event pairs, 1808 based on Foata normal form. 6/7961 useless extension candidates. Maximal degree in co-relation 41402. Up to 6521 conditions per place. [2024-05-12 12:00:13,195 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 190 selfloop transitions, 48 changer transitions 0/247 dead transitions. [2024-05-12 12:00:13,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 247 transitions, 2777 flow [2024-05-12 12:00:13,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:00:13,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:00:13,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 193 transitions. [2024-05-12 12:00:13,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5132978723404256 [2024-05-12 12:00:13,196 INFO L175 Difference]: Start difference. First operand has 159 places, 202 transitions, 2109 flow. Second operand 8 states and 193 transitions. [2024-05-12 12:00:13,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 247 transitions, 2777 flow [2024-05-12 12:00:13,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 247 transitions, 2664 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-05-12 12:00:13,367 INFO L231 Difference]: Finished difference. Result has 162 places, 204 transitions, 2144 flow [2024-05-12 12:00:13,367 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1996, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2144, PETRI_PLACES=162, PETRI_TRANSITIONS=204} [2024-05-12 12:00:13,368 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 109 predicate places. [2024-05-12 12:00:13,368 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 204 transitions, 2144 flow [2024-05-12 12:00:13,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:00:13,368 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:00:13,369 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:00:13,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-05-12 12:00:13,369 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:00:13,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:00:13,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1897505435, now seen corresponding path program 2 times [2024-05-12 12:00:13,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:00:13,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21828856] [2024-05-12 12:00:13,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:00:13,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:00:13,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:00:24,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:00:24,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:00:24,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21828856] [2024-05-12 12:00:24,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21828856] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:00:24,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:00:24,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:00:24,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690250490] [2024-05-12 12:00:24,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:00:24,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:00:24,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:00:24,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:00:24,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:00:25,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 12:00:25,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 204 transitions, 2144 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 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-05-12 12:00:25,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:00:25,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 12:00:25,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:00:27,904 INFO L124 PetriNetUnfolderBase]: 6539/10137 cut-off events. [2024-05-12 12:00:27,904 INFO L125 PetriNetUnfolderBase]: For 161879/161882 co-relation queries the response was YES. [2024-05-12 12:00:27,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53177 conditions, 10137 events. 6539/10137 cut-off events. For 161879/161882 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 63831 event pairs, 1751 based on Foata normal form. 14/9916 useless extension candidates. Maximal degree in co-relation 53104. Up to 7989 conditions per place. [2024-05-12 12:00:28,001 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 195 selfloop transitions, 69 changer transitions 0/272 dead transitions. [2024-05-12 12:00:28,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 272 transitions, 3263 flow [2024-05-12 12:00:28,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:00:28,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:00:28,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 196 transitions. [2024-05-12 12:00:28,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5212765957446809 [2024-05-12 12:00:28,003 INFO L175 Difference]: Start difference. First operand has 162 places, 204 transitions, 2144 flow. Second operand 8 states and 196 transitions. [2024-05-12 12:00:28,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 272 transitions, 3263 flow [2024-05-12 12:00:28,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 272 transitions, 3135 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-05-12 12:00:28,369 INFO L231 Difference]: Finished difference. Result has 166 places, 226 transitions, 2463 flow [2024-05-12 12:00:28,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2016, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2463, PETRI_PLACES=166, PETRI_TRANSITIONS=226} [2024-05-12 12:00:28,370 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 113 predicate places. [2024-05-12 12:00:28,371 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 226 transitions, 2463 flow [2024-05-12 12:00:28,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 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-05-12 12:00:28,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:00:28,371 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:00:28,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-05-12 12:00:28,371 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:00:28,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:00:28,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1305836147, now seen corresponding path program 4 times [2024-05-12 12:00:28,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:00:28,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440321760] [2024-05-12 12:00:28,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:00:28,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:00:28,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:00:37,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:00:37,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:00:37,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440321760] [2024-05-12 12:00:37,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440321760] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:00:37,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:00:37,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:00:37,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220276613] [2024-05-12 12:00:37,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:00:37,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:00:37,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:00:37,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:00:37,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:00:37,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 12:00:37,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 226 transitions, 2463 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 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-05-12 12:00:37,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:00:37,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 12:00:37,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:00:40,208 INFO L124 PetriNetUnfolderBase]: 6576/10219 cut-off events. [2024-05-12 12:00:40,208 INFO L125 PetriNetUnfolderBase]: For 177483/177486 co-relation queries the response was YES. [2024-05-12 12:00:40,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57094 conditions, 10219 events. 6576/10219 cut-off events. For 177483/177486 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 64713 event pairs, 1711 based on Foata normal form. 6/9978 useless extension candidates. Maximal degree in co-relation 57018. Up to 8881 conditions per place. [2024-05-12 12:00:40,306 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 215 selfloop transitions, 47 changer transitions 0/270 dead transitions. [2024-05-12 12:00:40,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 270 transitions, 3181 flow [2024-05-12 12:00:40,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:00:40,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:00:40,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 172 transitions. [2024-05-12 12:00:40,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5227963525835866 [2024-05-12 12:00:40,308 INFO L175 Difference]: Start difference. First operand has 166 places, 226 transitions, 2463 flow. Second operand 7 states and 172 transitions. [2024-05-12 12:00:40,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 270 transitions, 3181 flow [2024-05-12 12:00:40,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 270 transitions, 3078 flow, removed 45 selfloop flow, removed 2 redundant places. [2024-05-12 12:00:40,614 INFO L231 Difference]: Finished difference. Result has 171 places, 228 transitions, 2517 flow [2024-05-12 12:00:40,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2360, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2517, PETRI_PLACES=171, PETRI_TRANSITIONS=228} [2024-05-12 12:00:40,615 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 118 predicate places. [2024-05-12 12:00:40,615 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 228 transitions, 2517 flow [2024-05-12 12:00:40,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 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-05-12 12:00:40,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:00:40,615 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:00:40,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-05-12 12:00:40,616 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:00:40,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:00:40,616 INFO L85 PathProgramCache]: Analyzing trace with hash 855980001, now seen corresponding path program 5 times [2024-05-12 12:00:40,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:00:40,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227347213] [2024-05-12 12:00:40,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:00:40,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:00:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:00:49,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:00:49,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:00:49,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227347213] [2024-05-12 12:00:49,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227347213] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:00:49,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:00:49,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:00:49,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476491286] [2024-05-12 12:00:49,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:00:49,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:00:49,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:00:49,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:00:49,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:00:49,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 12:00:49,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 228 transitions, 2517 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 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-05-12 12:00:49,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:00:49,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 12:00:49,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:00:52,769 INFO L124 PetriNetUnfolderBase]: 6613/10338 cut-off events. [2024-05-12 12:00:52,769 INFO L125 PetriNetUnfolderBase]: For 188779/188782 co-relation queries the response was YES. [2024-05-12 12:00:52,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57706 conditions, 10338 events. 6613/10338 cut-off events. For 188779/188782 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 65899 event pairs, 1699 based on Foata normal form. 6/10080 useless extension candidates. Maximal degree in co-relation 57628. Up to 8696 conditions per place. [2024-05-12 12:00:52,886 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 210 selfloop transitions, 51 changer transitions 0/269 dead transitions. [2024-05-12 12:00:52,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 269 transitions, 3225 flow [2024-05-12 12:00:52,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:00:52,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:00:52,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 167 transitions. [2024-05-12 12:00:52,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5075987841945289 [2024-05-12 12:00:52,888 INFO L175 Difference]: Start difference. First operand has 171 places, 228 transitions, 2517 flow. Second operand 7 states and 167 transitions. [2024-05-12 12:00:52,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 269 transitions, 3225 flow [2024-05-12 12:00:53,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 269 transitions, 3106 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-05-12 12:00:53,276 INFO L231 Difference]: Finished difference. Result has 173 places, 230 transitions, 2565 flow [2024-05-12 12:00:53,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2398, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2565, PETRI_PLACES=173, PETRI_TRANSITIONS=230} [2024-05-12 12:00:53,277 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 120 predicate places. [2024-05-12 12:00:53,277 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 230 transitions, 2565 flow [2024-05-12 12:00:53,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 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-05-12 12:00:53,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:00:53,278 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:00:53,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-05-12 12:00:53,278 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:00:53,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:00:53,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1140178701, now seen corresponding path program 6 times [2024-05-12 12:00:53,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:00:53,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342632129] [2024-05-12 12:00:53,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:00:53,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:00:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:01:02,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:01:02,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:01:02,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342632129] [2024-05-12 12:01:02,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342632129] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:01:02,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:01:02,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:01:02,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586735044] [2024-05-12 12:01:02,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:01:02,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:01:02,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:01:02,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:01:02,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:01:02,299 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 12:01:02,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 230 transitions, 2565 flow. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 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-05-12 12:01:02,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:01:02,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 12:01:02,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:01:05,257 INFO L124 PetriNetUnfolderBase]: 6655/10336 cut-off events. [2024-05-12 12:01:05,258 INFO L125 PetriNetUnfolderBase]: For 198619/198622 co-relation queries the response was YES. [2024-05-12 12:01:05,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58612 conditions, 10336 events. 6655/10336 cut-off events. For 198619/198622 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 65428 event pairs, 1722 based on Foata normal form. 4/10092 useless extension candidates. Maximal degree in co-relation 58533. Up to 8919 conditions per place. [2024-05-12 12:01:05,351 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 211 selfloop transitions, 58 changer transitions 0/277 dead transitions. [2024-05-12 12:01:05,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 277 transitions, 3336 flow [2024-05-12 12:01:05,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:01:05,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:01:05,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 173 transitions. [2024-05-12 12:01:05,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5258358662613982 [2024-05-12 12:01:05,353 INFO L175 Difference]: Start difference. First operand has 173 places, 230 transitions, 2565 flow. Second operand 7 states and 173 transitions. [2024-05-12 12:01:05,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 277 transitions, 3336 flow [2024-05-12 12:01:05,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 277 transitions, 3199 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-05-12 12:01:05,610 INFO L231 Difference]: Finished difference. Result has 176 places, 235 transitions, 2677 flow [2024-05-12 12:01:05,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2428, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2677, PETRI_PLACES=176, PETRI_TRANSITIONS=235} [2024-05-12 12:01:05,610 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 123 predicate places. [2024-05-12 12:01:05,610 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 235 transitions, 2677 flow [2024-05-12 12:01:05,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 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-05-12 12:01:05,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:01:05,611 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:01:05,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-05-12 12:01:05,611 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:01:05,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:01:05,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1140186141, now seen corresponding path program 7 times [2024-05-12 12:01:05,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:01:05,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825839448] [2024-05-12 12:01:05,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:01:05,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:01:05,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:01:14,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:01:14,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:01:14,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825839448] [2024-05-12 12:01:14,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825839448] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:01:14,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:01:14,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:01:14,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988489357] [2024-05-12 12:01:14,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:01:14,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:01:14,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:01:14,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:01:14,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:01:14,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 12:01:14,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 235 transitions, 2677 flow. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 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-05-12 12:01:14,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:01:14,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 12:01:14,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:01:17,990 INFO L124 PetriNetUnfolderBase]: 6692/10447 cut-off events. [2024-05-12 12:01:17,990 INFO L125 PetriNetUnfolderBase]: For 211823/211826 co-relation queries the response was YES. [2024-05-12 12:01:18,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59769 conditions, 10447 events. 6692/10447 cut-off events. For 211823/211826 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 66529 event pairs, 1709 based on Foata normal form. 4/10189 useless extension candidates. Maximal degree in co-relation 59688. Up to 8657 conditions per place. [2024-05-12 12:01:18,104 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 203 selfloop transitions, 65 changer transitions 0/276 dead transitions. [2024-05-12 12:01:18,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 276 transitions, 3407 flow [2024-05-12 12:01:18,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:01:18,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:01:18,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions. [2024-05-12 12:01:18,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5106382978723404 [2024-05-12 12:01:18,112 INFO L175 Difference]: Start difference. First operand has 176 places, 235 transitions, 2677 flow. Second operand 7 states and 168 transitions. [2024-05-12 12:01:18,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 276 transitions, 3407 flow [2024-05-12 12:01:18,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 276 transitions, 3275 flow, removed 25 selfloop flow, removed 4 redundant places. [2024-05-12 12:01:18,404 INFO L231 Difference]: Finished difference. Result has 179 places, 237 transitions, 2751 flow [2024-05-12 12:01:18,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2549, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2751, PETRI_PLACES=179, PETRI_TRANSITIONS=237} [2024-05-12 12:01:18,405 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 126 predicate places. [2024-05-12 12:01:18,405 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 237 transitions, 2751 flow [2024-05-12 12:01:18,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 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-05-12 12:01:18,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:01:18,405 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:01:18,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-05-12 12:01:18,405 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:01:18,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:01:18,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1150276641, now seen corresponding path program 8 times [2024-05-12 12:01:18,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:01:18,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532301059] [2024-05-12 12:01:18,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:01:18,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:01:18,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:01:27,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:01:27,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:01:27,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532301059] [2024-05-12 12:01:27,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532301059] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:01:27,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:01:27,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:01:27,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433903717] [2024-05-12 12:01:27,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:01:27,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:01:27,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:01:27,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:01:27,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:01:27,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 12:01:27,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 237 transitions, 2751 flow. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 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-05-12 12:01:27,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:01:27,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 12:01:27,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:01:30,373 INFO L124 PetriNetUnfolderBase]: 6700/10495 cut-off events. [2024-05-12 12:01:30,373 INFO L125 PetriNetUnfolderBase]: For 209792/209795 co-relation queries the response was YES. [2024-05-12 12:01:30,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59813 conditions, 10495 events. 6700/10495 cut-off events. For 209792/209795 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 67478 event pairs, 2172 based on Foata normal form. 4/10270 useless extension candidates. Maximal degree in co-relation 59731. Up to 9437 conditions per place. [2024-05-12 12:01:30,496 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 247 selfloop transitions, 22 changer transitions 0/277 dead transitions. [2024-05-12 12:01:30,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 277 transitions, 3475 flow [2024-05-12 12:01:30,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:01:30,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:01:30,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 159 transitions. [2024-05-12 12:01:30,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48328267477203646 [2024-05-12 12:01:30,498 INFO L175 Difference]: Start difference. First operand has 179 places, 237 transitions, 2751 flow. Second operand 7 states and 159 transitions. [2024-05-12 12:01:30,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 277 transitions, 3475 flow [2024-05-12 12:01:30,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 277 transitions, 3301 flow, removed 27 selfloop flow, removed 5 redundant places. [2024-05-12 12:01:30,803 INFO L231 Difference]: Finished difference. Result has 183 places, 243 transitions, 2727 flow [2024-05-12 12:01:30,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2581, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2727, PETRI_PLACES=183, PETRI_TRANSITIONS=243} [2024-05-12 12:01:30,804 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 130 predicate places. [2024-05-12 12:01:30,804 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 243 transitions, 2727 flow [2024-05-12 12:01:30,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 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-05-12 12:01:30,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:01:30,805 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:01:30,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-05-12 12:01:30,805 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:01:30,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:01:30,805 INFO L85 PathProgramCache]: Analyzing trace with hash -2014599461, now seen corresponding path program 3 times [2024-05-12 12:01:30,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:01:30,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242874450] [2024-05-12 12:01:30,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:01:30,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:01:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:01:40,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:01:40,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:01:40,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242874450] [2024-05-12 12:01:40,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242874450] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:01:40,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:01:40,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:01:40,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477630024] [2024-05-12 12:01:40,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:01:40,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:01:40,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:01:40,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:01:40,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:01:40,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 12:01:40,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 243 transitions, 2727 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 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-05-12 12:01:40,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:01:40,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 12:01:40,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:01:43,872 INFO L124 PetriNetUnfolderBase]: 6688/10476 cut-off events. [2024-05-12 12:01:43,873 INFO L125 PetriNetUnfolderBase]: For 203199/203202 co-relation queries the response was YES. [2024-05-12 12:01:43,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58784 conditions, 10476 events. 6688/10476 cut-off events. For 203199/203202 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 67391 event pairs, 2174 based on Foata normal form. 8/10256 useless extension candidates. Maximal degree in co-relation 58699. Up to 9301 conditions per place. [2024-05-12 12:01:43,998 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 234 selfloop transitions, 28 changer transitions 0/270 dead transitions. [2024-05-12 12:01:43,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 270 transitions, 3417 flow [2024-05-12 12:01:43,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:01:43,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:01:44,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 156 transitions. [2024-05-12 12:01:44,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47416413373860183 [2024-05-12 12:01:44,000 INFO L175 Difference]: Start difference. First operand has 183 places, 243 transitions, 2727 flow. Second operand 7 states and 156 transitions. [2024-05-12 12:01:44,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 270 transitions, 3417 flow [2024-05-12 12:01:44,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 270 transitions, 3317 flow, removed 33 selfloop flow, removed 3 redundant places. [2024-05-12 12:01:44,341 INFO L231 Difference]: Finished difference. Result has 187 places, 243 transitions, 2691 flow [2024-05-12 12:01:44,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2627, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2691, PETRI_PLACES=187, PETRI_TRANSITIONS=243} [2024-05-12 12:01:44,342 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 134 predicate places. [2024-05-12 12:01:44,342 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 243 transitions, 2691 flow [2024-05-12 12:01:44,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 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-05-12 12:01:44,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:01:44,343 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:01:44,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-05-12 12:01:44,343 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:01:44,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:01:44,343 INFO L85 PathProgramCache]: Analyzing trace with hash -2014586999, now seen corresponding path program 1 times [2024-05-12 12:01:44,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:01:44,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071908993] [2024-05-12 12:01:44,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:01:44,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:01:44,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:01:55,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:01:55,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:01:55,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071908993] [2024-05-12 12:01:55,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071908993] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:01:55,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:01:55,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:01:55,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767592325] [2024-05-12 12:01:55,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:01:55,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:01:55,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:01:55,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:01:55,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:01:56,076 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 12:01:56,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 243 transitions, 2691 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 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-05-12 12:01:56,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:01:56,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 12:01:56,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:01:59,022 INFO L124 PetriNetUnfolderBase]: 6692/10459 cut-off events. [2024-05-12 12:01:59,022 INFO L125 PetriNetUnfolderBase]: For 205376/205376 co-relation queries the response was YES. [2024-05-12 12:01:59,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58715 conditions, 10459 events. 6692/10459 cut-off events. For 205376/205376 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 66997 event pairs, 2183 based on Foata normal form. 2/10240 useless extension candidates. Maximal degree in co-relation 58629. Up to 9530 conditions per place. [2024-05-12 12:01:59,114 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 247 selfloop transitions, 17 changer transitions 0/272 dead transitions. [2024-05-12 12:01:59,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 272 transitions, 3369 flow [2024-05-12 12:01:59,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:01:59,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:01:59,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions. [2024-05-12 12:01:59,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44680851063829785 [2024-05-12 12:01:59,120 INFO L175 Difference]: Start difference. First operand has 187 places, 243 transitions, 2691 flow. Second operand 7 states and 147 transitions. [2024-05-12 12:01:59,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 272 transitions, 3369 flow [2024-05-12 12:01:59,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 272 transitions, 3283 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-05-12 12:01:59,441 INFO L231 Difference]: Finished difference. Result has 189 places, 250 transitions, 2752 flow [2024-05-12 12:01:59,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2605, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2752, PETRI_PLACES=189, PETRI_TRANSITIONS=250} [2024-05-12 12:01:59,443 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 136 predicate places. [2024-05-12 12:01:59,443 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 250 transitions, 2752 flow [2024-05-12 12:01:59,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 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-05-12 12:01:59,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:01:59,443 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:01:59,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-05-12 12:01:59,444 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:01:59,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:01:59,444 INFO L85 PathProgramCache]: Analyzing trace with hash 2103330834, now seen corresponding path program 1 times [2024-05-12 12:01:59,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:01:59,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976625012] [2024-05-12 12:01:59,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:01:59,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:01:59,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:02:12,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:02:12,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:02:12,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976625012] [2024-05-12 12:02:12,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976625012] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:02:12,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:02:12,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:02:12,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191192067] [2024-05-12 12:02:12,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:02:12,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:02:12,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:02:12,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:02:12,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:02:12,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 12:02:12,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 250 transitions, 2752 flow. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 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-05-12 12:02:12,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:02:12,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 12:02:12,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:02:16,410 INFO L124 PetriNetUnfolderBase]: 6779/10655 cut-off events. [2024-05-12 12:02:16,410 INFO L125 PetriNetUnfolderBase]: For 219966/219966 co-relation queries the response was YES. [2024-05-12 12:02:16,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60172 conditions, 10655 events. 6779/10655 cut-off events. For 219966/219966 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 68999 event pairs, 2205 based on Foata normal form. 6/10419 useless extension candidates. Maximal degree in co-relation 60087. Up to 9556 conditions per place. [2024-05-12 12:02:16,525 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 252 selfloop transitions, 26 changer transitions 0/286 dead transitions. [2024-05-12 12:02:16,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 286 transitions, 3454 flow [2024-05-12 12:02:16,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:02:16,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:02:16,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 158 transitions. [2024-05-12 12:02:16,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48024316109422494 [2024-05-12 12:02:16,527 INFO L175 Difference]: Start difference. First operand has 189 places, 250 transitions, 2752 flow. Second operand 7 states and 158 transitions. [2024-05-12 12:02:16,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 286 transitions, 3454 flow [2024-05-12 12:02:16,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 286 transitions, 3361 flow, removed 34 selfloop flow, removed 4 redundant places. [2024-05-12 12:02:16,848 INFO L231 Difference]: Finished difference. Result has 192 places, 253 transitions, 2768 flow [2024-05-12 12:02:16,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2659, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2768, PETRI_PLACES=192, PETRI_TRANSITIONS=253} [2024-05-12 12:02:16,849 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 139 predicate places. [2024-05-12 12:02:16,849 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 253 transitions, 2768 flow [2024-05-12 12:02:16,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 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-05-12 12:02:16,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:02:16,850 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:02:16,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-05-12 12:02:16,850 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:02:16,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:02:16,850 INFO L85 PathProgramCache]: Analyzing trace with hash -797552184, now seen corresponding path program 2 times [2024-05-12 12:02:16,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:02:16,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871586001] [2024-05-12 12:02:16,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:02:16,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:02:16,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:02:33,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:02:33,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:02:33,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871586001] [2024-05-12 12:02:33,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871586001] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:02:33,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:02:33,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:02:33,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21505155] [2024-05-12 12:02:33,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:02:33,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:02:33,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:02:33,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:02:33,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:02:33,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 12:02:33,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 253 transitions, 2768 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 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-05-12 12:02:33,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:02:33,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 12:02:33,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:02:36,938 INFO L124 PetriNetUnfolderBase]: 6881/10871 cut-off events. [2024-05-12 12:02:36,939 INFO L125 PetriNetUnfolderBase]: For 232296/232296 co-relation queries the response was YES. [2024-05-12 12:02:37,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61869 conditions, 10871 events. 6881/10871 cut-off events. For 232296/232296 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 71249 event pairs, 2198 based on Foata normal form. 6/10615 useless extension candidates. Maximal degree in co-relation 61783. Up to 9390 conditions per place. [2024-05-12 12:02:37,046 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 256 selfloop transitions, 46 changer transitions 0/310 dead transitions. [2024-05-12 12:02:37,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 310 transitions, 3754 flow [2024-05-12 12:02:37,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:02:37,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:02:37,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 205 transitions. [2024-05-12 12:02:37,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4846335697399527 [2024-05-12 12:02:37,064 INFO L175 Difference]: Start difference. First operand has 192 places, 253 transitions, 2768 flow. Second operand 9 states and 205 transitions. [2024-05-12 12:02:37,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 310 transitions, 3754 flow [2024-05-12 12:02:37,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 310 transitions, 3675 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-05-12 12:02:37,430 INFO L231 Difference]: Finished difference. Result has 196 places, 259 transitions, 2890 flow [2024-05-12 12:02:37,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2689, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2890, PETRI_PLACES=196, PETRI_TRANSITIONS=259} [2024-05-12 12:02:37,431 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 143 predicate places. [2024-05-12 12:02:37,431 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 259 transitions, 2890 flow [2024-05-12 12:02:37,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 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-05-12 12:02:37,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:02:37,431 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:02:37,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-05-12 12:02:37,431 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:02:37,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:02:37,432 INFO L85 PathProgramCache]: Analyzing trace with hash -2014384972, now seen corresponding path program 3 times [2024-05-12 12:02:37,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:02:37,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948210519] [2024-05-12 12:02:37,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:02:37,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:02:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:02:51,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:02:51,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:02:51,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948210519] [2024-05-12 12:02:51,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948210519] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:02:51,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:02:51,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:02:51,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612634591] [2024-05-12 12:02:51,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:02:51,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:02:51,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:02:51,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:02:51,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:02:51,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 12:02:51,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 259 transitions, 2890 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 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-05-12 12:02:51,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:02:51,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 12:02:51,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:02:54,565 INFO L124 PetriNetUnfolderBase]: 6863/10804 cut-off events. [2024-05-12 12:02:54,565 INFO L125 PetriNetUnfolderBase]: For 239356/239359 co-relation queries the response was YES. [2024-05-12 12:02:54,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62260 conditions, 10804 events. 6863/10804 cut-off events. For 239356/239359 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 70252 event pairs, 2169 based on Foata normal form. 6/10561 useless extension candidates. Maximal degree in co-relation 62173. Up to 9379 conditions per place. [2024-05-12 12:02:54,673 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 243 selfloop transitions, 44 changer transitions 0/295 dead transitions. [2024-05-12 12:02:54,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 295 transitions, 3634 flow [2024-05-12 12:02:54,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:02:54,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:02:54,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 161 transitions. [2024-05-12 12:02:54,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48936170212765956 [2024-05-12 12:02:54,676 INFO L175 Difference]: Start difference. First operand has 196 places, 259 transitions, 2890 flow. Second operand 7 states and 161 transitions. [2024-05-12 12:02:54,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 295 transitions, 3634 flow [2024-05-12 12:02:55,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 295 transitions, 3502 flow, removed 34 selfloop flow, removed 6 redundant places. [2024-05-12 12:02:55,062 INFO L231 Difference]: Finished difference. Result has 197 places, 259 transitions, 2853 flow [2024-05-12 12:02:55,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2758, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2853, PETRI_PLACES=197, PETRI_TRANSITIONS=259} [2024-05-12 12:02:55,062 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 144 predicate places. [2024-05-12 12:02:55,063 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 259 transitions, 2853 flow [2024-05-12 12:02:55,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 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-05-12 12:02:55,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:02:55,063 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:02:55,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-05-12 12:02:55,063 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:02:55,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:02:55,064 INFO L85 PathProgramCache]: Analyzing trace with hash -2014138708, now seen corresponding path program 1 times [2024-05-12 12:02:55,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:02:55,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191037059] [2024-05-12 12:02:55,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:02:55,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:02:55,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:03:07,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:03:07,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:03:07,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191037059] [2024-05-12 12:03:07,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191037059] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:03:07,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:03:07,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:03:07,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103065877] [2024-05-12 12:03:07,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:03:07,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:03:07,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:03:07,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:03:07,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:03:07,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 12:03:07,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 259 transitions, 2853 flow. Second operand has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:03:07,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:03:07,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 12:03:07,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:03:10,334 INFO L124 PetriNetUnfolderBase]: 6858/10744 cut-off events. [2024-05-12 12:03:10,335 INFO L125 PetriNetUnfolderBase]: For 238726/238726 co-relation queries the response was YES. [2024-05-12 12:03:10,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61773 conditions, 10744 events. 6858/10744 cut-off events. For 238726/238726 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 69123 event pairs, 2207 based on Foata normal form. 2/10509 useless extension candidates. Maximal degree in co-relation 61685. Up to 9743 conditions per place. [2024-05-12 12:03:10,438 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 259 selfloop transitions, 22 changer transitions 0/289 dead transitions. [2024-05-12 12:03:10,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 289 transitions, 3556 flow [2024-05-12 12:03:10,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:03:10,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:03:10,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions. [2024-05-12 12:03:10,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45288753799392095 [2024-05-12 12:03:10,440 INFO L175 Difference]: Start difference. First operand has 197 places, 259 transitions, 2853 flow. Second operand 7 states and 149 transitions. [2024-05-12 12:03:10,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 289 transitions, 3556 flow [2024-05-12 12:03:10,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 289 transitions, 3449 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-05-12 12:03:10,822 INFO L231 Difference]: Finished difference. Result has 199 places, 264 transitions, 2881 flow [2024-05-12 12:03:10,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2751, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2881, PETRI_PLACES=199, PETRI_TRANSITIONS=264} [2024-05-12 12:03:10,823 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 146 predicate places. [2024-05-12 12:03:10,823 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 264 transitions, 2881 flow [2024-05-12 12:03:10,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:03:10,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:03:10,824 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:03:10,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-05-12 12:03:10,824 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:03:10,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:03:10,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1316136823, now seen corresponding path program 1 times [2024-05-12 12:03:10,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:03:10,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353054652] [2024-05-12 12:03:10,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:03:10,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:03:10,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:03:22,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:03:22,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:03:22,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353054652] [2024-05-12 12:03:22,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353054652] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:03:22,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:03:22,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:03:22,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958783773] [2024-05-12 12:03:22,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:03:22,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:03:22,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:03:22,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:03:22,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:03:22,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 12:03:22,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 264 transitions, 2881 flow. Second operand has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:03:22,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:03:22,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 12:03:22,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:03:25,799 INFO L124 PetriNetUnfolderBase]: 7097/10451 cut-off events. [2024-05-12 12:03:25,799 INFO L125 PetriNetUnfolderBase]: For 254194/254197 co-relation queries the response was YES. [2024-05-12 12:03:25,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63871 conditions, 10451 events. 7097/10451 cut-off events. For 254194/254197 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 61705 event pairs, 1454 based on Foata normal form. 4/10375 useless extension candidates. Maximal degree in co-relation 63781. Up to 9048 conditions per place. [2024-05-12 12:03:25,907 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 271 selfloop transitions, 116 changer transitions 0/395 dead transitions. [2024-05-12 12:03:25,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 395 transitions, 4924 flow [2024-05-12 12:03:25,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:03:25,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:03:25,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 229 transitions. [2024-05-12 12:03:25,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.541371158392435 [2024-05-12 12:03:25,909 INFO L175 Difference]: Start difference. First operand has 199 places, 264 transitions, 2881 flow. Second operand 9 states and 229 transitions. [2024-05-12 12:03:25,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 395 transitions, 4924 flow [2024-05-12 12:03:26,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 395 transitions, 4850 flow, removed 19 selfloop flow, removed 4 redundant places. [2024-05-12 12:03:26,291 INFO L231 Difference]: Finished difference. Result has 208 places, 328 transitions, 4033 flow [2024-05-12 12:03:26,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2807, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4033, PETRI_PLACES=208, PETRI_TRANSITIONS=328} [2024-05-12 12:03:26,292 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 155 predicate places. [2024-05-12 12:03:26,292 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 328 transitions, 4033 flow [2024-05-12 12:03:26,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:03:26,292 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:03:26,292 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:03:26,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-05-12 12:03:26,293 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:03:26,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:03:26,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1719111161, now seen corresponding path program 1 times [2024-05-12 12:03:26,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:03:26,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350828684] [2024-05-12 12:03:26,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:03:26,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:03:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:03:37,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:03:37,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:03:37,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350828684] [2024-05-12 12:03:37,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350828684] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:03:37,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:03:37,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:03:37,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831003736] [2024-05-12 12:03:37,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:03:37,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:03:37,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:03:37,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:03:37,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:03:37,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 12:03:37,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 328 transitions, 4033 flow. Second operand has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:03:37,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:03:37,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 12:03:37,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:03:41,120 INFO L124 PetriNetUnfolderBase]: 7190/11214 cut-off events. [2024-05-12 12:03:41,120 INFO L125 PetriNetUnfolderBase]: For 288608/288611 co-relation queries the response was YES. [2024-05-12 12:03:41,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69845 conditions, 11214 events. 7190/11214 cut-off events. For 288608/288611 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 72499 event pairs, 1682 based on Foata normal form. 14/10954 useless extension candidates. Maximal degree in co-relation 69750. Up to 9659 conditions per place. [2024-05-12 12:03:41,226 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 336 selfloop transitions, 43 changer transitions 0/387 dead transitions. [2024-05-12 12:03:41,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 387 transitions, 5057 flow [2024-05-12 12:03:41,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:03:41,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:03:41,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 215 transitions. [2024-05-12 12:03:41,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.508274231678487 [2024-05-12 12:03:41,227 INFO L175 Difference]: Start difference. First operand has 208 places, 328 transitions, 4033 flow. Second operand 9 states and 215 transitions. [2024-05-12 12:03:41,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 387 transitions, 5057 flow [2024-05-12 12:03:41,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 387 transitions, 4948 flow, removed 45 selfloop flow, removed 2 redundant places. [2024-05-12 12:03:41,702 INFO L231 Difference]: Finished difference. Result has 215 places, 329 transitions, 4054 flow [2024-05-12 12:03:41,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3924, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4054, PETRI_PLACES=215, PETRI_TRANSITIONS=329} [2024-05-12 12:03:41,702 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 162 predicate places. [2024-05-12 12:03:41,703 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 329 transitions, 4054 flow [2024-05-12 12:03:41,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:03:41,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:03:41,703 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:03:41,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-05-12 12:03:41,703 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:03:41,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:03:41,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1316127523, now seen corresponding path program 2 times [2024-05-12 12:03:41,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:03:41,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832926390] [2024-05-12 12:03:41,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:03:41,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:03:41,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:03:53,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:03:53,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:03:53,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832926390] [2024-05-12 12:03:53,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832926390] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:03:53,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:03:53,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:03:53,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262277599] [2024-05-12 12:03:53,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:03:53,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:03:53,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:03:53,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:03:53,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:03:53,520 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 12:03:53,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 329 transitions, 4054 flow. Second operand has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:03:53,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:03:53,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 12:03:53,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:03:57,058 INFO L124 PetriNetUnfolderBase]: 7297/10756 cut-off events. [2024-05-12 12:03:57,059 INFO L125 PetriNetUnfolderBase]: For 292496/292499 co-relation queries the response was YES. [2024-05-12 12:03:57,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70073 conditions, 10756 events. 7297/10756 cut-off events. For 292496/292499 co-relation queries the response was YES. Maximal size of possible extension queue 493. Compared 63838 event pairs, 1480 based on Foata normal form. 4/10676 useless extension candidates. Maximal degree in co-relation 69976. Up to 9561 conditions per place. [2024-05-12 12:03:57,168 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 279 selfloop transitions, 113 changer transitions 0/400 dead transitions. [2024-05-12 12:03:57,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 400 transitions, 5509 flow [2024-05-12 12:03:57,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:03:57,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:03:57,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 222 transitions. [2024-05-12 12:03:57,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.524822695035461 [2024-05-12 12:03:57,170 INFO L175 Difference]: Start difference. First operand has 215 places, 329 transitions, 4054 flow. Second operand 9 states and 222 transitions. [2024-05-12 12:03:57,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 400 transitions, 5509 flow [2024-05-12 12:03:57,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 400 transitions, 5395 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-05-12 12:03:57,816 INFO L231 Difference]: Finished difference. Result has 218 places, 340 transitions, 4391 flow [2024-05-12 12:03:57,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3940, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4391, PETRI_PLACES=218, PETRI_TRANSITIONS=340} [2024-05-12 12:03:57,822 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 165 predicate places. [2024-05-12 12:03:57,822 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 340 transitions, 4391 flow [2024-05-12 12:03:57,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:03:57,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:03:57,822 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:03:57,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-05-12 12:03:57,822 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:03:57,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:03:57,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1312583045, now seen corresponding path program 1 times [2024-05-12 12:03:57,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:03:57,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906279103] [2024-05-12 12:03:57,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:03:57,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:03:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:04:08,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:04:08,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:04:08,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906279103] [2024-05-12 12:04:08,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906279103] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:04:08,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:04:08,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:04:08,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285378443] [2024-05-12 12:04:08,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:04:08,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:04:08,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:04:08,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:04:08,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:04:08,938 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 12:04:08,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 340 transitions, 4391 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 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-05-12 12:04:08,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:04:08,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 12:04:08,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:04:12,402 INFO L124 PetriNetUnfolderBase]: 7519/11661 cut-off events. [2024-05-12 12:04:12,403 INFO L125 PetriNetUnfolderBase]: For 313250/313253 co-relation queries the response was YES. [2024-05-12 12:04:12,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73839 conditions, 11661 events. 7519/11661 cut-off events. For 313250/313253 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 75160 event pairs, 1950 based on Foata normal form. 8/11398 useless extension candidates. Maximal degree in co-relation 73740. Up to 9198 conditions per place. [2024-05-12 12:04:12,520 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 292 selfloop transitions, 106 changer transitions 0/406 dead transitions. [2024-05-12 12:04:12,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 406 transitions, 5907 flow [2024-05-12 12:04:12,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:04:12,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:04:12,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 194 transitions. [2024-05-12 12:04:12,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5159574468085106 [2024-05-12 12:04:12,535 INFO L175 Difference]: Start difference. First operand has 218 places, 340 transitions, 4391 flow. Second operand 8 states and 194 transitions. [2024-05-12 12:04:12,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 406 transitions, 5907 flow [2024-05-12 12:04:13,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 406 transitions, 5631 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-05-12 12:04:13,060 INFO L231 Difference]: Finished difference. Result has 221 places, 357 transitions, 4668 flow [2024-05-12 12:04:13,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=4141, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4668, PETRI_PLACES=221, PETRI_TRANSITIONS=357} [2024-05-12 12:04:13,061 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 168 predicate places. [2024-05-12 12:04:13,061 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 357 transitions, 4668 flow [2024-05-12 12:04:13,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 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-05-12 12:04:13,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:04:13,062 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:04:13,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-05-12 12:04:13,062 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:04:13,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:04:13,062 INFO L85 PathProgramCache]: Analyzing trace with hash -775430015, now seen corresponding path program 2 times [2024-05-12 12:04:13,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:04:13,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436064483] [2024-05-12 12:04:13,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:04:13,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:04:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:04:23,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:04:23,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:04:23,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436064483] [2024-05-12 12:04:23,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436064483] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:04:23,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:04:23,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:04:23,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438440771] [2024-05-12 12:04:23,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:04:23,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:04:23,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:04:23,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:04:23,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:04:23,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 12:04:23,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 357 transitions, 4668 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 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-05-12 12:04:23,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:04:23,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 12:04:23,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:04:27,272 INFO L124 PetriNetUnfolderBase]: 7501/11573 cut-off events. [2024-05-12 12:04:27,273 INFO L125 PetriNetUnfolderBase]: For 317506/317509 co-relation queries the response was YES. [2024-05-12 12:04:27,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73883 conditions, 11573 events. 7501/11573 cut-off events. For 317506/317509 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 74058 event pairs, 1841 based on Foata normal form. 8/11325 useless extension candidates. Maximal degree in co-relation 73782. Up to 9187 conditions per place. [2024-05-12 12:04:27,414 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 296 selfloop transitions, 101 changer transitions 0/405 dead transitions. [2024-05-12 12:04:27,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 405 transitions, 5901 flow [2024-05-12 12:04:27,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:04:27,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:04:27,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 193 transitions. [2024-05-12 12:04:27,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5132978723404256 [2024-05-12 12:04:27,415 INFO L175 Difference]: Start difference. First operand has 221 places, 357 transitions, 4668 flow. Second operand 8 states and 193 transitions. [2024-05-12 12:04:27,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 405 transitions, 5901 flow [2024-05-12 12:04:28,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 405 transitions, 5751 flow, removed 22 selfloop flow, removed 4 redundant places. [2024-05-12 12:04:28,217 INFO L231 Difference]: Finished difference. Result has 225 places, 357 transitions, 4734 flow [2024-05-12 12:04:28,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=4518, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4734, PETRI_PLACES=225, PETRI_TRANSITIONS=357} [2024-05-12 12:04:28,218 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 172 predicate places. [2024-05-12 12:04:28,218 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 357 transitions, 4734 flow [2024-05-12 12:04:28,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 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-05-12 12:04:28,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:04:28,218 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:04:28,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-05-12 12:04:28,218 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:04:28,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:04:28,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1950600937, now seen corresponding path program 2 times [2024-05-12 12:04:28,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:04:28,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151631117] [2024-05-12 12:04:28,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:04:28,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:04:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:04:37,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:04:37,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:04:37,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151631117] [2024-05-12 12:04:37,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151631117] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:04:37,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:04:37,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:04:37,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602522069] [2024-05-12 12:04:37,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:04:37,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:04:37,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:04:37,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:04:37,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:04:37,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 12:04:37,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 357 transitions, 4734 flow. Second operand has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:04:37,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:04:37,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 12:04:37,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:04:41,789 INFO L124 PetriNetUnfolderBase]: 7612/11293 cut-off events. [2024-05-12 12:04:41,789 INFO L125 PetriNetUnfolderBase]: For 337978/337981 co-relation queries the response was YES. [2024-05-12 12:04:41,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74988 conditions, 11293 events. 7612/11293 cut-off events. For 337978/337981 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 68029 event pairs, 1468 based on Foata normal form. 12/11199 useless extension candidates. Maximal degree in co-relation 74886. Up to 10147 conditions per place. [2024-05-12 12:04:41,903 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 340 selfloop transitions, 80 changer transitions 0/428 dead transitions. [2024-05-12 12:04:41,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 428 transitions, 5993 flow [2024-05-12 12:04:41,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:04:41,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:04:41,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 216 transitions. [2024-05-12 12:04:41,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5106382978723404 [2024-05-12 12:04:41,905 INFO L175 Difference]: Start difference. First operand has 225 places, 357 transitions, 4734 flow. Second operand 9 states and 216 transitions. [2024-05-12 12:04:41,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 428 transitions, 5993 flow [2024-05-12 12:04:42,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 428 transitions, 5820 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-05-12 12:04:42,623 INFO L231 Difference]: Finished difference. Result has 231 places, 367 transitions, 4955 flow [2024-05-12 12:04:42,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=4561, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4955, PETRI_PLACES=231, PETRI_TRANSITIONS=367} [2024-05-12 12:04:42,624 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 178 predicate places. [2024-05-12 12:04:42,624 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 367 transitions, 4955 flow [2024-05-12 12:04:42,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:04:42,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:04:42,625 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:04:42,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-05-12 12:04:42,625 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:04:42,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:04:42,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1874241339, now seen corresponding path program 3 times [2024-05-12 12:04:42,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:04:42,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870351447] [2024-05-12 12:04:42,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:04:42,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:04:42,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:04:51,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:04:51,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:04:51,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870351447] [2024-05-12 12:04:51,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870351447] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:04:51,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:04:51,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:04:51,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137829181] [2024-05-12 12:04:51,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:04:51,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:04:51,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:04:51,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:04:51,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:04:51,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 12:04:51,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 367 transitions, 4955 flow. Second operand has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:04:51,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:04:51,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 12:04:51,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:04:55,454 INFO L124 PetriNetUnfolderBase]: 7729/11476 cut-off events. [2024-05-12 12:04:55,455 INFO L125 PetriNetUnfolderBase]: For 359906/359909 co-relation queries the response was YES. [2024-05-12 12:04:55,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76874 conditions, 11476 events. 7729/11476 cut-off events. For 359906/359909 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 69530 event pairs, 1462 based on Foata normal form. 12/11382 useless extension candidates. Maximal degree in co-relation 76769. Up to 10109 conditions per place. [2024-05-12 12:04:55,574 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 336 selfloop transitions, 90 changer transitions 0/434 dead transitions. [2024-05-12 12:04:55,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 434 transitions, 6243 flow [2024-05-12 12:04:55,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:04:55,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:04:55,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 216 transitions. [2024-05-12 12:04:55,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5106382978723404 [2024-05-12 12:04:55,575 INFO L175 Difference]: Start difference. First operand has 231 places, 367 transitions, 4955 flow. Second operand 9 states and 216 transitions. [2024-05-12 12:04:55,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 434 transitions, 6243 flow [2024-05-12 12:04:56,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 434 transitions, 6055 flow, removed 60 selfloop flow, removed 3 redundant places. [2024-05-12 12:04:56,284 INFO L231 Difference]: Finished difference. Result has 238 places, 373 transitions, 5178 flow [2024-05-12 12:04:56,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=4767, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5178, PETRI_PLACES=238, PETRI_TRANSITIONS=373} [2024-05-12 12:04:56,288 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 185 predicate places. [2024-05-12 12:04:56,288 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 373 transitions, 5178 flow [2024-05-12 12:04:56,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:04:56,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:04:56,288 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:04:56,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-05-12 12:04:56,288 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:04:56,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:04:56,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1701520809, now seen corresponding path program 4 times [2024-05-12 12:04:56,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:04:56,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094632967] [2024-05-12 12:04:56,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:04:56,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:04:56,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:05:06,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:05:06,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:05:06,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094632967] [2024-05-12 12:05:06,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094632967] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:05:06,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:05:06,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:05:06,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022189777] [2024-05-12 12:05:06,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:05:06,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:05:06,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:05:06,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:05:06,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:05:06,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 12:05:06,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 373 transitions, 5178 flow. Second operand has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:05:06,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:05:06,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 12:05:06,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:05:10,697 INFO L124 PetriNetUnfolderBase]: 7830/11663 cut-off events. [2024-05-12 12:05:10,697 INFO L125 PetriNetUnfolderBase]: For 376604/376607 co-relation queries the response was YES. [2024-05-12 12:05:10,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78821 conditions, 11663 events. 7830/11663 cut-off events. For 376604/376607 co-relation queries the response was YES. Maximal size of possible extension queue 521. Compared 70969 event pairs, 1533 based on Foata normal form. 12/11563 useless extension candidates. Maximal degree in co-relation 78714. Up to 10489 conditions per place. [2024-05-12 12:05:10,835 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 345 selfloop transitions, 87 changer transitions 0/440 dead transitions. [2024-05-12 12:05:10,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 440 transitions, 6408 flow [2024-05-12 12:05:10,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:05:10,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:05:10,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 220 transitions. [2024-05-12 12:05:10,836 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5200945626477541 [2024-05-12 12:05:10,836 INFO L175 Difference]: Start difference. First operand has 238 places, 373 transitions, 5178 flow. Second operand 9 states and 220 transitions. [2024-05-12 12:05:10,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 440 transitions, 6408 flow [2024-05-12 12:05:11,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 440 transitions, 6136 flow, removed 94 selfloop flow, removed 4 redundant places. [2024-05-12 12:05:11,840 INFO L231 Difference]: Finished difference. Result has 244 places, 376 transitions, 5213 flow [2024-05-12 12:05:11,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=4946, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5213, PETRI_PLACES=244, PETRI_TRANSITIONS=376} [2024-05-12 12:05:11,841 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 191 predicate places. [2024-05-12 12:05:11,841 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 376 transitions, 5213 flow [2024-05-12 12:05:11,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:05:11,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:05:11,842 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:05:11,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-05-12 12:05:11,842 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:05:11,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:05:11,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1573323135, now seen corresponding path program 3 times [2024-05-12 12:05:11,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:05:11,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702370716] [2024-05-12 12:05:11,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:05:11,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:05:11,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:05:24,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:05:24,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:05:24,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702370716] [2024-05-12 12:05:24,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702370716] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:05:24,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:05:24,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:05:24,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086665297] [2024-05-12 12:05:24,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:05:24,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:05:24,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:05:24,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:05:24,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:05:25,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 12:05:25,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 376 transitions, 5213 flow. Second operand has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:05:25,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:05:25,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 12:05:25,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:05:29,066 INFO L124 PetriNetUnfolderBase]: 8052/12451 cut-off events. [2024-05-12 12:05:29,067 INFO L125 PetriNetUnfolderBase]: For 387861/387864 co-relation queries the response was YES. [2024-05-12 12:05:29,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81097 conditions, 12451 events. 8052/12451 cut-off events. For 387861/387864 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 80776 event pairs, 1963 based on Foata normal form. 14/12191 useless extension candidates. Maximal degree in co-relation 80987. Up to 9816 conditions per place. [2024-05-12 12:05:29,226 INFO L140 encePairwiseOnDemand]: 32/47 looper letters, 317 selfloop transitions, 116 changer transitions 0/441 dead transitions. [2024-05-12 12:05:29,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 441 transitions, 6717 flow [2024-05-12 12:05:29,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:05:29,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:05:29,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 219 transitions. [2024-05-12 12:05:29,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5177304964539007 [2024-05-12 12:05:29,227 INFO L175 Difference]: Start difference. First operand has 244 places, 376 transitions, 5213 flow. Second operand 9 states and 219 transitions. [2024-05-12 12:05:29,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 441 transitions, 6717 flow [2024-05-12 12:05:30,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 441 transitions, 6506 flow, removed 25 selfloop flow, removed 5 redundant places. [2024-05-12 12:05:30,260 INFO L231 Difference]: Finished difference. Result has 248 places, 386 transitions, 5425 flow [2024-05-12 12:05:30,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=5002, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5425, PETRI_PLACES=248, PETRI_TRANSITIONS=386} [2024-05-12 12:05:30,260 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 195 predicate places. [2024-05-12 12:05:30,261 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 386 transitions, 5425 flow [2024-05-12 12:05:30,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:05:30,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:05:30,266 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:05:30,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-05-12 12:05:30,266 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:05:30,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:05:30,267 INFO L85 PathProgramCache]: Analyzing trace with hash -750086873, now seen corresponding path program 3 times [2024-05-12 12:05:30,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:05:30,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996300913] [2024-05-12 12:05:30,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:05:30,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:05:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:05:41,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:05:41,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:05:41,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996300913] [2024-05-12 12:05:41,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996300913] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:05:41,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:05:41,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:05:41,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600513721] [2024-05-12 12:05:41,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:05:41,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:05:41,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:05:41,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:05:41,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:05:42,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 12:05:42,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 386 transitions, 5425 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 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-05-12 12:05:42,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:05:42,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 12:05:42,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:05:45,968 INFO L124 PetriNetUnfolderBase]: 8049/12766 cut-off events. [2024-05-12 12:05:45,968 INFO L125 PetriNetUnfolderBase]: For 402907/402907 co-relation queries the response was YES. [2024-05-12 12:05:46,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82876 conditions, 12766 events. 8049/12766 cut-off events. For 402907/402907 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 86047 event pairs, 3512 based on Foata normal form. 9/12484 useless extension candidates. Maximal degree in co-relation 82765. Up to 11175 conditions per place. [2024-05-12 12:05:46,126 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 381 selfloop transitions, 49 changer transitions 0/438 dead transitions. [2024-05-12 12:05:46,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 438 transitions, 6779 flow [2024-05-12 12:05:46,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:05:46,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:05:46,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 194 transitions. [2024-05-12 12:05:46,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.458628841607565 [2024-05-12 12:05:46,128 INFO L175 Difference]: Start difference. First operand has 248 places, 386 transitions, 5425 flow. Second operand 9 states and 194 transitions. [2024-05-12 12:05:46,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 438 transitions, 6779 flow [2024-05-12 12:05:46,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 438 transitions, 6435 flow, removed 53 selfloop flow, removed 7 redundant places. [2024-05-12 12:05:46,963 INFO L231 Difference]: Finished difference. Result has 253 places, 401 transitions, 5510 flow [2024-05-12 12:05:46,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=5101, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5510, PETRI_PLACES=253, PETRI_TRANSITIONS=401} [2024-05-12 12:05:46,964 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 200 predicate places. [2024-05-12 12:05:46,964 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 401 transitions, 5510 flow [2024-05-12 12:05:46,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 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-05-12 12:05:46,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:05:46,965 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:05:46,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-05-12 12:05:46,965 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:05:46,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:05:46,965 INFO L85 PathProgramCache]: Analyzing trace with hash 782457339, now seen corresponding path program 4 times [2024-05-12 12:05:46,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:05:46,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854109335] [2024-05-12 12:05:46,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:05:46,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:05:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:05:57,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:05:57,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:05:57,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854109335] [2024-05-12 12:05:57,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854109335] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:05:57,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:05:57,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:05:57,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147828681] [2024-05-12 12:05:57,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:05:57,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:05:57,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:05:57,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:05:57,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:05:57,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 12:05:57,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 401 transitions, 5510 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 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-05-12 12:05:57,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:05:57,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 12:05:57,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:06:01,122 INFO L124 PetriNetUnfolderBase]: 8022/12742 cut-off events. [2024-05-12 12:06:01,122 INFO L125 PetriNetUnfolderBase]: For 396075/396075 co-relation queries the response was YES. [2024-05-12 12:06:01,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81261 conditions, 12742 events. 8022/12742 cut-off events. For 396075/396075 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 86013 event pairs, 3585 based on Foata normal form. 9/12457 useless extension candidates. Maximal degree in co-relation 81146. Up to 11307 conditions per place. [2024-05-12 12:06:01,266 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 384 selfloop transitions, 40 changer transitions 0/432 dead transitions. [2024-05-12 12:06:01,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 432 transitions, 6455 flow [2024-05-12 12:06:01,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:06:01,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:06:01,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2024-05-12 12:06:01,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4491725768321513 [2024-05-12 12:06:01,267 INFO L175 Difference]: Start difference. First operand has 253 places, 401 transitions, 5510 flow. Second operand 9 states and 190 transitions. [2024-05-12 12:06:01,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 432 transitions, 6455 flow [2024-05-12 12:06:02,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 432 transitions, 6237 flow, removed 73 selfloop flow, removed 5 redundant places. [2024-05-12 12:06:02,095 INFO L231 Difference]: Finished difference. Result has 257 places, 401 transitions, 5386 flow [2024-05-12 12:06:02,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=5292, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5386, PETRI_PLACES=257, PETRI_TRANSITIONS=401} [2024-05-12 12:06:02,096 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 204 predicate places. [2024-05-12 12:06:02,096 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 401 transitions, 5386 flow [2024-05-12 12:06:02,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 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-05-12 12:06:02,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:06:02,096 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:06:02,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-05-12 12:06:02,097 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:06:02,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:06:02,097 INFO L85 PathProgramCache]: Analyzing trace with hash 2045989549, now seen corresponding path program 5 times [2024-05-12 12:06:02,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:06:02,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294783282] [2024-05-12 12:06:02,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:06:02,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:06:02,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:06:11,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:06:11,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:06:11,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294783282] [2024-05-12 12:06:11,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294783282] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:06:11,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:06:11,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:06:11,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589776325] [2024-05-12 12:06:11,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:06:11,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:06:11,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:06:11,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:06:11,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:06:11,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 12:06:11,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 401 transitions, 5386 flow. Second operand has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:06:11,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:06:11,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 12:06:11,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:06:15,550 INFO L124 PetriNetUnfolderBase]: 8139/13126 cut-off events. [2024-05-12 12:06:15,550 INFO L125 PetriNetUnfolderBase]: For 409034/409063 co-relation queries the response was YES. [2024-05-12 12:06:15,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82447 conditions, 13126 events. 8139/13126 cut-off events. For 409034/409063 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 89455 event pairs, 2257 based on Foata normal form. 38/12803 useless extension candidates. Maximal degree in co-relation 82331. Up to 10312 conditions per place. [2024-05-12 12:06:15,723 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 344 selfloop transitions, 106 changer transitions 0/458 dead transitions. [2024-05-12 12:06:15,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 458 transitions, 6700 flow [2024-05-12 12:06:15,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:06:15,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:06:15,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 192 transitions. [2024-05-12 12:06:15,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5106382978723404 [2024-05-12 12:06:15,724 INFO L175 Difference]: Start difference. First operand has 257 places, 401 transitions, 5386 flow. Second operand 8 states and 192 transitions. [2024-05-12 12:06:15,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 458 transitions, 6700 flow [2024-05-12 12:06:16,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 458 transitions, 6587 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-05-12 12:06:16,516 INFO L231 Difference]: Finished difference. Result has 258 places, 407 transitions, 5755 flow [2024-05-12 12:06:16,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=5273, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5755, PETRI_PLACES=258, PETRI_TRANSITIONS=407} [2024-05-12 12:06:16,516 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 205 predicate places. [2024-05-12 12:06:16,517 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 407 transitions, 5755 flow [2024-05-12 12:06:16,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:06:16,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:06:16,517 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:06:16,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-05-12 12:06:16,517 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:06:16,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:06:16,518 INFO L85 PathProgramCache]: Analyzing trace with hash 765346661, now seen corresponding path program 6 times [2024-05-12 12:06:16,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:06:16,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579585497] [2024-05-12 12:06:16,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:06:16,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:06:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:06:26,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:06:26,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:06:26,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579585497] [2024-05-12 12:06:26,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579585497] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:06:26,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:06:26,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:06:26,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830783007] [2024-05-12 12:06:26,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:06:26,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:06:26,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:06:26,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:06:26,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:06:26,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 12:06:26,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 407 transitions, 5755 flow. Second operand has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:06:26,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:06:26,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 12:06:26,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:06:30,916 INFO L124 PetriNetUnfolderBase]: 8272/13475 cut-off events. [2024-05-12 12:06:30,916 INFO L125 PetriNetUnfolderBase]: For 434853/434864 co-relation queries the response was YES. [2024-05-12 12:06:31,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85766 conditions, 13475 events. 8272/13475 cut-off events. For 434853/434864 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 93696 event pairs, 2424 based on Foata normal form. 22/13093 useless extension candidates. Maximal degree in co-relation 85649. Up to 10956 conditions per place. [2024-05-12 12:06:31,085 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 403 selfloop transitions, 51 changer transitions 0/462 dead transitions. [2024-05-12 12:06:31,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 462 transitions, 6934 flow [2024-05-12 12:06:31,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:06:31,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:06:31,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 195 transitions. [2024-05-12 12:06:31,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5186170212765957 [2024-05-12 12:06:31,090 INFO L175 Difference]: Start difference. First operand has 258 places, 407 transitions, 5755 flow. Second operand 8 states and 195 transitions. [2024-05-12 12:06:31,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 462 transitions, 6934 flow [2024-05-12 12:06:32,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 462 transitions, 6695 flow, removed 80 selfloop flow, removed 4 redundant places. [2024-05-12 12:06:32,125 INFO L231 Difference]: Finished difference. Result has 262 places, 410 transitions, 5697 flow [2024-05-12 12:06:32,125 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=5518, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5697, PETRI_PLACES=262, PETRI_TRANSITIONS=410} [2024-05-12 12:06:32,126 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 209 predicate places. [2024-05-12 12:06:32,126 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 410 transitions, 5697 flow [2024-05-12 12:06:32,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:06:32,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:06:32,126 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:06:32,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-05-12 12:06:32,127 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:06:32,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:06:32,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1598312697, now seen corresponding path program 7 times [2024-05-12 12:06:32,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:06:32,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152968592] [2024-05-12 12:06:32,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:06:32,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:06:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:06:42,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:06:42,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:06:42,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152968592] [2024-05-12 12:06:42,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152968592] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:06:42,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:06:42,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:06:42,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525281868] [2024-05-12 12:06:42,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:06:42,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:06:42,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:06:42,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:06:42,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:06:42,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 12:06:42,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 410 transitions, 5697 flow. Second operand has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:06:42,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:06:42,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 12:06:42,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:06:46,526 INFO L124 PetriNetUnfolderBase]: 8365/13487 cut-off events. [2024-05-12 12:06:46,526 INFO L125 PetriNetUnfolderBase]: For 427532/427543 co-relation queries the response was YES. [2024-05-12 12:06:46,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86215 conditions, 13487 events. 8365/13487 cut-off events. For 427532/427543 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 92355 event pairs, 2282 based on Foata normal form. 20/13143 useless extension candidates. Maximal degree in co-relation 86097. Up to 10739 conditions per place. [2024-05-12 12:06:46,713 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 357 selfloop transitions, 101 changer transitions 0/466 dead transitions. [2024-05-12 12:06:46,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 466 transitions, 6896 flow [2024-05-12 12:06:46,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:06:46,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:06:46,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions. [2024-05-12 12:06:46,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.523936170212766 [2024-05-12 12:06:46,715 INFO L175 Difference]: Start difference. First operand has 262 places, 410 transitions, 5697 flow. Second operand 8 states and 197 transitions. [2024-05-12 12:06:46,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 466 transitions, 6896 flow [2024-05-12 12:06:47,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 466 transitions, 6766 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-05-12 12:06:47,930 INFO L231 Difference]: Finished difference. Result has 265 places, 412 transitions, 5878 flow [2024-05-12 12:06:47,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=5567, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5878, PETRI_PLACES=265, PETRI_TRANSITIONS=412} [2024-05-12 12:06:47,931 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 212 predicate places. [2024-05-12 12:06:47,931 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 412 transitions, 5878 flow [2024-05-12 12:06:47,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:06:47,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:06:47,931 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:06:47,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-05-12 12:06:47,932 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:06:47,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:06:47,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1298838549, now seen corresponding path program 8 times [2024-05-12 12:06:47,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:06:47,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896337855] [2024-05-12 12:06:47,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:06:47,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:06:47,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:06:58,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:06:58,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:06:58,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896337855] [2024-05-12 12:06:58,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896337855] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:06:58,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:06:58,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:06:58,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293151593] [2024-05-12 12:06:58,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:06:58,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:06:58,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:06:58,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:06:58,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:06:58,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 12:06:58,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 412 transitions, 5878 flow. Second operand has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:06:58,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:06:58,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 12:06:58,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:07:02,555 INFO L124 PetriNetUnfolderBase]: 8365/13286 cut-off events. [2024-05-12 12:07:02,555 INFO L125 PetriNetUnfolderBase]: For 430547/430550 co-relation queries the response was YES. [2024-05-12 12:07:02,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85929 conditions, 13286 events. 8365/13286 cut-off events. For 430547/430550 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 90393 event pairs, 3664 based on Foata normal form. 12/13002 useless extension candidates. Maximal degree in co-relation 85809. Up to 11733 conditions per place. [2024-05-12 12:07:02,717 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 424 selfloop transitions, 24 changer transitions 0/456 dead transitions. [2024-05-12 12:07:02,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 456 transitions, 6914 flow [2024-05-12 12:07:02,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:07:02,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:07:02,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 181 transitions. [2024-05-12 12:07:02,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48138297872340424 [2024-05-12 12:07:02,719 INFO L175 Difference]: Start difference. First operand has 265 places, 412 transitions, 5878 flow. Second operand 8 states and 181 transitions. [2024-05-12 12:07:02,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 456 transitions, 6914 flow [2024-05-12 12:07:03,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 456 transitions, 6686 flow, removed 28 selfloop flow, removed 6 redundant places. [2024-05-12 12:07:03,633 INFO L231 Difference]: Finished difference. Result has 266 places, 412 transitions, 5684 flow [2024-05-12 12:07:03,634 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=5586, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5684, PETRI_PLACES=266, PETRI_TRANSITIONS=412} [2024-05-12 12:07:03,634 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 213 predicate places. [2024-05-12 12:07:03,634 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 412 transitions, 5684 flow [2024-05-12 12:07:03,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.454545454545455) internal successors, (137), 11 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:07:03,634 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:07:03,635 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:07:03,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-05-12 12:07:03,635 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:07:03,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:07:03,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1978567163, now seen corresponding path program 5 times [2024-05-12 12:07:03,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:07:03,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707988418] [2024-05-12 12:07:03,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:07:03,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:07:03,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:07:14,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:07:14,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:07:14,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707988418] [2024-05-12 12:07:14,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707988418] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:07:14,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:07:14,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:07:14,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382235406] [2024-05-12 12:07:14,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:07:14,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:07:14,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:07:14,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:07:14,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:07:14,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 12:07:14,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 412 transitions, 5684 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 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-05-12 12:07:14,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:07:14,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 12:07:14,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:07:18,783 INFO L124 PetriNetUnfolderBase]: 8356/13307 cut-off events. [2024-05-12 12:07:18,783 INFO L125 PetriNetUnfolderBase]: For 387104/387107 co-relation queries the response was YES. [2024-05-12 12:07:18,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84013 conditions, 13307 events. 8356/13307 cut-off events. For 387104/387107 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 90795 event pairs, 3764 based on Foata normal form. 5/13008 useless extension candidates. Maximal degree in co-relation 83893. Up to 11912 conditions per place. [2024-05-12 12:07:18,932 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 391 selfloop transitions, 34 changer transitions 0/433 dead transitions. [2024-05-12 12:07:18,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 433 transitions, 6605 flow [2024-05-12 12:07:18,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:07:18,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:07:18,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 150 transitions. [2024-05-12 12:07:18,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45592705167173253 [2024-05-12 12:07:18,934 INFO L175 Difference]: Start difference. First operand has 266 places, 412 transitions, 5684 flow. Second operand 7 states and 150 transitions. [2024-05-12 12:07:18,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 433 transitions, 6605 flow [2024-05-12 12:07:19,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 433 transitions, 6521 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-05-12 12:07:19,986 INFO L231 Difference]: Finished difference. Result has 267 places, 412 transitions, 5676 flow [2024-05-12 12:07:19,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=5600, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5676, PETRI_PLACES=267, PETRI_TRANSITIONS=412} [2024-05-12 12:07:19,987 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 214 predicate places. [2024-05-12 12:07:19,987 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 412 transitions, 5676 flow [2024-05-12 12:07:19,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 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-05-12 12:07:19,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:07:19,988 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:07:19,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-05-12 12:07:19,988 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:07:19,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:07:19,988 INFO L85 PathProgramCache]: Analyzing trace with hash 932283769, now seen corresponding path program 6 times [2024-05-12 12:07:19,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:07:19,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512838120] [2024-05-12 12:07:19,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:07:19,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:07:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:07:31,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:07:31,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:07:31,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512838120] [2024-05-12 12:07:31,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512838120] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:07:31,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:07:31,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:07:31,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391035038] [2024-05-12 12:07:31,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:07:31,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:07:31,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:07:31,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:07:31,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:07:31,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 12:07:31,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 412 transitions, 5676 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 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-05-12 12:07:31,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:07:31,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 12:07:31,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:07:35,809 INFO L124 PetriNetUnfolderBase]: 8332/13298 cut-off events. [2024-05-12 12:07:35,810 INFO L125 PetriNetUnfolderBase]: For 383842/383845 co-relation queries the response was YES. [2024-05-12 12:07:35,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83043 conditions, 13298 events. 8332/13298 cut-off events. For 383842/383845 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 90976 event pairs, 3741 based on Foata normal form. 8/12996 useless extension candidates. Maximal degree in co-relation 82922. Up to 11404 conditions per place. [2024-05-12 12:07:35,995 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 374 selfloop transitions, 58 changer transitions 0/440 dead transitions. [2024-05-12 12:07:35,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 440 transitions, 6767 flow [2024-05-12 12:07:35,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:07:35,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:07:35,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 159 transitions. [2024-05-12 12:07:36,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48328267477203646 [2024-05-12 12:07:36,000 INFO L175 Difference]: Start difference. First operand has 267 places, 412 transitions, 5676 flow. Second operand 7 states and 159 transitions. [2024-05-12 12:07:36,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 440 transitions, 6767 flow [2024-05-12 12:07:37,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 440 transitions, 6609 flow, removed 34 selfloop flow, removed 6 redundant places. [2024-05-12 12:07:37,073 INFO L231 Difference]: Finished difference. Result has 268 places, 412 transitions, 5646 flow [2024-05-12 12:07:37,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=5518, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5646, PETRI_PLACES=268, PETRI_TRANSITIONS=412} [2024-05-12 12:07:37,075 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 215 predicate places. [2024-05-12 12:07:37,075 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 412 transitions, 5646 flow [2024-05-12 12:07:37,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 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-05-12 12:07:37,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:07:37,076 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:07:37,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-05-12 12:07:37,084 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:07:37,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:07:37,091 INFO L85 PathProgramCache]: Analyzing trace with hash 932279801, now seen corresponding path program 4 times [2024-05-12 12:07:37,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:07:37,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955646854] [2024-05-12 12:07:37,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:07:37,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:07:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:07:47,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:07:47,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:07:47,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955646854] [2024-05-12 12:07:47,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955646854] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:07:47,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:07:47,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:07:47,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603556593] [2024-05-12 12:07:47,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:07:47,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:07:47,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:07:47,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:07:47,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:07:47,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 12:07:47,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 412 transitions, 5646 flow. Second operand has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:07:47,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:07:47,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 12:07:47,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:07:51,898 INFO L124 PetriNetUnfolderBase]: 8473/13450 cut-off events. [2024-05-12 12:07:51,899 INFO L125 PetriNetUnfolderBase]: For 398679/398682 co-relation queries the response was YES. [2024-05-12 12:07:52,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83963 conditions, 13450 events. 8473/13450 cut-off events. For 398679/398682 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 91628 event pairs, 3684 based on Foata normal form. 20/13170 useless extension candidates. Maximal degree in co-relation 83842. Up to 11435 conditions per place. [2024-05-12 12:07:52,065 INFO L140 encePairwiseOnDemand]: 32/47 looper letters, 373 selfloop transitions, 75 changer transitions 0/456 dead transitions. [2024-05-12 12:07:52,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 456 transitions, 6867 flow [2024-05-12 12:07:52,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:07:52,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:07:52,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 185 transitions. [2024-05-12 12:07:52,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4920212765957447 [2024-05-12 12:07:52,066 INFO L175 Difference]: Start difference. First operand has 268 places, 412 transitions, 5646 flow. Second operand 8 states and 185 transitions. [2024-05-12 12:07:52,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 456 transitions, 6867 flow [2024-05-12 12:07:53,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 456 transitions, 6681 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-05-12 12:07:53,101 INFO L231 Difference]: Finished difference. Result has 271 places, 422 transitions, 5845 flow [2024-05-12 12:07:53,102 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=5460, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5845, PETRI_PLACES=271, PETRI_TRANSITIONS=422} [2024-05-12 12:07:53,103 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 218 predicate places. [2024-05-12 12:07:53,103 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 422 transitions, 5845 flow [2024-05-12 12:07:53,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:07:53,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:07:53,103 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:07:53,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-05-12 12:07:53,103 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:07:53,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:07:53,104 INFO L85 PathProgramCache]: Analyzing trace with hash 946072042, now seen corresponding path program 1 times [2024-05-12 12:07:53,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:07:53,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797612727] [2024-05-12 12:07:53,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:07:53,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:07:53,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:08:04,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:08:04,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:08:04,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797612727] [2024-05-12 12:08:04,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797612727] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:08:04,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:08:04,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:08:04,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655432538] [2024-05-12 12:08:04,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:08:04,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:08:04,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:08:04,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:08:04,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:08:05,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 12:08:05,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 422 transitions, 5845 flow. Second operand has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:08:05,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:08:05,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 12:08:05,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:08:09,206 INFO L124 PetriNetUnfolderBase]: 8691/13808 cut-off events. [2024-05-12 12:08:09,206 INFO L125 PetriNetUnfolderBase]: For 419175/419178 co-relation queries the response was YES. [2024-05-12 12:08:09,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88595 conditions, 13808 events. 8691/13808 cut-off events. For 419175/419178 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 94621 event pairs, 3762 based on Foata normal form. 10/13503 useless extension candidates. Maximal degree in co-relation 88472. Up to 12039 conditions per place. [2024-05-12 12:08:09,393 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 411 selfloop transitions, 53 changer transitions 0/472 dead transitions. [2024-05-12 12:08:09,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 472 transitions, 7307 flow [2024-05-12 12:08:09,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:08:09,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:08:09,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 180 transitions. [2024-05-12 12:08:09,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4787234042553192 [2024-05-12 12:08:09,395 INFO L175 Difference]: Start difference. First operand has 271 places, 422 transitions, 5845 flow. Second operand 8 states and 180 transitions. [2024-05-12 12:08:09,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 472 transitions, 7307 flow [2024-05-12 12:08:10,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 472 transitions, 7013 flow, removed 68 selfloop flow, removed 7 redundant places. [2024-05-12 12:08:10,667 INFO L231 Difference]: Finished difference. Result has 274 places, 442 transitions, 6049 flow [2024-05-12 12:08:10,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=5553, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6049, PETRI_PLACES=274, PETRI_TRANSITIONS=442} [2024-05-12 12:08:10,667 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 221 predicate places. [2024-05-12 12:08:10,667 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 442 transitions, 6049 flow [2024-05-12 12:08:10,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:08:10,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:08:10,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:08:10,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-05-12 12:08:10,668 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:08:10,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:08:10,669 INFO L85 PathProgramCache]: Analyzing trace with hash -832302628, now seen corresponding path program 1 times [2024-05-12 12:08:10,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:08:10,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011655711] [2024-05-12 12:08:10,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:08:10,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:08:10,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:08:27,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:08:27,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:08:27,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011655711] [2024-05-12 12:08:27,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011655711] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:08:27,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:08:27,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:08:27,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140518415] [2024-05-12 12:08:27,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:08:27,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:08:27,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:08:27,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:08:27,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:08:28,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 12:08:28,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 442 transitions, 6049 flow. Second operand has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 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-05-12 12:08:28,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:08:28,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 12:08:28,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:08:33,260 INFO L124 PetriNetUnfolderBase]: 10188/16614 cut-off events. [2024-05-12 12:08:33,260 INFO L125 PetriNetUnfolderBase]: For 451797/451824 co-relation queries the response was YES. [2024-05-12 12:08:33,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104457 conditions, 16614 events. 10188/16614 cut-off events. For 451797/451824 co-relation queries the response was YES. Maximal size of possible extension queue 726. Compared 120101 event pairs, 2566 based on Foata normal form. 26/16178 useless extension candidates. Maximal degree in co-relation 104332. Up to 12059 conditions per place. [2024-05-12 12:08:33,484 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 434 selfloop transitions, 142 changer transitions 0/584 dead transitions. [2024-05-12 12:08:33,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 584 transitions, 8688 flow [2024-05-12 12:08:33,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:08:33,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:08:33,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 259 transitions. [2024-05-12 12:08:33,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.551063829787234 [2024-05-12 12:08:33,486 INFO L175 Difference]: Start difference. First operand has 274 places, 442 transitions, 6049 flow. Second operand 10 states and 259 transitions. [2024-05-12 12:08:33,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 584 transitions, 8688 flow [2024-05-12 12:08:34,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 584 transitions, 8458 flow, removed 99 selfloop flow, removed 3 redundant places. [2024-05-12 12:08:34,803 INFO L231 Difference]: Finished difference. Result has 283 places, 490 transitions, 6925 flow [2024-05-12 12:08:34,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=5819, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6925, PETRI_PLACES=283, PETRI_TRANSITIONS=490} [2024-05-12 12:08:34,803 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 230 predicate places. [2024-05-12 12:08:34,804 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 490 transitions, 6925 flow [2024-05-12 12:08:34,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 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-05-12 12:08:34,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:08:34,804 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:08:34,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-05-12 12:08:34,804 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:08:34,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:08:34,805 INFO L85 PathProgramCache]: Analyzing trace with hash -73880212, now seen corresponding path program 2 times [2024-05-12 12:08:34,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:08:34,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657323354] [2024-05-12 12:08:34,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:08:34,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:08:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:08:51,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:08:51,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:08:51,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657323354] [2024-05-12 12:08:51,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657323354] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:08:51,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:08:51,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:08:51,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646953573] [2024-05-12 12:08:51,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:08:51,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:08:51,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:08:52,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:08:52,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:08:52,136 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-05-12 12:08:52,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 490 transitions, 6925 flow. Second operand has 11 states, 11 states have (on average 12.545454545454545) internal successors, (138), 11 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:08:52,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:08:52,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-05-12 12:08:52,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15