./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix028_power.oepc_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/mix028_power.oepc_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/mix028_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2024-05-07_14-17-48.files/mutex-meet/mix028_power.oepc_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:35:34,347 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 11:35:34,429 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 11:35:34,433 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 11:35:34,433 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 11:35:34,455 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 11:35:34,456 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 11:35:34,456 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 11:35:34,457 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 11:35:34,460 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 11:35:34,461 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 11:35:34,461 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 11:35:34,462 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 11:35:34,463 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 11:35:34,463 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 11:35:34,463 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 11:35:34,463 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 11:35:34,464 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 11:35:34,464 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 11:35:34,464 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 11:35:34,464 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 11:35:34,465 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 11:35:34,465 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 11:35:34,465 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 11:35:34,466 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 11:35:34,466 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 11:35:34,466 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 11:35:34,466 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 11:35:34,467 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 11:35:34,467 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 11:35:34,468 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 11:35:34,468 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 11:35:34,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 11:35:34,468 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 11:35:34,469 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 11:35:34,469 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 11:35:34,469 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 11:35:34,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 11:35:34,469 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 11:35:34,469 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 11:35:34,470 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 11:35:34,470 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 11:35:34,470 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 11:35:34,470 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:35:34,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 11:35:34,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 11:35:34,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 11:35:34,704 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 11:35:34,704 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 11:35:34,705 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i [2024-05-12 11:35:35,737 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 11:35:35,881 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 11:35:35,882 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i [2024-05-12 11:35:35,893 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bebb7376b/5e9eace74e1242c38235c00bb0cab687/FLAGebaaf83c1 [2024-05-12 11:35:35,903 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bebb7376b/5e9eace74e1242c38235c00bb0cab687 [2024-05-12 11:35:35,905 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 11:35:35,906 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 11:35:35,906 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/mix028_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml [2024-05-12 11:35:36,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 11:35:36,063 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 11:35:36,064 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 11:35:36,064 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 11:35:36,069 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 11:35:36,070 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 11:35:35" (1/2) ... [2024-05-12 11:35:36,071 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d1f2eb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:35:36, skipping insertion in model container [2024-05-12 11:35:36,071 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 11:35:35" (1/2) ... [2024-05-12 11:35:36,073 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6608b5b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:35:36, skipping insertion in model container [2024-05-12 11:35:36,073 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:35:36" (2/2) ... [2024-05-12 11:35:36,073 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d1f2eb3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:35:36, skipping insertion in model container [2024-05-12 11:35:36,073 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:35:36" (2/2) ... [2024-05-12 11:35:36,073 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 11:35:36,162 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 11:35:36,163 INFO L97 edCorrectnessWitness]: Location invariant before [L839-L839] ((((((((((((((((((! multithreaded || z$r_buff0_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! 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_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 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_p2_EAX + (long long )__unbuffered_p2_EBX >= 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 )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (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_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 )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (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_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_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (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_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p2_EBX <= 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_p2_EBX == 0 || __unbuffered_p2_EBX == 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)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 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 <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! 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:35:36,164 INFO L97 edCorrectnessWitness]: Location invariant before [L841-L841] ((((((((((((((((((! multithreaded || z$r_buff0_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! 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_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 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_p2_EAX + (long long )__unbuffered_p2_EBX >= 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 )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (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_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 )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (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_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_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (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_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p2_EBX <= 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_p2_EBX == 0 || __unbuffered_p2_EBX == 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)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 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 <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! 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:35:36,165 INFO L97 edCorrectnessWitness]: Location invariant before [L842-L842] ((((((((((((((((((! multithreaded || z$r_buff0_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! 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_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 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_p2_EAX + (long long )__unbuffered_p2_EBX >= 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 )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (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_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 )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (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_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_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (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_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p2_EBX <= 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_p2_EBX == 0 || __unbuffered_p2_EBX == 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)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 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 <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! 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:35:36,165 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 11:35:36,165 INFO L106 edCorrectnessWitness]: ghost_update [L837-L837] multithreaded = 1; [2024-05-12 11:35:36,207 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 11:35:36,357 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/mix028_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-05-12 11:35:36,520 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 11:35:36,533 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-05-12 11:35:36,637 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/mix028_power.oepc_pso.oepc_rmo.oepc.i[969,982] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-05-12 11:35:36,851 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 11:35:36,878 INFO L206 MainTranslator]: Completed translation [2024-05-12 11:35:36,878 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:35:36 WrapperNode [2024-05-12 11:35:36,879 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 11:35:36,880 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 11:35:36,881 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 11:35:36,881 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 11:35:36,886 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:35:36" (1/1) ... [2024-05-12 11:35:36,929 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:35:36" (1/1) ... [2024-05-12 11:35:37,021 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2024-05-12 11:35:37,021 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 11:35:37,022 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 11:35:37,022 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 11:35:37,023 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 11:35:37,031 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:35:36" (1/1) ... [2024-05-12 11:35:37,031 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:35:36" (1/1) ... [2024-05-12 11:35:37,061 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:35:36" (1/1) ... [2024-05-12 11:35:37,101 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:35:37,102 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:35:36" (1/1) ... [2024-05-12 11:35:37,102 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:35:36" (1/1) ... [2024-05-12 11:35:37,137 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:35:36" (1/1) ... [2024-05-12 11:35:37,139 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:35:36" (1/1) ... [2024-05-12 11:35:37,153 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:35:36" (1/1) ... [2024-05-12 11:35:37,160 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:35:36" (1/1) ... [2024-05-12 11:35:37,179 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 11:35:37,181 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 11:35:37,181 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 11:35:37,181 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 11:35:37,182 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:35:36" (1/1) ... [2024-05-12 11:35:37,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 11:35:37,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 11:35:37,228 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:35:37,239 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:35:37,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 11:35:37,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 11:35:37,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 11:35:37,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-05-12 11:35:37,260 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-12 11:35:37,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 11:35:37,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 11:35:37,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 11:35:37,261 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-12 11:35:37,261 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-12 11:35:37,261 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-12 11:35:37,261 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-12 11:35:37,261 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-12 11:35:37,262 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-12 11:35:37,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 11:35:37,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 11:35:37,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 11:35:37,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-05-12 11:35:37,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-12 11:35:37,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 11:35:37,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 11:35:37,263 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:35:37,367 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 11:35:37,368 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 11:35:38,683 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 11:35:38,683 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 11:35:38,985 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 11:35:38,985 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-12 11:35:38,986 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 11:35:38 BoogieIcfgContainer [2024-05-12 11:35:38,986 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 11:35:38,989 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 11:35:38,989 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 11:35:38,991 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 11:35:38,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 11:35:35" (1/4) ... [2024-05-12 11:35:38,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dd7b35f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 11:35:38, skipping insertion in model container [2024-05-12 11:35:38,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:35:36" (2/4) ... [2024-05-12 11:35:38,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dd7b35f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 11:35:38, skipping insertion in model container [2024-05-12 11:35:38,993 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:35:36" (3/4) ... [2024-05-12 11:35:38,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dd7b35f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 11:35:38, skipping insertion in model container [2024-05-12 11:35:38,993 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:35:38" (4/4) ... [2024-05-12 11:35:38,994 INFO L112 eAbstractionObserver]: Analyzing ICFG mix028_power.oepc_pso.oepc_rmo.oepc.i [2024-05-12 11:35:39,006 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 11:35:39,007 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-05-12 11:35:39,007 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 11:35:39,106 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-12 11:35:39,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 48 transitions, 108 flow [2024-05-12 11:35:39,202 INFO L124 PetriNetUnfolderBase]: 1/45 cut-off events. [2024-05-12 11:35:39,202 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 11:35:39,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 45 events. 1/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2024-05-12 11:35:39,205 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 48 transitions, 108 flow [2024-05-12 11:35:39,207 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 45 transitions, 99 flow [2024-05-12 11:35:39,219 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 11:35:39,227 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;@645ea3e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 11:35:39,228 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-05-12 11:35:39,234 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 11:35:39,234 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-05-12 11:35:39,235 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 11:35:39,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:35:39,235 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 11:35:39,236 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:35:39,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:35:39,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1764592650, now seen corresponding path program 1 times [2024-05-12 11:35:39,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:35:39,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961269292] [2024-05-12 11:35:39,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:35:39,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:35:39,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:35:45,683 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:35:45,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:35:45,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961269292] [2024-05-12 11:35:45,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961269292] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:35:45,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:35:45,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 11:35:45,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998440253] [2024-05-12 11:35:45,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:35:45,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 11:35:45,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:35:45,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 11:35:45,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 11:35:45,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-05-12 11:35:45,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 99 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:35:45,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:35:45,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-05-12 11:35:45,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:35:47,266 INFO L124 PetriNetUnfolderBase]: 4500/7409 cut-off events. [2024-05-12 11:35:47,266 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2024-05-12 11:35:47,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13974 conditions, 7409 events. 4500/7409 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 48853 event pairs, 3527 based on Foata normal form. 211/7038 useless extension candidates. Maximal degree in co-relation 13959. Up to 6446 conditions per place. [2024-05-12 11:35:47,304 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 44 selfloop transitions, 5 changer transitions 0/59 dead transitions. [2024-05-12 11:35:47,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 59 transitions, 231 flow [2024-05-12 11:35:47,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 11:35:47,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 11:35:47,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-05-12 11:35:47,314 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2024-05-12 11:35:47,316 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 99 flow. Second operand 3 states and 93 transitions. [2024-05-12 11:35:47,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 59 transitions, 231 flow [2024-05-12 11:35:47,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 59 transitions, 226 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-05-12 11:35:47,323 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 131 flow [2024-05-12 11:35:47,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=131, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2024-05-12 11:35:47,327 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 0 predicate places. [2024-05-12 11:35:47,328 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 131 flow [2024-05-12 11:35:47,328 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:35:47,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:35:47,328 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 11:35:47,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 11:35:47,328 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:35:47,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:35:47,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1764592569, now seen corresponding path program 1 times [2024-05-12 11:35:47,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:35:47,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756305734] [2024-05-12 11:35:47,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:35:47,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:35:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:35:47,416 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:35:47,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:35:47,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756305734] [2024-05-12 11:35:47,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756305734] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:35:47,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:35:47,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 11:35:47,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491740713] [2024-05-12 11:35:47,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:35:47,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 11:35:47,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:35:47,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 11:35:47,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 11:35:47,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 48 [2024-05-12 11:35:47,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 131 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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:35:47,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:35:47,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 48 [2024-05-12 11:35:47,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:35:47,812 INFO L124 PetriNetUnfolderBase]: 950/1801 cut-off events. [2024-05-12 11:35:47,813 INFO L125 PetriNetUnfolderBase]: For 157/157 co-relation queries the response was YES. [2024-05-12 11:35:47,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3505 conditions, 1801 events. 950/1801 cut-off events. For 157/157 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 11898 event pairs, 463 based on Foata normal form. 0/1694 useless extension candidates. Maximal degree in co-relation 3490. Up to 1207 conditions per place. [2024-05-12 11:35:47,821 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 37 selfloop transitions, 3 changer transitions 0/62 dead transitions. [2024-05-12 11:35:47,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 62 transitions, 238 flow [2024-05-12 11:35:47,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 11:35:47,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 11:35:47,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2024-05-12 11:35:47,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7569444444444444 [2024-05-12 11:35:47,823 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 131 flow. Second operand 3 states and 109 transitions. [2024-05-12 11:35:47,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 62 transitions, 238 flow [2024-05-12 11:35:47,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 62 transitions, 234 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 11:35:47,825 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 124 flow [2024-05-12 11:35:47,825 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2024-05-12 11:35:47,826 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 0 predicate places. [2024-05-12 11:35:47,826 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 124 flow [2024-05-12 11:35:47,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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:35:47,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:35:47,826 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:35:47,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 11:35:47,827 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:35:47,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:35:47,827 INFO L85 PathProgramCache]: Analyzing trace with hash 738573940, now seen corresponding path program 1 times [2024-05-12 11:35:47,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:35:47,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025039912] [2024-05-12 11:35:47,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:35:47,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:35:47,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:35:52,063 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:35:52,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:35:52,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025039912] [2024-05-12 11:35:52,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025039912] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:35:52,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:35:52,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 11:35:52,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573003342] [2024-05-12 11:35:52,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:35:52,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 11:35:52,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:35:52,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 11:35:52,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 11:35:52,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-05-12 11:35:52,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 124 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:35:52,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:35:52,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-05-12 11:35:52,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:35:53,383 INFO L124 PetriNetUnfolderBase]: 3821/6192 cut-off events. [2024-05-12 11:35:53,384 INFO L125 PetriNetUnfolderBase]: For 1374/1374 co-relation queries the response was YES. [2024-05-12 11:35:53,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13119 conditions, 6192 events. 3821/6192 cut-off events. For 1374/1374 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 38460 event pairs, 2471 based on Foata normal form. 3/5975 useless extension candidates. Maximal degree in co-relation 13103. Up to 5470 conditions per place. [2024-05-12 11:35:53,411 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 52 selfloop transitions, 8 changer transitions 2/72 dead transitions. [2024-05-12 11:35:53,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 72 transitions, 320 flow [2024-05-12 11:35:53,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 11:35:53,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 11:35:53,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2024-05-12 11:35:53,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.59375 [2024-05-12 11:35:53,413 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 124 flow. Second operand 4 states and 114 transitions. [2024-05-12 11:35:53,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 72 transitions, 320 flow [2024-05-12 11:35:53,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 72 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 11:35:53,415 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 185 flow [2024-05-12 11:35:53,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=185, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2024-05-12 11:35:53,416 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places. [2024-05-12 11:35:53,416 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 185 flow [2024-05-12 11:35:53,416 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:35:53,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:35:53,416 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:35:53,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 11:35:53,417 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:35:53,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:35:53,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1420956647, now seen corresponding path program 1 times [2024-05-12 11:35:53,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:35:53,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044723831] [2024-05-12 11:35:53,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:35:53,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:35:53,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:35:57,146 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:35:57,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:35:57,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044723831] [2024-05-12 11:35:57,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044723831] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:35:57,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:35:57,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 11:35:57,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118165310] [2024-05-12 11:35:57,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:35:57,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 11:35:57,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:35:57,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 11:35:57,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-12 11:35:57,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-05-12 11:35:57,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 185 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:35:57,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:35:57,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-05-12 11:35:57,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:35:58,428 INFO L124 PetriNetUnfolderBase]: 3310/5510 cut-off events. [2024-05-12 11:35:58,428 INFO L125 PetriNetUnfolderBase]: For 2310/2310 co-relation queries the response was YES. [2024-05-12 11:35:58,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12577 conditions, 5510 events. 3310/5510 cut-off events. For 2310/2310 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 34686 event pairs, 1621 based on Foata normal form. 5/5329 useless extension candidates. Maximal degree in co-relation 12559. Up to 4663 conditions per place. [2024-05-12 11:35:58,457 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 68 selfloop transitions, 18 changer transitions 0/96 dead transitions. [2024-05-12 11:35:58,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 96 transitions, 499 flow [2024-05-12 11:35:58,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 11:35:58,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 11:35:58,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 146 transitions. [2024-05-12 11:35:58,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6083333333333333 [2024-05-12 11:35:58,461 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 185 flow. Second operand 5 states and 146 transitions. [2024-05-12 11:35:58,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 96 transitions, 499 flow [2024-05-12 11:35:58,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 96 transitions, 488 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-05-12 11:35:58,466 INFO L231 Difference]: Finished difference. Result has 62 places, 64 transitions, 299 flow [2024-05-12 11:35:58,466 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=299, PETRI_PLACES=62, PETRI_TRANSITIONS=64} [2024-05-12 11:35:58,467 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 8 predicate places. [2024-05-12 11:35:58,467 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 64 transitions, 299 flow [2024-05-12 11:35:58,467 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:35:58,468 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:35:58,468 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:35:58,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 11:35:58,468 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:35:58,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:35:58,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1099984115, now seen corresponding path program 1 times [2024-05-12 11:35:58,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:35:58,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83450966] [2024-05-12 11:35:58,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:35:58,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:35:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:36:02,914 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:36:02,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:36:02,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83450966] [2024-05-12 11:36:02,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83450966] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:36:02,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:36:02,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 11:36:02,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520050900] [2024-05-12 11:36:02,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:36:02,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 11:36:02,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:36:02,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 11:36:02,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-12 11:36:03,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-05-12 11:36:03,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 64 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:36:03,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:36:03,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-05-12 11:36:03,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:36:04,188 INFO L124 PetriNetUnfolderBase]: 3332/5130 cut-off events. [2024-05-12 11:36:04,189 INFO L125 PetriNetUnfolderBase]: For 5529/5532 co-relation queries the response was YES. [2024-05-12 11:36:04,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14267 conditions, 5130 events. 3332/5130 cut-off events. For 5529/5532 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 29453 event pairs, 1183 based on Foata normal form. 7/5098 useless extension candidates. Maximal degree in co-relation 14245. Up to 4629 conditions per place. [2024-05-12 11:36:04,220 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 80 selfloop transitions, 33 changer transitions 0/123 dead transitions. [2024-05-12 11:36:04,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 123 transitions, 757 flow [2024-05-12 11:36:04,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:36:04,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:36:04,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 174 transitions. [2024-05-12 11:36:04,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2024-05-12 11:36:04,226 INFO L175 Difference]: Start difference. First operand has 62 places, 64 transitions, 299 flow. Second operand 6 states and 174 transitions. [2024-05-12 11:36:04,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 123 transitions, 757 flow [2024-05-12 11:36:04,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 123 transitions, 749 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-05-12 11:36:04,233 INFO L231 Difference]: Finished difference. Result has 71 places, 79 transitions, 509 flow [2024-05-12 11:36:04,233 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=509, PETRI_PLACES=71, PETRI_TRANSITIONS=79} [2024-05-12 11:36:04,234 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 17 predicate places. [2024-05-12 11:36:04,235 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 79 transitions, 509 flow [2024-05-12 11:36:04,235 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:36:04,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:36:04,235 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:36:04,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-12 11:36:04,235 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:36:04,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:36:04,236 INFO L85 PathProgramCache]: Analyzing trace with hash -260229754, now seen corresponding path program 1 times [2024-05-12 11:36:04,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:36:04,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446101678] [2024-05-12 11:36:04,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:36:04,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:36:04,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:36:09,432 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:36:09,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:36:09,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446101678] [2024-05-12 11:36:09,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446101678] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:36:09,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:36:09,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:36:09,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099409250] [2024-05-12 11:36:09,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:36:09,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:36:09,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:36:09,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:36:09,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:36:09,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-05-12 11:36:09,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 79 transitions, 509 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:36:09,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:36:09,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-05-12 11:36:09,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:36:11,073 INFO L124 PetriNetUnfolderBase]: 3377/5680 cut-off events. [2024-05-12 11:36:11,074 INFO L125 PetriNetUnfolderBase]: For 11558/11564 co-relation queries the response was YES. [2024-05-12 11:36:11,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17376 conditions, 5680 events. 3377/5680 cut-off events. For 11558/11564 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 36141 event pairs, 1406 based on Foata normal form. 14/5511 useless extension candidates. Maximal degree in co-relation 17348. Up to 4647 conditions per place. [2024-05-12 11:36:11,112 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 100 selfloop transitions, 25 changer transitions 0/135 dead transitions. [2024-05-12 11:36:11,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 135 transitions, 977 flow [2024-05-12 11:36:11,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:36:11,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:36:11,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 196 transitions. [2024-05-12 11:36:11,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-05-12 11:36:11,114 INFO L175 Difference]: Start difference. First operand has 71 places, 79 transitions, 509 flow. Second operand 7 states and 196 transitions. [2024-05-12 11:36:11,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 135 transitions, 977 flow [2024-05-12 11:36:11,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 135 transitions, 929 flow, removed 24 selfloop flow, removed 0 redundant places. [2024-05-12 11:36:11,129 INFO L231 Difference]: Finished difference. Result has 78 places, 85 transitions, 590 flow [2024-05-12 11:36:11,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=590, PETRI_PLACES=78, PETRI_TRANSITIONS=85} [2024-05-12 11:36:11,130 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 24 predicate places. [2024-05-12 11:36:11,130 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 85 transitions, 590 flow [2024-05-12 11:36:11,130 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:36:11,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:36:11,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:36:11,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-12 11:36:11,131 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:36:11,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:36:11,131 INFO L85 PathProgramCache]: Analyzing trace with hash -725562558, now seen corresponding path program 1 times [2024-05-12 11:36:11,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:36:11,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209173362] [2024-05-12 11:36:11,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:36:11,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:36:11,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:36:21,260 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:36:21,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:36:21,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209173362] [2024-05-12 11:36:21,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209173362] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:36:21,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:36:21,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 11:36:21,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508134893] [2024-05-12 11:36:21,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:36:21,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 11:36:21,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:36:21,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 11:36:21,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-05-12 11:36:21,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-05-12 11:36:21,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 85 transitions, 590 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:36:21,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:36:21,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-05-12 11:36:21,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:36:23,225 INFO L124 PetriNetUnfolderBase]: 3923/6540 cut-off events. [2024-05-12 11:36:23,226 INFO L125 PetriNetUnfolderBase]: For 14109/14109 co-relation queries the response was YES. [2024-05-12 11:36:23,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19960 conditions, 6540 events. 3923/6540 cut-off events. For 14109/14109 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 41788 event pairs, 1649 based on Foata normal form. 2/6353 useless extension candidates. Maximal degree in co-relation 19928. Up to 5617 conditions per place. [2024-05-12 11:36:23,266 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 79 selfloop transitions, 14 changer transitions 0/102 dead transitions. [2024-05-12 11:36:23,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 102 transitions, 816 flow [2024-05-12 11:36:23,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 11:36:23,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 11:36:23,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2024-05-12 11:36:23,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49583333333333335 [2024-05-12 11:36:23,267 INFO L175 Difference]: Start difference. First operand has 78 places, 85 transitions, 590 flow. Second operand 5 states and 119 transitions. [2024-05-12 11:36:23,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 102 transitions, 816 flow [2024-05-12 11:36:23,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 102 transitions, 753 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-05-12 11:36:23,277 INFO L231 Difference]: Finished difference. Result has 79 places, 85 transitions, 567 flow [2024-05-12 11:36:23,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=567, PETRI_PLACES=79, PETRI_TRANSITIONS=85} [2024-05-12 11:36:23,278 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 25 predicate places. [2024-05-12 11:36:23,278 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 85 transitions, 567 flow [2024-05-12 11:36:23,278 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:36:23,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:36:23,279 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:36:23,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-12 11:36:23,279 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:36:23,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:36:23,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1056378355, now seen corresponding path program 1 times [2024-05-12 11:36:23,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:36:23,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47229596] [2024-05-12 11:36:23,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:36:23,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:36:23,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:36:34,387 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:36:34,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:36:34,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47229596] [2024-05-12 11:36:34,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47229596] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:36:34,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:36:34,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:36:34,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436843125] [2024-05-12 11:36:34,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:36:34,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:36:34,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:36:34,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:36:34,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:36:34,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-05-12 11:36:34,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 85 transitions, 567 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 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:36:34,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:36:34,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-05-12 11:36:34,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:36:36,535 INFO L124 PetriNetUnfolderBase]: 4587/7464 cut-off events. [2024-05-12 11:36:36,536 INFO L125 PetriNetUnfolderBase]: For 17198/17198 co-relation queries the response was YES. [2024-05-12 11:36:36,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22607 conditions, 7464 events. 4587/7464 cut-off events. For 17198/17198 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 46912 event pairs, 1836 based on Foata normal form. 6/7245 useless extension candidates. Maximal degree in co-relation 22573. Up to 6423 conditions per place. [2024-05-12 11:36:36,607 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 102 selfloop transitions, 25 changer transitions 0/135 dead transitions. [2024-05-12 11:36:36,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 135 transitions, 1007 flow [2024-05-12 11:36:36,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:36:36,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:36:36,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 181 transitions. [2024-05-12 11:36:36,609 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4713541666666667 [2024-05-12 11:36:36,609 INFO L175 Difference]: Start difference. First operand has 79 places, 85 transitions, 567 flow. Second operand 8 states and 181 transitions. [2024-05-12 11:36:36,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 135 transitions, 1007 flow [2024-05-12 11:36:36,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 135 transitions, 968 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-05-12 11:36:36,622 INFO L231 Difference]: Finished difference. Result has 85 places, 96 transitions, 678 flow [2024-05-12 11:36:36,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=678, PETRI_PLACES=85, PETRI_TRANSITIONS=96} [2024-05-12 11:36:36,624 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 31 predicate places. [2024-05-12 11:36:36,624 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 96 transitions, 678 flow [2024-05-12 11:36:36,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 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:36:36,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:36:36,624 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:36:36,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-12 11:36:36,625 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:36:36,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:36:36,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1605364830, now seen corresponding path program 1 times [2024-05-12 11:36:36,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:36:36,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393650922] [2024-05-12 11:36:36,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:36:36,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:36:36,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:36:45,330 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:36:45,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:36:45,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393650922] [2024-05-12 11:36:45,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393650922] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:36:45,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:36:45,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:36:45,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467754315] [2024-05-12 11:36:45,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:36:45,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:36:45,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:36:45,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:36:45,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:36:45,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-05-12 11:36:45,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 96 transitions, 678 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:36:45,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:36:45,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-05-12 11:36:45,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:36:47,060 INFO L124 PetriNetUnfolderBase]: 4149/6737 cut-off events. [2024-05-12 11:36:47,060 INFO L125 PetriNetUnfolderBase]: For 21222/21239 co-relation queries the response was YES. [2024-05-12 11:36:47,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22639 conditions, 6737 events. 4149/6737 cut-off events. For 21222/21239 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 41796 event pairs, 1480 based on Foata normal form. 10/6534 useless extension candidates. Maximal degree in co-relation 22603. Up to 5788 conditions per place. [2024-05-12 11:36:47,095 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 96 selfloop transitions, 21 changer transitions 0/129 dead transitions. [2024-05-12 11:36:47,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 129 transitions, 1050 flow [2024-05-12 11:36:47,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:36:47,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:36:47,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2024-05-12 11:36:47,096 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2024-05-12 11:36:47,097 INFO L175 Difference]: Start difference. First operand has 85 places, 96 transitions, 678 flow. Second operand 6 states and 150 transitions. [2024-05-12 11:36:47,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 129 transitions, 1050 flow [2024-05-12 11:36:47,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 129 transitions, 1000 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-05-12 11:36:47,113 INFO L231 Difference]: Finished difference. Result has 87 places, 99 transitions, 714 flow [2024-05-12 11:36:47,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=714, PETRI_PLACES=87, PETRI_TRANSITIONS=99} [2024-05-12 11:36:47,114 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 33 predicate places. [2024-05-12 11:36:47,114 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 99 transitions, 714 flow [2024-05-12 11:36:47,114 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:36:47,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:36:47,115 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:36:47,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-12 11:36:47,115 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:36:47,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:36:47,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1479890086, now seen corresponding path program 2 times [2024-05-12 11:36:47,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:36:47,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381937006] [2024-05-12 11:36:47,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:36:47,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:36:47,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:36:54,806 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:36:54,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:36:54,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381937006] [2024-05-12 11:36:54,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381937006] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:36:54,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:36:54,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:36:54,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115202002] [2024-05-12 11:36:54,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:36:54,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:36:54,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:36:54,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:36:54,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:36:54,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-05-12 11:36:54,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 99 transitions, 714 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:36:54,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:36:54,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-05-12 11:36:54,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:36:56,537 INFO L124 PetriNetUnfolderBase]: 4213/6946 cut-off events. [2024-05-12 11:36:56,537 INFO L125 PetriNetUnfolderBase]: For 21867/21875 co-relation queries the response was YES. [2024-05-12 11:36:56,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22885 conditions, 6946 events. 4213/6946 cut-off events. For 21867/21875 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 44316 event pairs, 1707 based on Foata normal form. 2/6729 useless extension candidates. Maximal degree in co-relation 22848. Up to 5980 conditions per place. [2024-05-12 11:36:56,572 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 97 selfloop transitions, 13 changer transitions 0/122 dead transitions. [2024-05-12 11:36:56,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 122 transitions, 992 flow [2024-05-12 11:36:56,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:36:56,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:36:56,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2024-05-12 11:36:56,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4861111111111111 [2024-05-12 11:36:56,574 INFO L175 Difference]: Start difference. First operand has 87 places, 99 transitions, 714 flow. Second operand 6 states and 140 transitions. [2024-05-12 11:36:56,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 122 transitions, 992 flow [2024-05-12 11:36:56,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 122 transitions, 959 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-05-12 11:36:56,590 INFO L231 Difference]: Finished difference. Result has 90 places, 99 transitions, 715 flow [2024-05-12 11:36:56,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=715, PETRI_PLACES=90, PETRI_TRANSITIONS=99} [2024-05-12 11:36:56,591 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 36 predicate places. [2024-05-12 11:36:56,591 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 99 transitions, 715 flow [2024-05-12 11:36:56,592 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:36:56,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:36:56,592 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:36:56,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-12 11:36:56,592 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:36:56,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:36:56,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1311633093, now seen corresponding path program 1 times [2024-05-12 11:36:56,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:36:56,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478194638] [2024-05-12 11:36:56,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:36:56,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:36:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:37:04,661 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:37:04,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:37:04,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478194638] [2024-05-12 11:37:04,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478194638] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:37:04,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:37:04,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:37:04,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166499601] [2024-05-12 11:37:04,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:37:04,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:37:04,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:37:04,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:37:04,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:37:04,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-05-12 11:37:04,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 99 transitions, 715 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 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:37:04,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:37:04,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-05-12 11:37:04,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:37:06,763 INFO L124 PetriNetUnfolderBase]: 5014/7922 cut-off events. [2024-05-12 11:37:06,763 INFO L125 PetriNetUnfolderBase]: For 28074/28083 co-relation queries the response was YES. [2024-05-12 11:37:06,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26792 conditions, 7922 events. 5014/7922 cut-off events. For 28074/28083 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 48511 event pairs, 1497 based on Foata normal form. 14/7701 useless extension candidates. Maximal degree in co-relation 26754. Up to 6408 conditions per place. [2024-05-12 11:37:06,811 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 128 selfloop transitions, 34 changer transitions 0/170 dead transitions. [2024-05-12 11:37:06,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 170 transitions, 1409 flow [2024-05-12 11:37:06,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:37:06,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:37:06,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 180 transitions. [2024-05-12 11:37:06,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2024-05-12 11:37:06,813 INFO L175 Difference]: Start difference. First operand has 90 places, 99 transitions, 715 flow. Second operand 7 states and 180 transitions. [2024-05-12 11:37:06,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 170 transitions, 1409 flow [2024-05-12 11:37:06,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 170 transitions, 1353 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-05-12 11:37:06,838 INFO L231 Difference]: Finished difference. Result has 94 places, 121 transitions, 942 flow [2024-05-12 11:37:06,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=659, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=942, PETRI_PLACES=94, PETRI_TRANSITIONS=121} [2024-05-12 11:37:06,838 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 40 predicate places. [2024-05-12 11:37:06,839 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 121 transitions, 942 flow [2024-05-12 11:37:06,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 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:37:06,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:37:06,839 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:37:06,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-12 11:37:06,839 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:37:06,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:37:06,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1336774363, now seen corresponding path program 2 times [2024-05-12 11:37:06,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:37:06,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574003887] [2024-05-12 11:37:06,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:37:06,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:37:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:37:14,770 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:37:14,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:37:14,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574003887] [2024-05-12 11:37:14,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574003887] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:37:14,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:37:14,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:37:14,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412560606] [2024-05-12 11:37:14,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:37:14,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:37:14,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:37:14,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:37:14,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:37:14,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-05-12 11:37:14,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 121 transitions, 942 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 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:37:14,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:37:14,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-05-12 11:37:14,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:37:16,942 INFO L124 PetriNetUnfolderBase]: 5098/8241 cut-off events. [2024-05-12 11:37:16,942 INFO L125 PetriNetUnfolderBase]: For 39983/39983 co-relation queries the response was YES. [2024-05-12 11:37:16,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31675 conditions, 8241 events. 5098/8241 cut-off events. For 39983/39983 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 52196 event pairs, 1829 based on Foata normal form. 6/8003 useless extension candidates. Maximal degree in co-relation 31634. Up to 7143 conditions per place. [2024-05-12 11:37:16,998 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 129 selfloop transitions, 26 changer transitions 0/163 dead transitions. [2024-05-12 11:37:16,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 163 transitions, 1465 flow [2024-05-12 11:37:16,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:37:16,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:37:17,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 164 transitions. [2024-05-12 11:37:17,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2024-05-12 11:37:17,001 INFO L175 Difference]: Start difference. First operand has 94 places, 121 transitions, 942 flow. Second operand 7 states and 164 transitions. [2024-05-12 11:37:17,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 163 transitions, 1465 flow [2024-05-12 11:37:17,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 163 transitions, 1427 flow, removed 18 selfloop flow, removed 1 redundant places. [2024-05-12 11:37:17,056 INFO L231 Difference]: Finished difference. Result has 103 places, 131 transitions, 1096 flow [2024-05-12 11:37:17,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=908, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1096, PETRI_PLACES=103, PETRI_TRANSITIONS=131} [2024-05-12 11:37:17,057 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 49 predicate places. [2024-05-12 11:37:17,057 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 131 transitions, 1096 flow [2024-05-12 11:37:17,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 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:37:17,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:37:17,058 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:37:17,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-05-12 11:37:17,058 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:37:17,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:37:17,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1567566129, now seen corresponding path program 3 times [2024-05-12 11:37:17,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:37:17,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085573780] [2024-05-12 11:37:17,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:37:17,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:37:17,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:37:26,323 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:37:26,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:37:26,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085573780] [2024-05-12 11:37:26,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085573780] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:37:26,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:37:26,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:37:26,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212999983] [2024-05-12 11:37:26,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:37:26,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:37:26,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:37:26,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:37:26,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:37:26,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-05-12 11:37:26,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 131 transitions, 1096 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 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:37:26,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:37:26,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-05-12 11:37:26,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:37:28,707 INFO L124 PetriNetUnfolderBase]: 5126/8271 cut-off events. [2024-05-12 11:37:28,707 INFO L125 PetriNetUnfolderBase]: For 44703/44703 co-relation queries the response was YES. [2024-05-12 11:37:28,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32608 conditions, 8271 events. 5126/8271 cut-off events. For 44703/44703 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 52267 event pairs, 1831 based on Foata normal form. 6/8035 useless extension candidates. Maximal degree in co-relation 32561. Up to 7043 conditions per place. [2024-05-12 11:37:28,768 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 135 selfloop transitions, 32 changer transitions 0/175 dead transitions. [2024-05-12 11:37:28,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 175 transitions, 1672 flow [2024-05-12 11:37:28,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:37:28,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:37:28,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions. [2024-05-12 11:37:28,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-05-12 11:37:28,770 INFO L175 Difference]: Start difference. First operand has 103 places, 131 transitions, 1096 flow. Second operand 7 states and 168 transitions. [2024-05-12 11:37:28,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 175 transitions, 1672 flow [2024-05-12 11:37:28,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 175 transitions, 1607 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-05-12 11:37:28,809 INFO L231 Difference]: Finished difference. Result has 108 places, 139 transitions, 1206 flow [2024-05-12 11:37:28,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1031, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1206, PETRI_PLACES=108, PETRI_TRANSITIONS=139} [2024-05-12 11:37:28,809 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 54 predicate places. [2024-05-12 11:37:28,810 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 139 transitions, 1206 flow [2024-05-12 11:37:28,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 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:37:28,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:37:28,810 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:37:28,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-05-12 11:37:28,810 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:37:28,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:37:28,811 INFO L85 PathProgramCache]: Analyzing trace with hash 145701632, now seen corresponding path program 1 times [2024-05-12 11:37:28,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:37:28,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470962682] [2024-05-12 11:37:28,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:37:28,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:37:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:37:39,253 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:37:39,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:37:39,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470962682] [2024-05-12 11:37:39,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470962682] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:37:39,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:37:39,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:37:39,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956950100] [2024-05-12 11:37:39,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:37:39,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:37:39,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:37:39,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:37:39,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:37:39,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-05-12 11:37:39,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 139 transitions, 1206 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:37:39,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:37:39,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-05-12 11:37:39,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:37:41,875 INFO L124 PetriNetUnfolderBase]: 5149/8343 cut-off events. [2024-05-12 11:37:41,875 INFO L125 PetriNetUnfolderBase]: For 52064/52064 co-relation queries the response was YES. [2024-05-12 11:37:41,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33931 conditions, 8343 events. 5149/8343 cut-off events. For 52064/52064 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 53144 event pairs, 1767 based on Foata normal form. 6/8095 useless extension candidates. Maximal degree in co-relation 33882. Up to 7134 conditions per place. [2024-05-12 11:37:41,930 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 140 selfloop transitions, 33 changer transitions 0/181 dead transitions. [2024-05-12 11:37:41,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 181 transitions, 1742 flow [2024-05-12 11:37:41,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:37:41,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:37:41,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions. [2024-05-12 11:37:41,931 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-05-12 11:37:41,931 INFO L175 Difference]: Start difference. First operand has 108 places, 139 transitions, 1206 flow. Second operand 7 states and 168 transitions. [2024-05-12 11:37:41,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 181 transitions, 1742 flow [2024-05-12 11:37:41,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 181 transitions, 1686 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-05-12 11:37:41,975 INFO L231 Difference]: Finished difference. Result has 112 places, 142 transitions, 1262 flow [2024-05-12 11:37:41,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1150, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1262, PETRI_PLACES=112, PETRI_TRANSITIONS=142} [2024-05-12 11:37:41,976 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 58 predicate places. [2024-05-12 11:37:41,976 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 142 transitions, 1262 flow [2024-05-12 11:37:41,976 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:37:41,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:37:41,976 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:37:41,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-05-12 11:37:41,977 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:37:41,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:37:41,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1896864638, now seen corresponding path program 1 times [2024-05-12 11:37:41,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:37:41,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273664080] [2024-05-12 11:37:41,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:37:41,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:37:42,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:37:53,616 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:37:53,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:37:53,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273664080] [2024-05-12 11:37:53,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273664080] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:37:53,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:37:53,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 11:37:53,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765505291] [2024-05-12 11:37:53,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:37:53,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 11:37:53,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:37:53,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 11:37:53,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-05-12 11:37:53,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-05-12 11:37:53,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 142 transitions, 1262 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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:37:53,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:37:53,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-05-12 11:37:53,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:37:55,698 INFO L124 PetriNetUnfolderBase]: 5146/8321 cut-off events. [2024-05-12 11:37:55,698 INFO L125 PetriNetUnfolderBase]: For 55612/55612 co-relation queries the response was YES. [2024-05-12 11:37:55,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34710 conditions, 8321 events. 5146/8321 cut-off events. For 55612/55612 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 52750 event pairs, 1835 based on Foata normal form. 1/8074 useless extension candidates. Maximal degree in co-relation 34659. Up to 7314 conditions per place. [2024-05-12 11:37:55,752 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 134 selfloop transitions, 14 changer transitions 0/156 dead transitions. [2024-05-12 11:37:55,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 156 transitions, 1590 flow [2024-05-12 11:37:55,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 11:37:55,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 11:37:55,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2024-05-12 11:37:55,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4625 [2024-05-12 11:37:55,754 INFO L175 Difference]: Start difference. First operand has 112 places, 142 transitions, 1262 flow. Second operand 5 states and 111 transitions. [2024-05-12 11:37:55,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 156 transitions, 1590 flow [2024-05-12 11:37:55,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 156 transitions, 1480 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-05-12 11:37:55,797 INFO L231 Difference]: Finished difference. Result has 112 places, 142 transitions, 1190 flow [2024-05-12 11:37:55,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1152, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1190, PETRI_PLACES=112, PETRI_TRANSITIONS=142} [2024-05-12 11:37:55,797 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 58 predicate places. [2024-05-12 11:37:55,797 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 142 transitions, 1190 flow [2024-05-12 11:37:55,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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:37:55,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:37:55,798 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:37:55,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-05-12 11:37:55,798 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:37:55,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:37:55,798 INFO L85 PathProgramCache]: Analyzing trace with hash 2002105831, now seen corresponding path program 1 times [2024-05-12 11:37:55,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:37:55,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390055711] [2024-05-12 11:37:55,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:37:55,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:37:55,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:38:05,578 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:38:05,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:38:05,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390055711] [2024-05-12 11:38:05,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390055711] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:38:05,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:38:05,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:38:05,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23029687] [2024-05-12 11:38:05,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:38:05,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:38:05,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:38:05,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:38:05,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:38:05,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-05-12 11:38:05,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 142 transitions, 1190 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:38:05,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:38:05,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-05-12 11:38:05,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:38:07,814 INFO L124 PetriNetUnfolderBase]: 4744/7184 cut-off events. [2024-05-12 11:38:07,815 INFO L125 PetriNetUnfolderBase]: For 55532/55583 co-relation queries the response was YES. [2024-05-12 11:38:07,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32040 conditions, 7184 events. 4744/7184 cut-off events. For 55532/55583 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 41317 event pairs, 1199 based on Foata normal form. 15/7113 useless extension candidates. Maximal degree in co-relation 31988. Up to 6356 conditions per place. [2024-05-12 11:38:07,859 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 128 selfloop transitions, 41 changer transitions 0/191 dead transitions. [2024-05-12 11:38:07,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 191 transitions, 1788 flow [2024-05-12 11:38:07,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:38:07,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:38:07,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 177 transitions. [2024-05-12 11:38:07,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5267857142857143 [2024-05-12 11:38:07,861 INFO L175 Difference]: Start difference. First operand has 112 places, 142 transitions, 1190 flow. Second operand 7 states and 177 transitions. [2024-05-12 11:38:07,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 191 transitions, 1788 flow [2024-05-12 11:38:07,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 191 transitions, 1760 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-05-12 11:38:07,906 INFO L231 Difference]: Finished difference. Result has 115 places, 148 transitions, 1331 flow [2024-05-12 11:38:07,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1162, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1331, PETRI_PLACES=115, PETRI_TRANSITIONS=148} [2024-05-12 11:38:07,907 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 61 predicate places. [2024-05-12 11:38:07,909 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 148 transitions, 1331 flow [2024-05-12 11:38:07,909 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:38:07,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:38:07,909 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:38:07,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-05-12 11:38:07,913 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:38:07,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:38:07,913 INFO L85 PathProgramCache]: Analyzing trace with hash 858643391, now seen corresponding path program 2 times [2024-05-12 11:38:07,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:38:07,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414976344] [2024-05-12 11:38:07,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:38:07,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:38:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:38:16,916 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:38:16,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:38:16,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414976344] [2024-05-12 11:38:16,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414976344] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:38:16,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:38:16,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:38:16,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197286036] [2024-05-12 11:38:16,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:38:16,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:38:16,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:38:16,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:38:16,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:38:17,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-05-12 11:38:17,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 148 transitions, 1331 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:38:17,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:38:17,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-05-12 11:38:17,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:38:18,948 INFO L124 PetriNetUnfolderBase]: 4740/7180 cut-off events. [2024-05-12 11:38:18,948 INFO L125 PetriNetUnfolderBase]: For 62059/62110 co-relation queries the response was YES. [2024-05-12 11:38:18,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33174 conditions, 7180 events. 4740/7180 cut-off events. For 62059/62110 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 41340 event pairs, 1199 based on Foata normal form. 15/7109 useless extension candidates. Maximal degree in co-relation 33121. Up to 6420 conditions per place. [2024-05-12 11:38:18,993 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 129 selfloop transitions, 38 changer transitions 0/189 dead transitions. [2024-05-12 11:38:18,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 189 transitions, 1819 flow [2024-05-12 11:38:18,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:38:18,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:38:18,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 172 transitions. [2024-05-12 11:38:18,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5119047619047619 [2024-05-12 11:38:18,996 INFO L175 Difference]: Start difference. First operand has 115 places, 148 transitions, 1331 flow. Second operand 7 states and 172 transitions. [2024-05-12 11:38:18,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 189 transitions, 1819 flow [2024-05-12 11:38:19,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 189 transitions, 1731 flow, removed 27 selfloop flow, removed 3 redundant places. [2024-05-12 11:38:19,058 INFO L231 Difference]: Finished difference. Result has 121 places, 152 transitions, 1415 flow [2024-05-12 11:38:19,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1245, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1415, PETRI_PLACES=121, PETRI_TRANSITIONS=152} [2024-05-12 11:38:19,058 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 67 predicate places. [2024-05-12 11:38:19,059 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 152 transitions, 1415 flow [2024-05-12 11:38:19,059 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:38:19,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:38:19,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:38:19,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-05-12 11:38:19,059 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:38:19,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:38:19,060 INFO L85 PathProgramCache]: Analyzing trace with hash 2005920846, now seen corresponding path program 1 times [2024-05-12 11:38:19,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:38:19,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815909691] [2024-05-12 11:38:19,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:38:19,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:38:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:38:27,615 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:38:27,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:38:27,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815909691] [2024-05-12 11:38:27,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815909691] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:38:27,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:38:27,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:38:27,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601804747] [2024-05-12 11:38:27,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:38:27,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:38:27,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:38:27,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:38:27,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:38:27,734 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-05-12 11:38:27,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 152 transitions, 1415 flow. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 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:38:27,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:38:27,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-05-12 11:38:27,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:38:29,848 INFO L124 PetriNetUnfolderBase]: 5349/8436 cut-off events. [2024-05-12 11:38:29,849 INFO L125 PetriNetUnfolderBase]: For 73856/73868 co-relation queries the response was YES. [2024-05-12 11:38:29,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37886 conditions, 8436 events. 5349/8436 cut-off events. For 73856/73868 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 52089 event pairs, 1488 based on Foata normal form. 9/8197 useless extension candidates. Maximal degree in co-relation 37829. Up to 6651 conditions per place. [2024-05-12 11:38:29,909 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 147 selfloop transitions, 52 changer transitions 0/207 dead transitions. [2024-05-12 11:38:29,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 207 transitions, 2237 flow [2024-05-12 11:38:29,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:38:29,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:38:29,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 179 transitions. [2024-05-12 11:38:29,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5327380952380952 [2024-05-12 11:38:29,912 INFO L175 Difference]: Start difference. First operand has 121 places, 152 transitions, 1415 flow. Second operand 7 states and 179 transitions. [2024-05-12 11:38:29,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 207 transitions, 2237 flow [2024-05-12 11:38:29,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 207 transitions, 2162 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-05-12 11:38:29,970 INFO L231 Difference]: Finished difference. Result has 126 places, 161 transitions, 1614 flow [2024-05-12 11:38:29,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1340, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1614, PETRI_PLACES=126, PETRI_TRANSITIONS=161} [2024-05-12 11:38:29,971 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 72 predicate places. [2024-05-12 11:38:29,971 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 161 transitions, 1614 flow [2024-05-12 11:38:29,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 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:38:29,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:38:29,972 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:38:29,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-05-12 11:38:29,972 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:38:29,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:38:29,972 INFO L85 PathProgramCache]: Analyzing trace with hash 2005915266, now seen corresponding path program 2 times [2024-05-12 11:38:29,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:38:29,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873674101] [2024-05-12 11:38:29,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:38:29,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:38:30,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:38:38,957 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:38:38,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:38:38,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873674101] [2024-05-12 11:38:38,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873674101] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:38:38,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:38:38,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:38:38,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124920146] [2024-05-12 11:38:38,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:38:38,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:38:38,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:38:38,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:38:38,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:38:39,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-05-12 11:38:39,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 161 transitions, 1614 flow. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 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:38:39,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:38:39,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-05-12 11:38:39,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:38:41,317 INFO L124 PetriNetUnfolderBase]: 5337/8440 cut-off events. [2024-05-12 11:38:41,317 INFO L125 PetriNetUnfolderBase]: For 84060/84072 co-relation queries the response was YES. [2024-05-12 11:38:41,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39835 conditions, 8440 events. 5337/8440 cut-off events. For 84060/84072 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 52175 event pairs, 1493 based on Foata normal form. 9/8195 useless extension candidates. Maximal degree in co-relation 39775. Up to 6645 conditions per place. [2024-05-12 11:38:41,488 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 148 selfloop transitions, 55 changer transitions 0/211 dead transitions. [2024-05-12 11:38:41,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 211 transitions, 2354 flow [2024-05-12 11:38:41,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:38:41,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:38:41,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 182 transitions. [2024-05-12 11:38:41,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-05-12 11:38:41,490 INFO L175 Difference]: Start difference. First operand has 126 places, 161 transitions, 1614 flow. Second operand 7 states and 182 transitions. [2024-05-12 11:38:41,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 211 transitions, 2354 flow [2024-05-12 11:38:41,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 211 transitions, 2245 flow, removed 28 selfloop flow, removed 3 redundant places. [2024-05-12 11:38:41,584 INFO L231 Difference]: Finished difference. Result has 132 places, 164 transitions, 1724 flow [2024-05-12 11:38:41,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1506, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1724, PETRI_PLACES=132, PETRI_TRANSITIONS=164} [2024-05-12 11:38:41,585 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 78 predicate places. [2024-05-12 11:38:41,585 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 164 transitions, 1724 flow [2024-05-12 11:38:41,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 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:38:41,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:38:41,585 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:38:41,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-05-12 11:38:41,586 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:38:41,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:38:41,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1501623510, now seen corresponding path program 3 times [2024-05-12 11:38:41,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:38:41,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129956060] [2024-05-12 11:38:41,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:38:41,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:38:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:38:49,828 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:38:49,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:38:49,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129956060] [2024-05-12 11:38:49,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129956060] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:38:49,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:38:49,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:38:49,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253396331] [2024-05-12 11:38:49,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:38:49,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:38:49,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:38:49,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:38:49,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:38:49,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-05-12 11:38:49,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 164 transitions, 1724 flow. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 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:38:49,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:38:49,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-05-12 11:38:49,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:38:52,328 INFO L124 PetriNetUnfolderBase]: 5365/8274 cut-off events. [2024-05-12 11:38:52,329 INFO L125 PetriNetUnfolderBase]: For 90683/90695 co-relation queries the response was YES. [2024-05-12 11:38:52,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40727 conditions, 8274 events. 5365/8274 cut-off events. For 90683/90695 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 49966 event pairs, 1820 based on Foata normal form. 14/8128 useless extension candidates. Maximal degree in co-relation 40664. Up to 7440 conditions per place. [2024-05-12 11:38:52,384 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 166 selfloop transitions, 28 changer transitions 0/202 dead transitions. [2024-05-12 11:38:52,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 202 transitions, 2308 flow [2024-05-12 11:38:52,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:38:52,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:38:52,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2024-05-12 11:38:52,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49404761904761907 [2024-05-12 11:38:52,386 INFO L175 Difference]: Start difference. First operand has 132 places, 164 transitions, 1724 flow. Second operand 7 states and 166 transitions. [2024-05-12 11:38:52,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 202 transitions, 2308 flow [2024-05-12 11:38:52,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 202 transitions, 2200 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-05-12 11:38:52,470 INFO L231 Difference]: Finished difference. Result has 134 places, 168 transitions, 1755 flow [2024-05-12 11:38:52,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1623, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1755, PETRI_PLACES=134, PETRI_TRANSITIONS=168} [2024-05-12 11:38:52,471 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 80 predicate places. [2024-05-12 11:38:52,471 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 168 transitions, 1755 flow [2024-05-12 11:38:52,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 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:38:52,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:38:52,471 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:38:52,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-05-12 11:38:52,472 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:38:52,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:38:52,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1501327553, now seen corresponding path program 1 times [2024-05-12 11:38:52,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:38:52,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572698923] [2024-05-12 11:38:52,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:38:52,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:38:52,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:39:00,406 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:39:00,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:39:00,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572698923] [2024-05-12 11:39:00,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572698923] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:39:00,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:39:00,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:39:00,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914119324] [2024-05-12 11:39:00,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:39:00,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:39:00,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:39:00,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:39:00,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:39:00,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-05-12 11:39:00,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 168 transitions, 1755 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:39:00,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:39:00,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-05-12 11:39:00,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:39:02,975 INFO L124 PetriNetUnfolderBase]: 5384/8336 cut-off events. [2024-05-12 11:39:02,975 INFO L125 PetriNetUnfolderBase]: For 95921/95921 co-relation queries the response was YES. [2024-05-12 11:39:03,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40757 conditions, 8336 events. 5384/8336 cut-off events. For 95921/95921 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 50681 event pairs, 1786 based on Foata normal form. 3/8170 useless extension candidates. Maximal degree in co-relation 40694. Up to 7481 conditions per place. [2024-05-12 11:39:03,040 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 167 selfloop transitions, 37 changer transitions 0/212 dead transitions. [2024-05-12 11:39:03,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 212 transitions, 2409 flow [2024-05-12 11:39:03,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:39:03,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:39:03,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 165 transitions. [2024-05-12 11:39:03,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49107142857142855 [2024-05-12 11:39:03,042 INFO L175 Difference]: Start difference. First operand has 134 places, 168 transitions, 1755 flow. Second operand 7 states and 165 transitions. [2024-05-12 11:39:03,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 212 transitions, 2409 flow [2024-05-12 11:39:03,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 212 transitions, 2328 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-05-12 11:39:03,129 INFO L231 Difference]: Finished difference. Result has 138 places, 181 transitions, 1942 flow [2024-05-12 11:39:03,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1674, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1942, PETRI_PLACES=138, PETRI_TRANSITIONS=181} [2024-05-12 11:39:03,130 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 84 predicate places. [2024-05-12 11:39:03,130 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 181 transitions, 1942 flow [2024-05-12 11:39:03,131 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:39:03,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:39:03,131 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:39:03,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-05-12 11:39:03,131 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:39:03,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:39:03,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1326739875, now seen corresponding path program 1 times [2024-05-12 11:39:03,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:39:03,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253300006] [2024-05-12 11:39:03,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:39:03,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:39:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:39:16,572 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:39:16,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:39:16,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253300006] [2024-05-12 11:39:16,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253300006] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:39:16,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:39:16,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:39:16,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612403554] [2024-05-12 11:39:16,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:39:16,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:39:16,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:39:16,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:39:16,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:39:16,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-05-12 11:39:16,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 181 transitions, 1942 flow. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 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:39:16,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:39:16,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-05-12 11:39:16,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:39:18,887 INFO L124 PetriNetUnfolderBase]: 5375/8189 cut-off events. [2024-05-12 11:39:18,888 INFO L125 PetriNetUnfolderBase]: For 104773/104773 co-relation queries the response was YES. [2024-05-12 11:39:18,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42339 conditions, 8189 events. 5375/8189 cut-off events. For 104773/104773 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 48342 event pairs, 1805 based on Foata normal form. 3/8056 useless extension candidates. Maximal degree in co-relation 42273. Up to 7597 conditions per place. [2024-05-12 11:39:18,948 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 180 selfloop transitions, 17 changer transitions 0/205 dead transitions. [2024-05-12 11:39:18,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 205 transitions, 2424 flow [2024-05-12 11:39:18,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:39:18,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:39:18,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2024-05-12 11:39:18,954 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-05-12 11:39:18,954 INFO L175 Difference]: Start difference. First operand has 138 places, 181 transitions, 1942 flow. Second operand 6 states and 132 transitions. [2024-05-12 11:39:18,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 205 transitions, 2424 flow [2024-05-12 11:39:19,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 205 transitions, 2338 flow, removed 24 selfloop flow, removed 3 redundant places. [2024-05-12 11:39:19,046 INFO L231 Difference]: Finished difference. Result has 141 places, 184 transitions, 1935 flow [2024-05-12 11:39:19,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1856, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1935, PETRI_PLACES=141, PETRI_TRANSITIONS=184} [2024-05-12 11:39:19,046 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 87 predicate places. [2024-05-12 11:39:19,047 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 184 transitions, 1935 flow [2024-05-12 11:39:19,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 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:39:19,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:39:19,047 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:39:19,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-05-12 11:39:19,047 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:39:19,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:39:19,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1938417706, now seen corresponding path program 1 times [2024-05-12 11:39:19,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:39:19,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112284671] [2024-05-12 11:39:19,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:39:19,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:39:19,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:39:30,349 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:39:30,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:39:30,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112284671] [2024-05-12 11:39:30,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112284671] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:39:30,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:39:30,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:39:30,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959952688] [2024-05-12 11:39:30,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:39:30,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:39:30,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:39:30,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:39:30,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:39:30,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-05-12 11:39:30,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 184 transitions, 1935 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:39:30,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:39:30,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-05-12 11:39:30,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:39:32,788 INFO L124 PetriNetUnfolderBase]: 4979/7542 cut-off events. [2024-05-12 11:39:32,788 INFO L125 PetriNetUnfolderBase]: For 107613/107683 co-relation queries the response was YES. [2024-05-12 11:39:32,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40781 conditions, 7542 events. 4979/7542 cut-off events. For 107613/107683 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 43757 event pairs, 868 based on Foata normal form. 21/7470 useless extension candidates. Maximal degree in co-relation 40714. Up to 6472 conditions per place. [2024-05-12 11:39:32,842 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 163 selfloop transitions, 49 changer transitions 0/241 dead transitions. [2024-05-12 11:39:32,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 241 transitions, 2709 flow [2024-05-12 11:39:32,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:39:32,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:39:32,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 201 transitions. [2024-05-12 11:39:32,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5234375 [2024-05-12 11:39:32,844 INFO L175 Difference]: Start difference. First operand has 141 places, 184 transitions, 1935 flow. Second operand 8 states and 201 transitions. [2024-05-12 11:39:32,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 241 transitions, 2709 flow [2024-05-12 11:39:32,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 241 transitions, 2654 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-05-12 11:39:32,936 INFO L231 Difference]: Finished difference. Result has 146 places, 189 transitions, 2112 flow [2024-05-12 11:39:32,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1880, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2112, PETRI_PLACES=146, PETRI_TRANSITIONS=189} [2024-05-12 11:39:32,937 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 92 predicate places. [2024-05-12 11:39:32,937 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 189 transitions, 2112 flow [2024-05-12 11:39:32,937 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:39:32,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:39:32,937 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:39:32,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-05-12 11:39:32,938 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:39:32,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:39:32,938 INFO L85 PathProgramCache]: Analyzing trace with hash -560837764, now seen corresponding path program 2 times [2024-05-12 11:39:32,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:39:32,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664007579] [2024-05-12 11:39:32,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:39:32,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:39:32,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:39:43,082 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:39:43,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:39:43,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664007579] [2024-05-12 11:39:43,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664007579] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:39:43,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:39:43,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:39:43,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807126321] [2024-05-12 11:39:43,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:39:43,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:39:43,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:39:43,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:39:43,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:39:43,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-05-12 11:39:43,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 189 transitions, 2112 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:39:43,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:39:43,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-05-12 11:39:43,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:39:45,515 INFO L124 PetriNetUnfolderBase]: 5043/7872 cut-off events. [2024-05-12 11:39:45,516 INFO L125 PetriNetUnfolderBase]: For 120142/120221 co-relation queries the response was YES. [2024-05-12 11:39:45,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42665 conditions, 7872 events. 5043/7872 cut-off events. For 120142/120221 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 48213 event pairs, 1323 based on Foata normal form. 25/7722 useless extension candidates. Maximal degree in co-relation 42596. Up to 6762 conditions per place. [2024-05-12 11:39:45,578 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 186 selfloop transitions, 30 changer transitions 0/245 dead transitions. [2024-05-12 11:39:45,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 245 transitions, 2790 flow [2024-05-12 11:39:45,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:39:45,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:39:45,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions. [2024-05-12 11:39:45,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5130208333333334 [2024-05-12 11:39:45,581 INFO L175 Difference]: Start difference. First operand has 146 places, 189 transitions, 2112 flow. Second operand 8 states and 197 transitions. [2024-05-12 11:39:45,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 245 transitions, 2790 flow [2024-05-12 11:39:45,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 245 transitions, 2654 flow, removed 40 selfloop flow, removed 4 redundant places. [2024-05-12 11:39:45,695 INFO L231 Difference]: Finished difference. Result has 152 places, 197 transitions, 2166 flow [2024-05-12 11:39:45,695 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1998, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2166, PETRI_PLACES=152, PETRI_TRANSITIONS=197} [2024-05-12 11:39:45,696 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 98 predicate places. [2024-05-12 11:39:45,696 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 197 transitions, 2166 flow [2024-05-12 11:39:45,696 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:39:45,696 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:39:45,696 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:39:45,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-05-12 11:39:45,697 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:39:45,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:39:45,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1935739430, now seen corresponding path program 1 times [2024-05-12 11:39:45,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:39:45,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723090311] [2024-05-12 11:39:45,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:39:45,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:39:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:39:54,815 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:39:54,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:39:54,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723090311] [2024-05-12 11:39:54,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723090311] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:39:54,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:39:54,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:39:54,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825430549] [2024-05-12 11:39:54,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:39:54,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:39:54,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:39:54,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:39:54,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:39:54,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-05-12 11:39:54,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 197 transitions, 2166 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:39:54,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:39:54,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-05-12 11:39:54,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:39:57,400 INFO L124 PetriNetUnfolderBase]: 5603/8358 cut-off events. [2024-05-12 11:39:57,400 INFO L125 PetriNetUnfolderBase]: For 130682/130697 co-relation queries the response was YES. [2024-05-12 11:39:57,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45953 conditions, 8358 events. 5603/8358 cut-off events. For 130682/130697 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 48169 event pairs, 1129 based on Foata normal form. 10/8271 useless extension candidates. Maximal degree in co-relation 45880. Up to 6218 conditions per place. [2024-05-12 11:39:57,472 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 187 selfloop transitions, 82 changer transitions 0/277 dead transitions. [2024-05-12 11:39:57,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 277 transitions, 3462 flow [2024-05-12 11:39:57,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:39:57,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:39:57,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 211 transitions. [2024-05-12 11:39:57,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5494791666666666 [2024-05-12 11:39:57,474 INFO L175 Difference]: Start difference. First operand has 152 places, 197 transitions, 2166 flow. Second operand 8 states and 211 transitions. [2024-05-12 11:39:57,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 277 transitions, 3462 flow [2024-05-12 11:39:57,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 277 transitions, 3394 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-05-12 11:39:57,611 INFO L231 Difference]: Finished difference. Result has 159 places, 212 transitions, 2534 flow [2024-05-12 11:39:57,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2098, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2534, PETRI_PLACES=159, PETRI_TRANSITIONS=212} [2024-05-12 11:39:57,612 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 105 predicate places. [2024-05-12 11:39:57,612 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 212 transitions, 2534 flow [2024-05-12 11:39:57,612 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:39:57,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:39:57,613 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:39:57,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-05-12 11:39:57,613 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:39:57,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:39:57,613 INFO L85 PathProgramCache]: Analyzing trace with hash 2049363110, now seen corresponding path program 2 times [2024-05-12 11:39:57,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:39:57,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089703309] [2024-05-12 11:39:57,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:39:57,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:39:57,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:40:08,246 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:40:08,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:40:08,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089703309] [2024-05-12 11:40:08,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089703309] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:40:08,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:40:08,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:40:08,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260347378] [2024-05-12 11:40:08,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:40:08,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:40:08,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:40:08,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:40:08,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:40:08,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-05-12 11:40:08,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 212 transitions, 2534 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:40:08,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:40:08,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-05-12 11:40:08,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:40:10,882 INFO L124 PetriNetUnfolderBase]: 5687/8615 cut-off events. [2024-05-12 11:40:10,882 INFO L125 PetriNetUnfolderBase]: For 149516/149531 co-relation queries the response was YES. [2024-05-12 11:40:10,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50243 conditions, 8615 events. 5687/8615 cut-off events. For 149516/149531 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 51043 event pairs, 1345 based on Foata normal form. 10/8476 useless extension candidates. Maximal degree in co-relation 50166. Up to 7051 conditions per place. [2024-05-12 11:40:10,962 INFO L140 encePairwiseOnDemand]: 33/48 looper letters, 201 selfloop transitions, 58 changer transitions 0/267 dead transitions. [2024-05-12 11:40:10,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 267 transitions, 3427 flow [2024-05-12 11:40:10,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:40:10,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:40:10,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 203 transitions. [2024-05-12 11:40:10,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5286458333333334 [2024-05-12 11:40:10,964 INFO L175 Difference]: Start difference. First operand has 159 places, 212 transitions, 2534 flow. Second operand 8 states and 203 transitions. [2024-05-12 11:40:10,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 267 transitions, 3427 flow [2024-05-12 11:40:11,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 267 transitions, 3306 flow, removed 47 selfloop flow, removed 2 redundant places. [2024-05-12 11:40:11,151 INFO L231 Difference]: Finished difference. Result has 165 places, 216 transitions, 2613 flow [2024-05-12 11:40:11,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2421, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2613, PETRI_PLACES=165, PETRI_TRANSITIONS=216} [2024-05-12 11:40:11,152 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 111 predicate places. [2024-05-12 11:40:11,152 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 216 transitions, 2613 flow [2024-05-12 11:40:11,152 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:40:11,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:40:11,153 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:40:11,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-05-12 11:40:11,153 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:40:11,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:40:11,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1938535940, now seen corresponding path program 3 times [2024-05-12 11:40:11,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:40:11,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408288529] [2024-05-12 11:40:11,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:40:11,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:40:11,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:40:20,002 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:40:20,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:40:20,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408288529] [2024-05-12 11:40:20,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408288529] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:40:20,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:40:20,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:40:20,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960044321] [2024-05-12 11:40:20,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:40:20,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:40:20,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:40:20,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:40:20,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:40:20,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-05-12 11:40:20,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 216 transitions, 2613 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:40:20,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:40:20,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-05-12 11:40:20,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:40:22,834 INFO L124 PetriNetUnfolderBase]: 5831/8803 cut-off events. [2024-05-12 11:40:22,834 INFO L125 PetriNetUnfolderBase]: For 160343/160358 co-relation queries the response was YES. [2024-05-12 11:40:22,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52296 conditions, 8803 events. 5831/8803 cut-off events. For 160343/160358 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 52043 event pairs, 1369 based on Foata normal form. 10/8667 useless extension candidates. Maximal degree in co-relation 52217. Up to 7097 conditions per place. [2024-05-12 11:40:22,908 INFO L140 encePairwiseOnDemand]: 33/48 looper letters, 204 selfloop transitions, 64 changer transitions 0/276 dead transitions. [2024-05-12 11:40:22,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 276 transitions, 3631 flow [2024-05-12 11:40:22,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:40:22,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:40:22,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 204 transitions. [2024-05-12 11:40:22,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.53125 [2024-05-12 11:40:22,910 INFO L175 Difference]: Start difference. First operand has 165 places, 216 transitions, 2613 flow. Second operand 8 states and 204 transitions. [2024-05-12 11:40:22,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 276 transitions, 3631 flow [2024-05-12 11:40:23,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 276 transitions, 3478 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-05-12 11:40:23,115 INFO L231 Difference]: Finished difference. Result has 168 places, 224 transitions, 2737 flow [2024-05-12 11:40:23,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2460, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2737, PETRI_PLACES=168, PETRI_TRANSITIONS=224} [2024-05-12 11:40:23,116 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 114 predicate places. [2024-05-12 11:40:23,116 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 224 transitions, 2737 flow [2024-05-12 11:40:23,116 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:40:23,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:40:23,117 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:40:23,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-05-12 11:40:23,117 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:40:23,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:40:23,117 INFO L85 PathProgramCache]: Analyzing trace with hash 848142034, now seen corresponding path program 3 times [2024-05-12 11:40:23,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:40:23,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267675411] [2024-05-12 11:40:23,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:40:23,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:40:23,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:40:32,893 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:40:32,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:40:32,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267675411] [2024-05-12 11:40:32,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267675411] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:40:32,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:40:32,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:40:32,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456251408] [2024-05-12 11:40:32,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:40:32,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:40:32,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:40:32,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:40:32,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:40:33,047 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-05-12 11:40:33,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 224 transitions, 2737 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:40:33,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:40:33,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-05-12 11:40:33,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:40:35,498 INFO L124 PetriNetUnfolderBase]: 5440/8155 cut-off events. [2024-05-12 11:40:35,499 INFO L125 PetriNetUnfolderBase]: For 164383/164453 co-relation queries the response was YES. [2024-05-12 11:40:35,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50232 conditions, 8155 events. 5440/8155 cut-off events. For 164383/164453 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 47167 event pairs, 1111 based on Foata normal form. 21/8085 useless extension candidates. Maximal degree in co-relation 50151. Up to 7235 conditions per place. [2024-05-12 11:40:35,568 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 193 selfloop transitions, 43 changer transitions 0/272 dead transitions. [2024-05-12 11:40:35,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 272 transitions, 3393 flow [2024-05-12 11:40:35,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:40:35,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:40:35,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 195 transitions. [2024-05-12 11:40:35,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5078125 [2024-05-12 11:40:35,570 INFO L175 Difference]: Start difference. First operand has 168 places, 224 transitions, 2737 flow. Second operand 8 states and 195 transitions. [2024-05-12 11:40:35,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 272 transitions, 3393 flow [2024-05-12 11:40:35,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 272 transitions, 3219 flow, removed 55 selfloop flow, removed 4 redundant places. [2024-05-12 11:40:35,773 INFO L231 Difference]: Finished difference. Result has 172 places, 226 transitions, 2699 flow [2024-05-12 11:40:35,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2583, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2699, PETRI_PLACES=172, PETRI_TRANSITIONS=226} [2024-05-12 11:40:35,774 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 118 predicate places. [2024-05-12 11:40:35,774 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 226 transitions, 2699 flow [2024-05-12 11:40:35,774 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:40:35,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:40:35,774 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:40:35,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-05-12 11:40:35,775 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:40:35,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:40:35,775 INFO L85 PathProgramCache]: Analyzing trace with hash 963433328, now seen corresponding path program 4 times [2024-05-12 11:40:35,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:40:35,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068583140] [2024-05-12 11:40:35,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:40:35,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:40:35,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:40:46,646 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:40:46,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:40:46,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068583140] [2024-05-12 11:40:46,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068583140] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:40:46,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:40:46,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:40:46,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409480359] [2024-05-12 11:40:46,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:40:46,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:40:46,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:40:46,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:40:46,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:40:46,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-05-12 11:40:46,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 226 transitions, 2699 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:40:46,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:40:46,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-05-12 11:40:46,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:40:49,685 INFO L124 PetriNetUnfolderBase]: 5983/9057 cut-off events. [2024-05-12 11:40:49,685 INFO L125 PetriNetUnfolderBase]: For 175711/175726 co-relation queries the response was YES. [2024-05-12 11:40:49,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54460 conditions, 9057 events. 5983/9057 cut-off events. For 175711/175726 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 54145 event pairs, 1322 based on Foata normal form. 10/8906 useless extension candidates. Maximal degree in co-relation 54377. Up to 7210 conditions per place. [2024-05-12 11:40:49,765 INFO L140 encePairwiseOnDemand]: 33/48 looper letters, 220 selfloop transitions, 67 changer transitions 0/295 dead transitions. [2024-05-12 11:40:49,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 295 transitions, 3911 flow [2024-05-12 11:40:49,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:40:49,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:40:49,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 212 transitions. [2024-05-12 11:40:49,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5520833333333334 [2024-05-12 11:40:49,767 INFO L175 Difference]: Start difference. First operand has 172 places, 226 transitions, 2699 flow. Second operand 8 states and 212 transitions. [2024-05-12 11:40:49,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 295 transitions, 3911 flow [2024-05-12 11:40:49,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 295 transitions, 3821 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-05-12 11:40:49,957 INFO L231 Difference]: Finished difference. Result has 175 places, 235 transitions, 2929 flow [2024-05-12 11:40:49,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2609, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2929, PETRI_PLACES=175, PETRI_TRANSITIONS=235} [2024-05-12 11:40:49,959 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 121 predicate places. [2024-05-12 11:40:49,959 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 235 transitions, 2929 flow [2024-05-12 11:40:49,959 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:40:49,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:40:49,959 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:40:49,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-05-12 11:40:49,960 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:40:49,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:40:49,960 INFO L85 PathProgramCache]: Analyzing trace with hash 963610958, now seen corresponding path program 5 times [2024-05-12 11:40:49,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:40:49,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967184304] [2024-05-12 11:40:49,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:40:49,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:40:50,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:40:59,549 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:40:59,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:40:59,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967184304] [2024-05-12 11:40:59,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967184304] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:40:59,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:40:59,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:40:59,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727017685] [2024-05-12 11:40:59,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:40:59,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:40:59,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:40:59,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:40:59,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:40:59,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-05-12 11:40:59,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 235 transitions, 2929 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:40:59,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:40:59,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-05-12 11:40:59,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:41:02,294 INFO L124 PetriNetUnfolderBase]: 6147/9045 cut-off events. [2024-05-12 11:41:02,295 INFO L125 PetriNetUnfolderBase]: For 196842/196857 co-relation queries the response was YES. [2024-05-12 11:41:02,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57730 conditions, 9045 events. 6147/9045 cut-off events. For 196842/196857 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 51685 event pairs, 1101 based on Foata normal form. 10/8974 useless extension candidates. Maximal degree in co-relation 57645. Up to 7365 conditions per place. [2024-05-12 11:41:02,376 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 208 selfloop transitions, 92 changer transitions 0/308 dead transitions. [2024-05-12 11:41:02,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 308 transitions, 4256 flow [2024-05-12 11:41:02,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:41:02,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:41:02,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 203 transitions. [2024-05-12 11:41:02,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5286458333333334 [2024-05-12 11:41:02,377 INFO L175 Difference]: Start difference. First operand has 175 places, 235 transitions, 2929 flow. Second operand 8 states and 203 transitions. [2024-05-12 11:41:02,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 308 transitions, 4256 flow [2024-05-12 11:41:02,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 308 transitions, 4104 flow, removed 40 selfloop flow, removed 4 redundant places. [2024-05-12 11:41:02,637 INFO L231 Difference]: Finished difference. Result has 181 places, 253 transitions, 3422 flow [2024-05-12 11:41:02,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2783, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3422, PETRI_PLACES=181, PETRI_TRANSITIONS=253} [2024-05-12 11:41:02,637 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 127 predicate places. [2024-05-12 11:41:02,637 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 253 transitions, 3422 flow [2024-05-12 11:41:02,638 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:41:02,638 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:41:02,638 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:41:02,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-05-12 11:41:02,638 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 11:41:02,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:41:02,638 INFO L85 PathProgramCache]: Analyzing trace with hash 963437978, now seen corresponding path program 6 times [2024-05-12 11:41:02,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:41:02,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489094912] [2024-05-12 11:41:02,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:41:02,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:41:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:41:12,370 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:41:12,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:41:12,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489094912] [2024-05-12 11:41:12,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489094912] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:41:12,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:41:12,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:41:12,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411616547] [2024-05-12 11:41:12,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:41:12,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:41:12,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:41:12,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:41:12,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:41:12,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-05-12 11:41:12,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 253 transitions, 3422 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:41:12,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:41:12,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-05-12 11:41:12,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:41:15,244 INFO L124 PetriNetUnfolderBase]: 6286/9234 cut-off events. [2024-05-12 11:41:15,245 INFO L125 PetriNetUnfolderBase]: For 213426/213438 co-relation queries the response was YES. [2024-05-12 11:41:15,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61612 conditions, 9234 events. 6286/9234 cut-off events. For 213426/213438 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 52729 event pairs, 1101 based on Foata normal form. 9/9162 useless extension candidates. Maximal degree in co-relation 61523. Up to 7539 conditions per place. [2024-05-12 11:41:15,468 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 218 selfloop transitions, 103 changer transitions 0/329 dead transitions. [2024-05-12 11:41:15,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 329 transitions, 4871 flow [2024-05-12 11:41:15,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:41:15,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:41:15,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 208 transitions. [2024-05-12 11:41:15,469 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-05-12 11:41:15,469 INFO L175 Difference]: Start difference. First operand has 181 places, 253 transitions, 3422 flow. Second operand 8 states and 208 transitions. [2024-05-12 11:41:15,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 329 transitions, 4871 flow [2024-05-12 11:41:15,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 329 transitions, 4550 flow, removed 118 selfloop flow, removed 3 redundant places. [2024-05-12 11:41:15,826 INFO L231 Difference]: Finished difference. Result has 189 places, 270 transitions, 3781 flow [2024-05-12 11:41:15,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3159, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3781, PETRI_PLACES=189, PETRI_TRANSITIONS=270} [2024-05-12 11:41:15,827 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 135 predicate places. [2024-05-12 11:41:15,827 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 270 transitions, 3781 flow [2024-05-12 11:41:15,827 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:41:15,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:41:15,828 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:41:15,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-05-12 11:41:15,828 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:41:15,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:41:15,828 INFO L85 PathProgramCache]: Analyzing trace with hash 2054011684, now seen corresponding path program 1 times [2024-05-12 11:41:15,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:41:15,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756621858] [2024-05-12 11:41:15,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:41:15,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:41:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:41:25,056 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:41:25,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:41:25,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756621858] [2024-05-12 11:41:25,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756621858] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:41:25,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:41:25,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:41:25,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806365290] [2024-05-12 11:41:25,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:41:25,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:41:25,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:41:25,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:41:25,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:41:25,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-05-12 11:41:25,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 270 transitions, 3781 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:41:25,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:41:25,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-05-12 11:41:25,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:41:28,134 INFO L124 PetriNetUnfolderBase]: 6422/9708 cut-off events. [2024-05-12 11:41:28,135 INFO L125 PetriNetUnfolderBase]: For 232718/232730 co-relation queries the response was YES. [2024-05-12 11:41:28,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65315 conditions, 9708 events. 6422/9708 cut-off events. For 232718/232730 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 58457 event pairs, 1395 based on Foata normal form. 15/9552 useless extension candidates. Maximal degree in co-relation 65221. Up to 8037 conditions per place. [2024-05-12 11:41:28,240 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 259 selfloop transitions, 58 changer transitions 0/325 dead transitions. [2024-05-12 11:41:28,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 325 transitions, 4841 flow [2024-05-12 11:41:28,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:41:28,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:41:28,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 203 transitions. [2024-05-12 11:41:28,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5286458333333334 [2024-05-12 11:41:28,242 INFO L175 Difference]: Start difference. First operand has 189 places, 270 transitions, 3781 flow. Second operand 8 states and 203 transitions. [2024-05-12 11:41:28,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 325 transitions, 4841 flow [2024-05-12 11:41:28,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 325 transitions, 4642 flow, removed 54 selfloop flow, removed 3 redundant places. [2024-05-12 11:41:28,722 INFO L231 Difference]: Finished difference. Result has 194 places, 274 transitions, 3799 flow [2024-05-12 11:41:28,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3586, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3799, PETRI_PLACES=194, PETRI_TRANSITIONS=274} [2024-05-12 11:41:28,722 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 140 predicate places. [2024-05-12 11:41:28,722 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 274 transitions, 3799 flow [2024-05-12 11:41:28,723 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:41:28,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:41:28,723 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:41:28,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-05-12 11:41:28,723 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:41:28,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:41:28,724 INFO L85 PathProgramCache]: Analyzing trace with hash 586002362, now seen corresponding path program 1 times [2024-05-12 11:41:28,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:41:28,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443229522] [2024-05-12 11:41:28,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:41:28,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:41:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:41:39,253 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:41:39,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:41:39,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443229522] [2024-05-12 11:41:39,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443229522] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:41:39,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:41:39,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:41:39,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974718042] [2024-05-12 11:41:39,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:41:39,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:41:39,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:41:39,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:41:39,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:41:39,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-05-12 11:41:39,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 274 transitions, 3799 flow. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 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:41:39,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:41:39,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-05-12 11:41:39,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:41:41,892 INFO L124 PetriNetUnfolderBase]: 6439/9733 cut-off events. [2024-05-12 11:41:41,892 INFO L125 PetriNetUnfolderBase]: For 235042/235042 co-relation queries the response was YES. [2024-05-12 11:41:41,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65577 conditions, 9733 events. 6439/9733 cut-off events. For 235042/235042 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 58687 event pairs, 1615 based on Foata normal form. 1/9557 useless extension candidates. Maximal degree in co-relation 65482. Up to 9082 conditions per place. [2024-05-12 11:41:41,990 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 277 selfloop transitions, 18 changer transitions 0/303 dead transitions. [2024-05-12 11:41:41,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 303 transitions, 4599 flow [2024-05-12 11:41:41,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:41:41,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:41:41,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2024-05-12 11:41:41,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2024-05-12 11:41:41,992 INFO L175 Difference]: Start difference. First operand has 194 places, 274 transitions, 3799 flow. Second operand 6 states and 138 transitions. [2024-05-12 11:41:41,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 303 transitions, 4599 flow [2024-05-12 11:41:42,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 303 transitions, 4412 flow, removed 36 selfloop flow, removed 6 redundant places. [2024-05-12 11:41:42,372 INFO L231 Difference]: Finished difference. Result has 194 places, 277 transitions, 3722 flow [2024-05-12 11:41:42,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3616, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3722, PETRI_PLACES=194, PETRI_TRANSITIONS=277} [2024-05-12 11:41:42,373 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 140 predicate places. [2024-05-12 11:41:42,373 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 277 transitions, 3722 flow [2024-05-12 11:41:42,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 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:41:42,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:41:42,373 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:41:42,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-05-12 11:41:42,374 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 11:41:42,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:41:42,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1102497966, now seen corresponding path program 2 times [2024-05-12 11:41:42,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:41:42,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247544942] [2024-05-12 11:41:42,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:41:42,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:41:42,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:41:51,766 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:41:51,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:41:51,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247544942] [2024-05-12 11:41:51,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247544942] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:41:51,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:41:51,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:41:51,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356910517] [2024-05-12 11:41:51,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:41:51,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:41:51,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:41:51,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:41:51,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:41:52,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-05-12 11:41:52,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 277 transitions, 3722 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:41:52,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:41:52,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-05-12 11:41:52,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:41:54,761 INFO L124 PetriNetUnfolderBase]: 6507/9900 cut-off events. [2024-05-12 11:41:54,761 INFO L125 PetriNetUnfolderBase]: For 242302/242302 co-relation queries the response was YES. [2024-05-12 11:41:54,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65006 conditions, 9900 events. 6507/9900 cut-off events. For 242302/242302 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 60408 event pairs, 1854 based on Foata normal form. 6/9740 useless extension candidates. Maximal degree in co-relation 64910. Up to 8920 conditions per place. [2024-05-12 11:41:54,868 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 281 selfloop transitions, 35 changer transitions 0/324 dead transitions. [2024-05-12 11:41:54,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 324 transitions, 4694 flow [2024-05-12 11:41:54,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:41:54,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:41:54,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 190 transitions. [2024-05-12 11:41:54,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4947916666666667 [2024-05-12 11:41:54,869 INFO L175 Difference]: Start difference. First operand has 194 places, 277 transitions, 3722 flow. Second operand 8 states and 190 transitions. [2024-05-12 11:41:54,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 324 transitions, 4694 flow [2024-05-12 11:41:55,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 324 transitions, 4539 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-05-12 11:41:55,211 INFO L231 Difference]: Finished difference. Result has 196 places, 280 transitions, 3729 flow [2024-05-12 11:41:55,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3567, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3729, PETRI_PLACES=196, PETRI_TRANSITIONS=280} [2024-05-12 11:41:55,211 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 142 predicate places. [2024-05-12 11:41:55,211 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 280 transitions, 3729 flow [2024-05-12 11:41:55,212 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:41:55,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:41:55,212 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:41:55,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-05-12 11:41:55,212 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 11:41:55,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:41:55,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1358097802, now seen corresponding path program 7 times [2024-05-12 11:41:55,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:41:55,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478117429] [2024-05-12 11:41:55,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:41:55,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:41:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:42:04,739 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:42:04,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:42:04,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478117429] [2024-05-12 11:42:04,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478117429] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:42:04,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:42:04,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:42:04,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896661063] [2024-05-12 11:42:04,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:42:04,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:42:04,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:42:04,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:42:04,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:42:04,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-05-12 11:42:04,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 280 transitions, 3729 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:42:04,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:42:04,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-05-12 11:42:04,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:42:07,982 INFO L124 PetriNetUnfolderBase]: 6602/10032 cut-off events. [2024-05-12 11:42:07,982 INFO L125 PetriNetUnfolderBase]: For 253149/253161 co-relation queries the response was YES. [2024-05-12 11:42:08,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66577 conditions, 10032 events. 6602/10032 cut-off events. For 253149/253161 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 61277 event pairs, 1789 based on Foata normal form. 17/9883 useless extension candidates. Maximal degree in co-relation 66481. Up to 8895 conditions per place. [2024-05-12 11:42:08,095 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 275 selfloop transitions, 60 changer transitions 0/343 dead transitions. [2024-05-12 11:42:08,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 343 transitions, 5028 flow [2024-05-12 11:42:08,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:42:08,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:42:08,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 196 transitions. [2024-05-12 11:42:08,096 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5104166666666666 [2024-05-12 11:42:08,097 INFO L175 Difference]: Start difference. First operand has 196 places, 280 transitions, 3729 flow. Second operand 8 states and 196 transitions. [2024-05-12 11:42:08,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 343 transitions, 5028 flow [2024-05-12 11:42:08,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 343 transitions, 4890 flow, removed 36 selfloop flow, removed 6 redundant places. [2024-05-12 11:42:08,482 INFO L231 Difference]: Finished difference. Result has 200 places, 294 transitions, 4063 flow [2024-05-12 11:42:08,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3591, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4063, PETRI_PLACES=200, PETRI_TRANSITIONS=294} [2024-05-12 11:42:08,483 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 146 predicate places. [2024-05-12 11:42:08,483 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 294 transitions, 4063 flow [2024-05-12 11:42:08,483 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:42:08,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:42:08,483 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:42:08,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-05-12 11:42:08,483 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 11:42:08,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:42:08,484 INFO L85 PathProgramCache]: Analyzing trace with hash 694549688, now seen corresponding path program 3 times [2024-05-12 11:42:08,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:42:08,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758292079] [2024-05-12 11:42:08,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:42:08,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:42:08,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:42:17,219 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:42:17,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:42:17,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758292079] [2024-05-12 11:42:17,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758292079] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:42:17,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:42:17,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:42:17,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36269128] [2024-05-12 11:42:17,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:42:17,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:42:17,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:42:17,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:42:17,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:42:17,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-05-12 11:42:17,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 294 transitions, 4063 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:42:17,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:42:17,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-05-12 11:42:17,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:42:20,530 INFO L124 PetriNetUnfolderBase]: 6670/10167 cut-off events. [2024-05-12 11:42:20,531 INFO L125 PetriNetUnfolderBase]: For 264610/264610 co-relation queries the response was YES. [2024-05-12 11:42:20,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68074 conditions, 10167 events. 6670/10167 cut-off events. For 264610/264610 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 62478 event pairs, 1891 based on Foata normal form. 6/9998 useless extension candidates. Maximal degree in co-relation 67975. Up to 9214 conditions per place. [2024-05-12 11:42:20,643 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 289 selfloop transitions, 40 changer transitions 0/337 dead transitions. [2024-05-12 11:42:20,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 337 transitions, 4989 flow [2024-05-12 11:42:20,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:42:20,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:42:20,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions. [2024-05-12 11:42:20,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4895833333333333 [2024-05-12 11:42:20,645 INFO L175 Difference]: Start difference. First operand has 200 places, 294 transitions, 4063 flow. Second operand 8 states and 188 transitions. [2024-05-12 11:42:20,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 337 transitions, 4989 flow [2024-05-12 11:42:21,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 337 transitions, 4742 flow, removed 81 selfloop flow, removed 4 redundant places. [2024-05-12 11:42:21,117 INFO L231 Difference]: Finished difference. Result has 204 places, 297 transitions, 3997 flow [2024-05-12 11:42:21,117 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3816, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3997, PETRI_PLACES=204, PETRI_TRANSITIONS=297} [2024-05-12 11:42:21,118 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 150 predicate places. [2024-05-12 11:42:21,118 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 297 transitions, 3997 flow [2024-05-12 11:42:21,118 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:42:21,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:42:21,118 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:42:21,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-05-12 11:42:21,119 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 11:42:21,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:42:21,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1367272438, now seen corresponding path program 1 times [2024-05-12 11:42:21,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:42:21,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340418601] [2024-05-12 11:42:21,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:42:21,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:42:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:42:29,793 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:42:29,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:42:29,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340418601] [2024-05-12 11:42:29,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340418601] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:42:29,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:42:29,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:42:29,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312067003] [2024-05-12 11:42:29,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:42:29,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:42:29,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:42:29,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:42:29,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:42:29,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-05-12 11:42:29,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 297 transitions, 3997 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:42:29,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:42:29,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-05-12 11:42:29,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:42:32,886 INFO L124 PetriNetUnfolderBase]: 6671/10187 cut-off events. [2024-05-12 11:42:32,887 INFO L125 PetriNetUnfolderBase]: For 268439/268451 co-relation queries the response was YES. [2024-05-12 11:42:32,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67536 conditions, 10187 events. 6671/10187 cut-off events. For 268439/268451 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 62882 event pairs, 1872 based on Foata normal form. 11/10017 useless extension candidates. Maximal degree in co-relation 67436. Up to 9186 conditions per place. [2024-05-12 11:42:32,990 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 284 selfloop transitions, 43 changer transitions 0/335 dead transitions. [2024-05-12 11:42:32,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 335 transitions, 4905 flow [2024-05-12 11:42:32,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:42:32,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:42:32,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions. [2024-05-12 11:42:32,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-05-12 11:42:32,991 INFO L175 Difference]: Start difference. First operand has 204 places, 297 transitions, 3997 flow. Second operand 7 states and 168 transitions. [2024-05-12 11:42:32,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 335 transitions, 4905 flow [2024-05-12 11:42:33,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 335 transitions, 4682 flow, removed 74 selfloop flow, removed 6 redundant places. [2024-05-12 11:42:33,403 INFO L231 Difference]: Finished difference. Result has 205 places, 301 transitions, 3964 flow [2024-05-12 11:42:33,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3808, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3964, PETRI_PLACES=205, PETRI_TRANSITIONS=301} [2024-05-12 11:42:33,404 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 151 predicate places. [2024-05-12 11:42:33,404 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 301 transitions, 3964 flow [2024-05-12 11:42:33,404 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:42:33,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:42:33,404 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:42:33,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-05-12 11:42:33,405 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:42:33,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:42:33,405 INFO L85 PathProgramCache]: Analyzing trace with hash 694558058, now seen corresponding path program 4 times [2024-05-12 11:42:33,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:42:33,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042121340] [2024-05-12 11:42:33,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:42:33,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:42:33,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:42:42,121 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:42:42,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:42:42,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042121340] [2024-05-12 11:42:42,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042121340] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:42:42,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:42:42,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:42:42,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373879963] [2024-05-12 11:42:42,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:42:42,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:42:42,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:42:42,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:42:42,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:42:42,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-05-12 11:42:42,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 301 transitions, 3964 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:42:42,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:42:42,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-05-12 11:42:42,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:42:45,255 INFO L124 PetriNetUnfolderBase]: 6702/10233 cut-off events. [2024-05-12 11:42:45,255 INFO L125 PetriNetUnfolderBase]: For 272794/272794 co-relation queries the response was YES. [2024-05-12 11:42:45,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67414 conditions, 10233 events. 6702/10233 cut-off events. For 272794/272794 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 63113 event pairs, 1862 based on Foata normal form. 6/10059 useless extension candidates. Maximal degree in co-relation 67313. Up to 9305 conditions per place. [2024-05-12 11:42:45,359 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 302 selfloop transitions, 36 changer transitions 0/346 dead transitions. [2024-05-12 11:42:45,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 346 transitions, 4928 flow [2024-05-12 11:42:45,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:42:45,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:42:45,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 186 transitions. [2024-05-12 11:42:45,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.484375 [2024-05-12 11:42:45,360 INFO L175 Difference]: Start difference. First operand has 205 places, 301 transitions, 3964 flow. Second operand 8 states and 186 transitions. [2024-05-12 11:42:45,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 346 transitions, 4928 flow [2024-05-12 11:42:45,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 346 transitions, 4852 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-05-12 11:42:45,751 INFO L231 Difference]: Finished difference. Result has 209 places, 308 transitions, 4105 flow [2024-05-12 11:42:45,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3888, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4105, PETRI_PLACES=209, PETRI_TRANSITIONS=308} [2024-05-12 11:42:45,751 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 155 predicate places. [2024-05-12 11:42:45,751 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 308 transitions, 4105 flow [2024-05-12 11:42:45,752 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:42:45,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:42:45,752 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:42:45,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-05-12 11:42:45,752 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 11:42:45,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:42:45,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1820750144, now seen corresponding path program 2 times [2024-05-12 11:42:45,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:42:45,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893364348] [2024-05-12 11:42:45,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:42:45,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:42:45,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:42:56,563 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:42:56,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:42:56,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893364348] [2024-05-12 11:42:56,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893364348] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:42:56,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:42:56,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:42:56,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216733402] [2024-05-12 11:42:56,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:42:56,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:42:56,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:42:56,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:42:56,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:42:56,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-05-12 11:42:56,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 308 transitions, 4105 flow. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 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:42:56,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:42:56,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-05-12 11:42:56,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:42:59,587 INFO L124 PetriNetUnfolderBase]: 6699/10228 cut-off events. [2024-05-12 11:42:59,587 INFO L125 PetriNetUnfolderBase]: For 284585/284585 co-relation queries the response was YES. [2024-05-12 11:42:59,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68441 conditions, 10228 events. 6699/10228 cut-off events. For 284585/284585 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 63051 event pairs, 1926 based on Foata normal form. 1/10049 useless extension candidates. Maximal degree in co-relation 68338. Up to 9488 conditions per place. [2024-05-12 11:42:59,701 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 304 selfloop transitions, 13 changer transitions 0/325 dead transitions. [2024-05-12 11:42:59,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 325 transitions, 4789 flow [2024-05-12 11:42:59,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:42:59,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:42:59,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 128 transitions. [2024-05-12 11:42:59,703 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-05-12 11:42:59,703 INFO L175 Difference]: Start difference. First operand has 209 places, 308 transitions, 4105 flow. Second operand 6 states and 128 transitions. [2024-05-12 11:42:59,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 325 transitions, 4789 flow [2024-05-12 11:43:00,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 325 transitions, 4614 flow, removed 56 selfloop flow, removed 5 redundant places. [2024-05-12 11:43:00,096 INFO L231 Difference]: Finished difference. Result has 210 places, 308 transitions, 3962 flow [2024-05-12 11:43:00,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3930, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3962, PETRI_PLACES=210, PETRI_TRANSITIONS=308} [2024-05-12 11:43:00,107 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 156 predicate places. [2024-05-12 11:43:00,108 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 308 transitions, 3962 flow [2024-05-12 11:43:00,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 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:43:00,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:43:00,108 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:43:00,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-05-12 11:43:00,108 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 11:43:00,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:43:00,109 INFO L85 PathProgramCache]: Analyzing trace with hash 23291627, now seen corresponding path program 1 times [2024-05-12 11:43:00,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:43:00,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90829300] [2024-05-12 11:43:00,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:43:00,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:43:00,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:43:13,838 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:43:13,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:43:13,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90829300] [2024-05-12 11:43:13,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90829300] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:43:13,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:43:13,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:43:13,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533892327] [2024-05-12 11:43:13,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:43:13,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:43:13,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:43:13,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:43:13,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:43:13,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-05-12 11:43:13,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 308 transitions, 3962 flow. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 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:43:13,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:43:13,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-05-12 11:43:13,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:43:16,723 INFO L124 PetriNetUnfolderBase]: 6710/10272 cut-off events. [2024-05-12 11:43:16,723 INFO L125 PetriNetUnfolderBase]: For 286579/286579 co-relation queries the response was YES. [2024-05-12 11:43:16,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67794 conditions, 10272 events. 6710/10272 cut-off events. For 286579/286579 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 63615 event pairs, 1900 based on Foata normal form. 3/10086 useless extension candidates. Maximal degree in co-relation 67690. Up to 9374 conditions per place. [2024-05-12 11:43:16,838 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 290 selfloop transitions, 41 changer transitions 0/339 dead transitions. [2024-05-12 11:43:16,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 339 transitions, 4866 flow [2024-05-12 11:43:16,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:43:16,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:43:16,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2024-05-12 11:43:16,840 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4861111111111111 [2024-05-12 11:43:16,840 INFO L175 Difference]: Start difference. First operand has 210 places, 308 transitions, 3962 flow. Second operand 6 states and 140 transitions. [2024-05-12 11:43:16,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 339 transitions, 4866 flow [2024-05-12 11:43:17,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 339 transitions, 4819 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-05-12 11:43:17,271 INFO L231 Difference]: Finished difference. Result has 211 places, 314 transitions, 4113 flow [2024-05-12 11:43:17,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3915, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4113, PETRI_PLACES=211, PETRI_TRANSITIONS=314} [2024-05-12 11:43:17,272 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 157 predicate places. [2024-05-12 11:43:17,272 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 314 transitions, 4113 flow [2024-05-12 11:43:17,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 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:43:17,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:43:17,272 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:43:17,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-05-12 11:43:17,273 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 11:43:17,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:43:17,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1820743231, now seen corresponding path program 2 times [2024-05-12 11:43:17,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:43:17,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953771842] [2024-05-12 11:43:17,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:43:17,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:43:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:43:30,410 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:43:30,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:43:30,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953771842] [2024-05-12 11:43:30,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953771842] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:43:30,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:43:30,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:43:30,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803844270] [2024-05-12 11:43:30,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:43:30,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:43:30,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:43:30,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:43:30,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:43:30,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-05-12 11:43:30,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 314 transitions, 4113 flow. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 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:43:30,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:43:30,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-05-12 11:43:30,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:43:33,361 INFO L124 PetriNetUnfolderBase]: 6676/10210 cut-off events. [2024-05-12 11:43:33,362 INFO L125 PetriNetUnfolderBase]: For 293850/293862 co-relation queries the response was YES. [2024-05-12 11:43:33,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67700 conditions, 10210 events. 6676/10210 cut-off events. For 293850/293862 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 63132 event pairs, 1901 based on Foata normal form. 4/10029 useless extension candidates. Maximal degree in co-relation 67596. Up to 9325 conditions per place. [2024-05-12 11:43:33,480 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 284 selfloop transitions, 43 changer transitions 0/335 dead transitions. [2024-05-12 11:43:33,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 335 transitions, 4828 flow [2024-05-12 11:43:33,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:43:33,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:43:33,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2024-05-12 11:43:33,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4756944444444444 [2024-05-12 11:43:33,482 INFO L175 Difference]: Start difference. First operand has 211 places, 314 transitions, 4113 flow. Second operand 6 states and 137 transitions. [2024-05-12 11:43:33,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 335 transitions, 4828 flow [2024-05-12 11:43:33,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 335 transitions, 4766 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-05-12 11:43:33,951 INFO L231 Difference]: Finished difference. Result has 214 places, 314 transitions, 4147 flow [2024-05-12 11:43:33,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=4051, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4147, PETRI_PLACES=214, PETRI_TRANSITIONS=314} [2024-05-12 11:43:33,952 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 160 predicate places. [2024-05-12 11:43:33,953 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 314 transitions, 4147 flow [2024-05-12 11:43:33,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 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:43:33,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:43:33,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:43:33,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-05-12 11:43:33,953 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:43:33,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:43:33,954 INFO L85 PathProgramCache]: Analyzing trace with hash -123496795, now seen corresponding path program 1 times [2024-05-12 11:43:33,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:43:33,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652868275] [2024-05-12 11:43:33,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:43:33,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:43:34,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:43:43,042 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:43:43,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:43:43,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652868275] [2024-05-12 11:43:43,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652868275] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:43:43,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:43:43,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:43:43,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349271220] [2024-05-12 11:43:43,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:43:43,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:43:43,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:43:43,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:43:43,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:43:43,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-05-12 11:43:43,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 314 transitions, 4147 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:43:43,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:43:43,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-05-12 11:43:43,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:43:46,623 INFO L124 PetriNetUnfolderBase]: 7265/10784 cut-off events. [2024-05-12 11:43:46,624 INFO L125 PetriNetUnfolderBase]: For 361076/361088 co-relation queries the response was YES. [2024-05-12 11:43:46,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75007 conditions, 10784 events. 7265/10784 cut-off events. For 361076/361088 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 64370 event pairs, 878 based on Foata normal form. 27/10707 useless extension candidates. Maximal degree in co-relation 74902. Up to 6243 conditions per place. [2024-05-12 11:43:46,748 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 252 selfloop transitions, 142 changer transitions 0/402 dead transitions. [2024-05-12 11:43:46,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 402 transitions, 5935 flow [2024-05-12 11:43:46,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:43:46,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:43:46,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 240 transitions. [2024-05-12 11:43:46,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-05-12 11:43:46,755 INFO L175 Difference]: Start difference. First operand has 214 places, 314 transitions, 4147 flow. Second operand 9 states and 240 transitions. [2024-05-12 11:43:46,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 402 transitions, 5935 flow [2024-05-12 11:43:47,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 402 transitions, 5805 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-05-12 11:43:47,414 INFO L231 Difference]: Finished difference. Result has 219 places, 320 transitions, 4524 flow [2024-05-12 11:43:47,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=4017, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4524, PETRI_PLACES=219, PETRI_TRANSITIONS=320} [2024-05-12 11:43:47,415 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 165 predicate places. [2024-05-12 11:43:47,415 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 320 transitions, 4524 flow [2024-05-12 11:43:47,415 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:43:47,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:43:47,415 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:43:47,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-05-12 11:43:47,416 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:43:47,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:43:47,416 INFO L85 PathProgramCache]: Analyzing trace with hash -121622845, now seen corresponding path program 2 times [2024-05-12 11:43:47,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:43:47,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656576817] [2024-05-12 11:43:47,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:43:47,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:43:47,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:43:58,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:43:58,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:43:58,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656576817] [2024-05-12 11:43:58,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656576817] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:43:58,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:43:58,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:43:58,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547068171] [2024-05-12 11:43:58,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:43:58,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:43:58,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:43:58,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:43:58,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:43:58,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-05-12 11:43:58,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 320 transitions, 4524 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:43:58,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:43:58,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-05-12 11:43:58,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:44:02,287 INFO L124 PetriNetUnfolderBase]: 7927/12079 cut-off events. [2024-05-12 11:44:02,287 INFO L125 PetriNetUnfolderBase]: For 452199/452211 co-relation queries the response was YES. [2024-05-12 11:44:02,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87172 conditions, 12079 events. 7927/12079 cut-off events. For 452199/452211 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 76502 event pairs, 1735 based on Foata normal form. 27/11904 useless extension candidates. Maximal degree in co-relation 87064. Up to 8655 conditions per place. [2024-05-12 11:44:02,428 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 313 selfloop transitions, 87 changer transitions 0/408 dead transitions. [2024-05-12 11:44:02,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 408 transitions, 6241 flow [2024-05-12 11:44:02,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:44:02,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:44:02,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 236 transitions. [2024-05-12 11:44:02,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5462962962962963 [2024-05-12 11:44:02,430 INFO L175 Difference]: Start difference. First operand has 219 places, 320 transitions, 4524 flow. Second operand 9 states and 236 transitions. [2024-05-12 11:44:02,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 408 transitions, 6241 flow [2024-05-12 11:44:03,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 408 transitions, 5982 flow, removed 44 selfloop flow, removed 4 redundant places. [2024-05-12 11:44:03,281 INFO L231 Difference]: Finished difference. Result has 226 places, 330 transitions, 4663 flow [2024-05-12 11:44:03,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=4271, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4663, PETRI_PLACES=226, PETRI_TRANSITIONS=330} [2024-05-12 11:44:03,282 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 172 predicate places. [2024-05-12 11:44:03,282 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 330 transitions, 4663 flow [2024-05-12 11:44:03,282 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:44:03,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:44:03,283 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:44:03,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-05-12 11:44:03,283 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:44:03,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:44:03,283 INFO L85 PathProgramCache]: Analyzing trace with hash 435912001, now seen corresponding path program 3 times [2024-05-12 11:44:03,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:44:03,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250898781] [2024-05-12 11:44:03,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:44:03,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:44:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:44:13,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 11:44:13,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:44:13,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250898781] [2024-05-12 11:44:13,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250898781] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:44:13,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:44:13,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:44:13,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150135162] [2024-05-12 11:44:13,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:44:13,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:44:13,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:44:13,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:44:13,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:44:14,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-05-12 11:44:14,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 330 transitions, 4663 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:44:14,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:44:14,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-05-12 11:44:14,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:44:17,972 INFO L124 PetriNetUnfolderBase]: 8104/12049 cut-off events. [2024-05-12 11:44:17,972 INFO L125 PetriNetUnfolderBase]: For 462881/462893 co-relation queries the response was YES. [2024-05-12 11:44:18,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88777 conditions, 12049 events. 8104/12049 cut-off events. For 462881/462893 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 73759 event pairs, 1499 based on Foata normal form. 33/11978 useless extension candidates. Maximal degree in co-relation 88665. Up to 8875 conditions per place. [2024-05-12 11:44:18,341 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 247 selfloop transitions, 150 changer transitions 0/405 dead transitions. [2024-05-12 11:44:18,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 405 transitions, 6168 flow [2024-05-12 11:44:18,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:44:18,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:44:18,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 234 transitions. [2024-05-12 11:44:18,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-05-12 11:44:18,351 INFO L175 Difference]: Start difference. First operand has 226 places, 330 transitions, 4663 flow. Second operand 9 states and 234 transitions. [2024-05-12 11:44:18,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 405 transitions, 6168 flow [2024-05-12 11:44:19,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 405 transitions, 6004 flow, removed 37 selfloop flow, removed 4 redundant places. [2024-05-12 11:44:19,245 INFO L231 Difference]: Finished difference. Result has 231 places, 333 transitions, 4923 flow [2024-05-12 11:44:19,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=4499, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=147, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4923, PETRI_PLACES=231, PETRI_TRANSITIONS=333} [2024-05-12 11:44:19,246 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 177 predicate places. [2024-05-12 11:44:19,246 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 333 transitions, 4923 flow [2024-05-12 11:44:19,249 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:44:19,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:44:19,249 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:44:19,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-05-12 11:44:19,249 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 11:44:19,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:44:19,250 INFO L85 PathProgramCache]: Analyzing trace with hash 562794949, now seen corresponding path program 4 times [2024-05-12 11:44:19,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:44:19,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492711429] [2024-05-12 11:44:19,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:44:19,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:44:19,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:44:29,295 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:44:29,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:44:29,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492711429] [2024-05-12 11:44:29,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492711429] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:44:29,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:44:29,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:44:29,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840776867] [2024-05-12 11:44:29,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:44:29,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:44:29,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:44:29,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:44:29,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:44:29,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-05-12 11:44:29,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 333 transitions, 4923 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:44:29,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:44:29,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-05-12 11:44:29,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:44:33,524 INFO L124 PetriNetUnfolderBase]: 8467/12530 cut-off events. [2024-05-12 11:44:33,525 INFO L125 PetriNetUnfolderBase]: For 493237/493249 co-relation queries the response was YES. [2024-05-12 11:44:33,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94267 conditions, 12530 events. 8467/12530 cut-off events. For 493237/493249 co-relation queries the response was YES. Maximal size of possible extension queue 588. Compared 76625 event pairs, 1605 based on Foata normal form. 33/12474 useless extension candidates. Maximal degree in co-relation 94153. Up to 10340 conditions per place. [2024-05-12 11:44:33,681 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 285 selfloop transitions, 120 changer transitions 0/413 dead transitions. [2024-05-12 11:44:33,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 413 transitions, 6521 flow [2024-05-12 11:44:33,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:44:33,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:44:33,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 230 transitions. [2024-05-12 11:44:33,683 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5324074074074074 [2024-05-12 11:44:33,683 INFO L175 Difference]: Start difference. First operand has 231 places, 333 transitions, 4923 flow. Second operand 9 states and 230 transitions. [2024-05-12 11:44:33,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 413 transitions, 6521 flow [2024-05-12 11:44:34,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 413 transitions, 6144 flow, removed 35 selfloop flow, removed 7 redundant places. [2024-05-12 11:44:34,749 INFO L231 Difference]: Finished difference. Result has 237 places, 348 transitions, 5325 flow [2024-05-12 11:44:34,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=4560, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5325, PETRI_PLACES=237, PETRI_TRANSITIONS=348} [2024-05-12 11:44:34,750 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 183 predicate places. [2024-05-12 11:44:34,750 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 348 transitions, 5325 flow [2024-05-12 11:44:34,751 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:44:34,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:44:34,751 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:44:34,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-05-12 11:44:34,751 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:44:34,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:44:34,752 INFO L85 PathProgramCache]: Analyzing trace with hash -34931035, now seen corresponding path program 5 times [2024-05-12 11:44:34,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:44:34,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537778352] [2024-05-12 11:44:34,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:44:34,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:44:34,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:44:45,904 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:44:45,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:44:45,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537778352] [2024-05-12 11:44:45,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537778352] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:44:45,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:44:45,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:44:45,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009830785] [2024-05-12 11:44:45,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:44:45,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:44:45,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:44:45,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:44:45,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:44:46,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-05-12 11:44:46,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 348 transitions, 5325 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:44:46,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:44:46,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-05-12 11:44:46,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:44:50,419 INFO L124 PetriNetUnfolderBase]: 9119/13514 cut-off events. [2024-05-12 11:44:50,419 INFO L125 PetriNetUnfolderBase]: For 553905/553917 co-relation queries the response was YES. [2024-05-12 11:44:50,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103196 conditions, 13514 events. 9119/13514 cut-off events. For 553905/553917 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 83884 event pairs, 1795 based on Foata normal form. 27/13452 useless extension candidates. Maximal degree in co-relation 103077. Up to 10116 conditions per place. [2024-05-12 11:44:50,598 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 294 selfloop transitions, 127 changer transitions 0/429 dead transitions. [2024-05-12 11:44:50,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 429 transitions, 7209 flow [2024-05-12 11:44:50,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:44:50,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:44:50,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 235 transitions. [2024-05-12 11:44:50,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5439814814814815 [2024-05-12 11:44:50,600 INFO L175 Difference]: Start difference. First operand has 237 places, 348 transitions, 5325 flow. Second operand 9 states and 235 transitions. [2024-05-12 11:44:50,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 429 transitions, 7209 flow [2024-05-12 11:44:51,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 429 transitions, 6992 flow, removed 93 selfloop flow, removed 2 redundant places. [2024-05-12 11:44:51,966 INFO L231 Difference]: Finished difference. Result has 246 places, 355 transitions, 5638 flow [2024-05-12 11:44:51,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=5108, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5638, PETRI_PLACES=246, PETRI_TRANSITIONS=355} [2024-05-12 11:44:51,970 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 192 predicate places. [2024-05-12 11:44:51,971 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 355 transitions, 5638 flow [2024-05-12 11:44:51,971 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:44:51,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:44:51,971 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:44:51,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-05-12 11:44:51,971 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:44:51,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:44:51,972 INFO L85 PathProgramCache]: Analyzing trace with hash -34927315, now seen corresponding path program 6 times [2024-05-12 11:44:51,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:44:51,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070316397] [2024-05-12 11:44:51,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:44:51,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:44:52,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:45:01,588 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:45:01,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:45:01,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070316397] [2024-05-12 11:45:01,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070316397] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:45:01,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:45:01,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:45:01,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195787175] [2024-05-12 11:45:01,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:45:01,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:45:01,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:45:01,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:45:01,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:45:01,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-05-12 11:45:01,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 355 transitions, 5638 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:45:01,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:45:01,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-05-12 11:45:01,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:45:06,504 INFO L124 PetriNetUnfolderBase]: 9234/13683 cut-off events. [2024-05-12 11:45:06,504 INFO L125 PetriNetUnfolderBase]: For 554467/554479 co-relation queries the response was YES. [2024-05-12 11:45:06,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103844 conditions, 13683 events. 9234/13683 cut-off events. For 554467/554479 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 85232 event pairs, 1855 based on Foata normal form. 33/13627 useless extension candidates. Maximal degree in co-relation 103721. Up to 11306 conditions per place. [2024-05-12 11:45:06,704 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 288 selfloop transitions, 132 changer transitions 0/428 dead transitions. [2024-05-12 11:45:06,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 428 transitions, 7249 flow [2024-05-12 11:45:06,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:45:06,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:45:06,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 231 transitions. [2024-05-12 11:45:06,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5347222222222222 [2024-05-12 11:45:06,706 INFO L175 Difference]: Start difference. First operand has 246 places, 355 transitions, 5638 flow. Second operand 9 states and 231 transitions. [2024-05-12 11:45:06,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 428 transitions, 7249 flow [2024-05-12 11:45:08,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 428 transitions, 7077 flow, removed 56 selfloop flow, removed 3 redundant places. [2024-05-12 11:45:08,250 INFO L231 Difference]: Finished difference. Result has 253 places, 362 transitions, 6039 flow [2024-05-12 11:45:08,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=5474, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6039, PETRI_PLACES=253, PETRI_TRANSITIONS=362} [2024-05-12 11:45:08,251 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 199 predicate places. [2024-05-12 11:45:08,251 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 362 transitions, 6039 flow [2024-05-12 11:45:08,251 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:45:08,251 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:45:08,252 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:45:08,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-05-12 11:45:08,252 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 11:45:08,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:45:08,252 INFO L85 PathProgramCache]: Analyzing trace with hash -546765391, now seen corresponding path program 1 times [2024-05-12 11:45:08,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:45:08,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338696444] [2024-05-12 11:45:08,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:45:08,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:45:08,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:45:19,714 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:45:19,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:45:19,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338696444] [2024-05-12 11:45:19,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338696444] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:45:19,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:45:19,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:45:19,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396058843] [2024-05-12 11:45:19,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:45:19,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:45:19,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:45:19,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:45:19,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:45:19,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-05-12 11:45:19,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 362 transitions, 6039 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 11:45:19,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:45:19,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-05-12 11:45:19,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:45:24,103 INFO L124 PetriNetUnfolderBase]: 9302/14301 cut-off events. [2024-05-12 11:45:24,103 INFO L125 PetriNetUnfolderBase]: For 528740/528752 co-relation queries the response was YES. [2024-05-12 11:45:24,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105756 conditions, 14301 events. 9302/14301 cut-off events. For 528740/528752 co-relation queries the response was YES. Maximal size of possible extension queue 670. Compared 94915 event pairs, 2346 based on Foata normal form. 7/14044 useless extension candidates. Maximal degree in co-relation 105630. Up to 12409 conditions per place. [2024-05-12 11:45:24,291 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 332 selfloop transitions, 68 changer transitions 0/408 dead transitions. [2024-05-12 11:45:24,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 408 transitions, 7298 flow [2024-05-12 11:45:24,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:45:24,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:45:24,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 177 transitions. [2024-05-12 11:45:24,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5267857142857143 [2024-05-12 11:45:24,293 INFO L175 Difference]: Start difference. First operand has 253 places, 362 transitions, 6039 flow. Second operand 7 states and 177 transitions. [2024-05-12 11:45:24,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 408 transitions, 7298 flow [2024-05-12 11:45:25,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 408 transitions, 6945 flow, removed 94 selfloop flow, removed 5 redundant places. [2024-05-12 11:45:25,696 INFO L231 Difference]: Finished difference. Result has 255 places, 367 transitions, 5974 flow [2024-05-12 11:45:25,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=5691, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5974, PETRI_PLACES=255, PETRI_TRANSITIONS=367} [2024-05-12 11:45:25,697 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 201 predicate places. [2024-05-12 11:45:25,697 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 367 transitions, 5974 flow [2024-05-12 11:45:25,697 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 11:45:25,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:45:25,698 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:45:25,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-05-12 11:45:25,698 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 11:45:25,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:45:25,698 INFO L85 PathProgramCache]: Analyzing trace with hash -755872061, now seen corresponding path program 7 times [2024-05-12 11:45:25,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:45:25,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971693681] [2024-05-12 11:45:25,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:45:25,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:45:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:45:34,610 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:45:34,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:45:34,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971693681] [2024-05-12 11:45:34,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971693681] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:45:34,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:45:34,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:45:34,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468706901] [2024-05-12 11:45:34,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:45:34,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:45:34,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:45:34,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:45:34,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:45:34,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-05-12 11:45:34,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 367 transitions, 5974 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:45:34,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:45:34,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-05-12 11:45:34,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:45:39,850 INFO L124 PetriNetUnfolderBase]: 10126/15537 cut-off events. [2024-05-12 11:45:39,850 INFO L125 PetriNetUnfolderBase]: For 638906/638918 co-relation queries the response was YES. [2024-05-12 11:45:40,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117357 conditions, 15537 events. 10126/15537 cut-off events. For 638906/638918 co-relation queries the response was YES. Maximal size of possible extension queue 742. Compared 104412 event pairs, 2186 based on Foata normal form. 27/15309 useless extension candidates. Maximal degree in co-relation 117229. Up to 11607 conditions per place. [2024-05-12 11:45:40,083 INFO L140 encePairwiseOnDemand]: 33/48 looper letters, 356 selfloop transitions, 89 changer transitions 0/453 dead transitions. [2024-05-12 11:45:40,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 453 transitions, 7865 flow [2024-05-12 11:45:40,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:45:40,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:45:40,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 242 transitions. [2024-05-12 11:45:40,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5601851851851852 [2024-05-12 11:45:40,085 INFO L175 Difference]: Start difference. First operand has 255 places, 367 transitions, 5974 flow. Second operand 9 states and 242 transitions. [2024-05-12 11:45:40,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 453 transitions, 7865 flow [2024-05-12 11:45:41,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 453 transitions, 7736 flow, removed 16 selfloop flow, removed 4 redundant places. [2024-05-12 11:45:41,540 INFO L231 Difference]: Finished difference. Result has 261 places, 373 transitions, 6260 flow [2024-05-12 11:45:41,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=5845, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6260, PETRI_PLACES=261, PETRI_TRANSITIONS=373} [2024-05-12 11:45:41,541 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 207 predicate places. [2024-05-12 11:45:41,541 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 373 transitions, 6260 flow [2024-05-12 11:45:41,541 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:45:41,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:45:41,541 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:45:41,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-05-12 11:45:41,542 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 11:45:41,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:45:41,542 INFO L85 PathProgramCache]: Analyzing trace with hash -755868341, now seen corresponding path program 8 times [2024-05-12 11:45:41,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:45:41,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596261856] [2024-05-12 11:45:41,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:45:41,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:45:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:45:50,332 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:45:50,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:45:50,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596261856] [2024-05-12 11:45:50,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596261856] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:45:50,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:45:50,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:45:50,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553053079] [2024-05-12 11:45:50,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:45:50,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:45:50,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:45:50,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:45:50,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:45:50,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-05-12 11:45:50,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 373 transitions, 6260 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:45:50,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:45:50,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-05-12 11:45:50,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:45:55,970 INFO L124 PetriNetUnfolderBase]: 10516/15617 cut-off events. [2024-05-12 11:45:55,972 INFO L125 PetriNetUnfolderBase]: For 723056/723068 co-relation queries the response was YES. [2024-05-12 11:45:56,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124641 conditions, 15617 events. 10516/15617 cut-off events. For 723056/723068 co-relation queries the response was YES. Maximal size of possible extension queue 756. Compared 100137 event pairs, 2145 based on Foata normal form. 33/15562 useless extension candidates. Maximal degree in co-relation 124511. Up to 12815 conditions per place. [2024-05-12 11:45:56,213 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 285 selfloop transitions, 160 changer transitions 0/453 dead transitions. [2024-05-12 11:45:56,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 453 transitions, 7989 flow [2024-05-12 11:45:56,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:45:56,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:45:56,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 238 transitions. [2024-05-12 11:45:56,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5509259259259259 [2024-05-12 11:45:56,215 INFO L175 Difference]: Start difference. First operand has 261 places, 373 transitions, 6260 flow. Second operand 9 states and 238 transitions. [2024-05-12 11:45:56,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 453 transitions, 7989 flow [2024-05-12 11:45:58,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 453 transitions, 7778 flow, removed 52 selfloop flow, removed 5 redundant places. [2024-05-12 11:45:58,070 INFO L231 Difference]: Finished difference. Result has 266 places, 381 transitions, 6737 flow [2024-05-12 11:45:58,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=6053, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=153, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6737, PETRI_PLACES=266, PETRI_TRANSITIONS=381} [2024-05-12 11:45:58,072 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 212 predicate places. [2024-05-12 11:45:58,072 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 381 transitions, 6737 flow [2024-05-12 11:45:58,072 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:45:58,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:45:58,073 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:45:58,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-05-12 11:45:58,073 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 11:45:58,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:45:58,074 INFO L85 PathProgramCache]: Analyzing trace with hash -750154049, now seen corresponding path program 1 times [2024-05-12 11:45:58,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:45:58,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794843913] [2024-05-12 11:45:58,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:45:58,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:45:58,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:46:06,866 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:46:06,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:46:06,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794843913] [2024-05-12 11:46:06,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794843913] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:46:06,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:46:06,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:46:06,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421778949] [2024-05-12 11:46:06,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:46:06,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:46:06,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:46:06,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:46:06,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:46:07,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-05-12 11:46:07,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 381 transitions, 6737 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:46:07,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:46:07,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-05-12 11:46:07,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:46:12,681 INFO L124 PetriNetUnfolderBase]: 10584/16377 cut-off events. [2024-05-12 11:46:12,681 INFO L125 PetriNetUnfolderBase]: For 719668/719680 co-relation queries the response was YES. [2024-05-12 11:46:12,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126878 conditions, 16377 events. 10584/16377 cut-off events. For 719668/719680 co-relation queries the response was YES. Maximal size of possible extension queue 774. Compared 112303 event pairs, 2812 based on Foata normal form. 9/16086 useless extension candidates. Maximal degree in co-relation 126745. Up to 14301 conditions per place. [2024-05-12 11:46:12,923 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 359 selfloop transitions, 66 changer transitions 0/433 dead transitions. [2024-05-12 11:46:12,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 433 transitions, 7954 flow [2024-05-12 11:46:12,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:46:12,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:46:12,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 198 transitions. [2024-05-12 11:46:12,924 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.515625 [2024-05-12 11:46:12,924 INFO L175 Difference]: Start difference. First operand has 266 places, 381 transitions, 6737 flow. Second operand 8 states and 198 transitions. [2024-05-12 11:46:12,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 433 transitions, 7954 flow [2024-05-12 11:46:15,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 433 transitions, 7383 flow, removed 118 selfloop flow, removed 7 redundant places. [2024-05-12 11:46:15,252 INFO L231 Difference]: Finished difference. Result has 267 places, 384 transitions, 6415 flow [2024-05-12 11:46:15,252 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=6168, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6415, PETRI_PLACES=267, PETRI_TRANSITIONS=384} [2024-05-12 11:46:15,253 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 213 predicate places. [2024-05-12 11:46:15,253 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 384 transitions, 6415 flow [2024-05-12 11:46:15,253 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:46:15,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:46:15,254 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:46:15,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-05-12 11:46:15,254 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:46:15,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:46:15,254 INFO L85 PathProgramCache]: Analyzing trace with hash -198187113, now seen corresponding path program 2 times [2024-05-12 11:46:15,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:46:15,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655048049] [2024-05-12 11:46:15,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:46:15,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:46:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:46:25,461 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:46:25,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:46:25,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655048049] [2024-05-12 11:46:25,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655048049] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:46:25,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:46:25,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:46:25,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095833703] [2024-05-12 11:46:25,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:46:25,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:46:25,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:46:25,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:46:25,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:46:25,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-05-12 11:46:25,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 384 transitions, 6415 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:46:25,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:46:25,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-05-12 11:46:25,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:46:31,337 INFO L124 PetriNetUnfolderBase]: 10652/16473 cut-off events. [2024-05-12 11:46:31,337 INFO L125 PetriNetUnfolderBase]: For 682770/682782 co-relation queries the response was YES. [2024-05-12 11:46:31,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124071 conditions, 16473 events. 10652/16473 cut-off events. For 682770/682782 co-relation queries the response was YES. Maximal size of possible extension queue 779. Compared 112958 event pairs, 2786 based on Foata normal form. 9/16180 useless extension candidates. Maximal degree in co-relation 123938. Up to 14401 conditions per place. [2024-05-12 11:46:31,669 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 362 selfloop transitions, 70 changer transitions 0/440 dead transitions. [2024-05-12 11:46:31,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 440 transitions, 7762 flow [2024-05-12 11:46:31,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:46:31,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:46:31,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 203 transitions. [2024-05-12 11:46:31,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5286458333333334 [2024-05-12 11:46:31,685 INFO L175 Difference]: Start difference. First operand has 267 places, 384 transitions, 6415 flow. Second operand 8 states and 203 transitions. [2024-05-12 11:46:31,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 440 transitions, 7762 flow [2024-05-12 11:46:33,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 440 transitions, 7548 flow, removed 46 selfloop flow, removed 5 redundant places. [2024-05-12 11:46:33,537 INFO L231 Difference]: Finished difference. Result has 270 places, 387 transitions, 6462 flow [2024-05-12 11:46:33,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=6201, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6462, PETRI_PLACES=270, PETRI_TRANSITIONS=387} [2024-05-12 11:46:33,538 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 216 predicate places. [2024-05-12 11:46:33,538 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 387 transitions, 6462 flow [2024-05-12 11:46:33,538 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:46:33,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:46:33,538 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:46:33,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-05-12 11:46:33,539 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:46:33,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:46:33,539 INFO L85 PathProgramCache]: Analyzing trace with hash -192615483, now seen corresponding path program 3 times [2024-05-12 11:46:33,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:46:33,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172175505] [2024-05-12 11:46:33,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:46:33,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:46:33,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat