./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe004_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml --architecture 32bit


--------------------------------------------------------------------------------


Checking for ERROR reachability
Using default analysis
Version 76401ed0
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/safe004_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe004_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 --cacsl2boogietranslator.check.unreachability.of.reach_error.function false
--- Real Ultimate output ---
This is Ultimate 0.2.4-tmp.fs.goblint-validation-76401ed-m
[2024-06-20 19:42:07,038 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-20 19:42:07,083 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-20 19:42:07,087 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-20 19:42:07,087 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-20 19:42:07,127 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-20 19:42:07,127 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-20 19:42:07,127 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-20 19:42:07,128 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-20 19:42:07,128 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-20 19:42:07,128 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-20 19:42:07,128 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-20 19:42:07,129 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-20 19:42:07,141 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-20 19:42:07,142 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-20 19:42:07,142 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-20 19:42:07,142 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-20 19:42:07,142 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-20 19:42:07,144 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-20 19:42:07,144 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-20 19:42:07,144 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-20 19:42:07,146 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-20 19:42:07,146 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-20 19:42:07,146 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-20 19:42:07,146 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-20 19:42:07,147 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-20 19:42:07,147 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-20 19:42:07,147 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-20 19:42:07,147 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-20 19:42:07,148 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-20 19:42:07,148 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-20 19:42:07,148 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-20 19:42:07,148 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-20 19:42:07,148 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-20 19:42:07,149 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-20 19:42:07,149 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-20 19:42:07,149 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-20 19:42:07,149 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-20 19:42:07,149 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-20 19:42:07,150 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-20 19:42:07,150 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-20 19:42:07,151 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-20 19:42:07,151 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-20 19:42:07,151 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
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false
[2024-06-20 19:42:07,375 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-20 19:42:07,393 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-20 19:42:07,395 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-20 19:42:07,395 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-20 19:42:07,396 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-20 19:42:07,397 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/safe004_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml
[2024-06-20 19:42:07,589 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-20 19:42:07,589 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-20 19:42:07,590 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i
[2024-06-20 19:42:08,576 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-20 19:42:08,789 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-20 19:42:08,789 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i
[2024-06-20 19:42:08,810 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a0d344ea/f05acae7fec54a7dafb6c33b58534ca1/FLAG2ea6146d5
[2024-06-20 19:42:08,819 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a0d344ea/f05acae7fec54a7dafb6c33b58534ca1
[2024-06-20 19:42:08,820 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-20 19:42:08,821 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-20 19:42:08,821 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-20 19:42:08,822 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-20 19:42:08,825 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-20 19:42:08,826 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:42:07" (1/2) ...
[2024-06-20 19:42:08,827 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@337a62a7 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:42:08, skipping insertion in model container
[2024-06-20 19:42:08,827 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:42:07" (1/2) ...
[2024-06-20 19:42:08,828 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1042017a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:42:08, skipping insertion in model container
[2024-06-20 19:42:08,828 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:42:08" (2/2) ...
[2024-06-20 19:42:08,828 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@337a62a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:42:08, skipping insertion in model container
[2024-06-20 19:42:08,829 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:42:08" (2/2) ...
[2024-06-20 19:42:08,829 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-20 19:42:08,915 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-20 19:42:08,916 INFO  L97    edCorrectnessWitness]: Location invariant before [L849-L849] (((((((((((((((((! multithreaded || y$read_delayed_var == 0) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) + (long long )y$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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$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 )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$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 )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$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 )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$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 )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (4LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff0_thd3 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd3 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 127) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p2_EAX <= 127) && __unbuffered_p2_EBX <= 127) && y <= 127) && y$mem_tmp <= 127) && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd3 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= y && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 127) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((0 <= y$w_buff1 && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((((0 <= y$w_buff0 && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))
[2024-06-20 19:42:08,916 INFO  L97    edCorrectnessWitness]: Location invariant before [L847-L847] (((((((((((((((((! multithreaded || y$read_delayed_var == 0) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) + (long long )y$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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$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 )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$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 )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$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 )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$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 )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (4LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff0_thd3 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd3 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 127) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p2_EAX <= 127) && __unbuffered_p2_EBX <= 127) && y <= 127) && y$mem_tmp <= 127) && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd3 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= y && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 127) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((0 <= y$w_buff1 && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((((0 <= y$w_buff0 && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))
[2024-06-20 19:42:08,917 INFO  L97    edCorrectnessWitness]: Location invariant before [L850-L850] (((((((((((((((((! multithreaded || y$read_delayed_var == 0) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) + (long long )y$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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$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 )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$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 )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$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 )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$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 )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (4LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff0_thd3 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd3 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 127) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p2_EAX <= 127) && __unbuffered_p2_EBX <= 127) && y <= 127) && y$mem_tmp <= 127) && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd3 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= y && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 127) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((0 <= y$w_buff1 && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((((0 <= y$w_buff0 && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))
[2024-06-20 19:42:08,918 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-20 19:42:08,918 INFO  L106   edCorrectnessWitness]: ghost_update [L845-L845] multithreaded = 1;
[2024-06-20 19:42:08,954 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-20 19:42:09,289 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-20 19:42:09,304 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-20 19:42:09,652 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-20 19:42:09,700 INFO  L206         MainTranslator]: Completed translation
[2024-06-20 19:42:09,700 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:42:09 WrapperNode
[2024-06-20 19:42:09,700 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-20 19:42:09,701 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-20 19:42:09,702 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-20 19:42:09,702 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-20 19:42:09,708 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:42:09" (1/1) ...
[2024-06-20 19:42:09,743 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:42:09" (1/1) ...
[2024-06-20 19:42:09,827 INFO  L138                Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 143
[2024-06-20 19:42:09,827 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-20 19:42:09,829 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-20 19:42:09,829 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-20 19:42:09,829 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-20 19:42:09,837 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:42:09" (1/1) ...
[2024-06-20 19:42:09,837 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:42:09" (1/1) ...
[2024-06-20 19:42:09,860 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:42:09" (1/1) ...
[2024-06-20 19:42:09,903 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-06-20 19:42:09,904 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:42:09" (1/1) ...
[2024-06-20 19:42:09,904 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:42:09" (1/1) ...
[2024-06-20 19:42:09,941 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:42:09" (1/1) ...
[2024-06-20 19:42:09,943 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:42:09" (1/1) ...
[2024-06-20 19:42:09,961 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:42:09" (1/1) ...
[2024-06-20 19:42:09,966 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:42:09" (1/1) ...
[2024-06-20 19:42:09,989 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-20 19:42:09,989 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-20 19:42:09,990 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-20 19:42:09,990 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-20 19:42:09,991 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:42:09" (1/1) ...
[2024-06-20 19:42:09,995 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-20 19:42:10,001 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-20 19:42:10,023 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-06-20 19:42:10,048 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-06-20 19:42:10,060 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-20 19:42:10,060 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-20 19:42:10,060 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-20 19:42:10,060 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-20 19:42:10,060 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-20 19:42:10,061 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-20 19:42:10,061 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-20 19:42:10,061 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-20 19:42:10,061 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-20 19:42:10,061 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-20 19:42:10,062 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-20 19:42:10,062 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-20 19:42:10,063 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-20 19:42:10,187 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-20 19:42:10,189 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-20 19:42:11,172 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-20 19:42:11,174 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-20 19:42:11,431 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-20 19:42:11,431 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-20 19:42:11,432 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:42:11 BoogieIcfgContainer
[2024-06-20 19:42:11,432 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-20 19:42:11,436 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-20 19:42:11,436 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-20 19:42:11,439 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-20 19:42:11,439 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:42:07" (1/4) ...
[2024-06-20 19:42:11,439 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d252c88 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 07:42:11, skipping insertion in model container
[2024-06-20 19:42:11,440 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.06 07:42:08" (2/4) ...
[2024-06-20 19:42:11,440 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d252c88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 07:42:11, skipping insertion in model container
[2024-06-20 19:42:11,440 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:42:09" (3/4) ...
[2024-06-20 19:42:11,441 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d252c88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 07:42:11, skipping insertion in model container
[2024-06-20 19:42:11,441 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:42:11" (4/4) ...
[2024-06-20 19:42:11,442 INFO  L112   eAbstractionObserver]: Analyzing ICFG safe004_power.oepc_pso.oepc_rmo.oepc.i
[2024-06-20 19:42:11,457 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-20 19:42:11,458 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-20 19:42:11,458 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-20 19:42:11,547 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-20 19:42:11,575 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 50 places, 40 transitions, 92 flow
[2024-06-20 19:42:11,619 INFO  L124   PetriNetUnfolderBase]: 0/37 cut-off events.
[2024-06-20 19:42:11,619 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-20 19:42:11,622 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 0/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-20 19:42:11,622 INFO  L82        GeneralOperation]: Start removeDead. Operand has 50 places, 40 transitions, 92 flow
[2024-06-20 19:42:11,625 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 41 places, 31 transitions, 71 flow
[2024-06-20 19:42:11,636 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-20 19:42:11,643 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;@25b6415c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-20 19:42:11,643 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-20 19:42:11,650 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-20 19:42:11,650 INFO  L124   PetriNetUnfolderBase]: 0/5 cut-off events.
[2024-06-20 19:42:11,650 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-20 19:42:11,651 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:42:11,651 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1]
[2024-06-20 19:42:11,652 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:42:11,658 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:42:11,659 INFO  L85        PathProgramCache]: Analyzing trace with hash 440169185, now seen corresponding path program 1 times
[2024-06-20 19:42:11,666 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:42:11,666 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799959806]
[2024-06-20 19:42:11,666 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:42:11,667 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:42:11,978 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:42:16,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-06-20 19:42:16,064 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:42:16,064 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799959806]
[2024-06-20 19:42:16,065 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799959806] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:42:16,065 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:42:16,065 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-20 19:42:16,066 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749350805]
[2024-06-20 19:42:16,067 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:42:16,076 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-20 19:42:16,080 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:42:16,101 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-20 19:42:16,102 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-20 19:42:16,172 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40
[2024-06-20 19:42:16,174 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 71 flow. Second operand  has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:16,174 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:42:16,174 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40
[2024-06-20 19:42:16,176 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:42:17,027 INFO  L124   PetriNetUnfolderBase]: 1650/2465 cut-off events.
[2024-06-20 19:42:17,027 INFO  L125   PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES.
[2024-06-20 19:42:17,033 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5017 conditions, 2465 events. 1650/2465 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11607 event pairs, 881 based on Foata normal form. 4/2429 useless extension candidates. Maximal degree in co-relation 5005. Up to 2444 conditions per place. 
[2024-06-20 19:42:17,042 INFO  L140   encePairwiseOnDemand]: 33/40 looper letters, 36 selfloop transitions, 4 changer transitions 0/44 dead transitions.
[2024-06-20 19:42:17,042 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 44 transitions, 183 flow
[2024-06-20 19:42:17,043 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-20 19:42:17,045 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-20 19:42:17,050 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions.
[2024-06-20 19:42:17,051 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5833333333333334
[2024-06-20 19:42:17,052 INFO  L175             Difference]: Start difference. First operand has 41 places, 31 transitions, 71 flow. Second operand 3 states and 70 transitions.
[2024-06-20 19:42:17,053 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 44 transitions, 183 flow
[2024-06-20 19:42:17,055 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 44 transitions, 178 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-20 19:42:17,057 INFO  L231             Difference]: Finished difference. Result has 41 places, 34 transitions, 98 flow
[2024-06-20 19:42:17,058 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=41, PETRI_TRANSITIONS=34}
[2024-06-20 19:42:17,060 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places.
[2024-06-20 19:42:17,061 INFO  L495      AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 98 flow
[2024-06-20 19:42:17,061 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:17,061 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:42:17,061 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:42:17,061 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-20 19:42:17,062 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:42:17,062 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:42:17,062 INFO  L85        PathProgramCache]: Analyzing trace with hash 2096760960, now seen corresponding path program 1 times
[2024-06-20 19:42:17,062 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:42:17,063 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084922149]
[2024-06-20 19:42:17,063 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:42:17,063 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:42:17,109 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:42:20,239 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:42:20,240 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:42:20,240 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084922149]
[2024-06-20 19:42:20,241 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084922149] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:42:20,241 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:42:20,241 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-20 19:42:20,241 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863413100]
[2024-06-20 19:42:20,241 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:42:20,243 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-20 19:42:20,243 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:42:20,244 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-20 19:42:20,244 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-06-20 19:42:20,315 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40
[2024-06-20 19:42:20,315 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 98 flow. Second operand  has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:20,315 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:42:20,315 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40
[2024-06-20 19:42:20,315 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:42:21,034 INFO  L124   PetriNetUnfolderBase]: 1659/2477 cut-off events.
[2024-06-20 19:42:21,034 INFO  L125   PetriNetUnfolderBase]: For 376/376 co-relation queries the response was YES.
[2024-06-20 19:42:21,038 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5687 conditions, 2477 events. 1659/2477 cut-off events. For 376/376 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11330 event pairs, 955 based on Foata normal form. 6/2483 useless extension candidates. Maximal degree in co-relation 5675. Up to 2441 conditions per place. 
[2024-06-20 19:42:21,047 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 46 selfloop transitions, 7 changer transitions 0/57 dead transitions.
[2024-06-20 19:42:21,047 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 57 transitions, 268 flow
[2024-06-20 19:42:21,048 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-20 19:42:21,048 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-20 19:42:21,050 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions.
[2024-06-20 19:42:21,050 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.55625
[2024-06-20 19:42:21,051 INFO  L175             Difference]: Start difference. First operand has 41 places, 34 transitions, 98 flow. Second operand 4 states and 89 transitions.
[2024-06-20 19:42:21,051 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 57 transitions, 268 flow
[2024-06-20 19:42:21,052 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 57 transitions, 262 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-20 19:42:21,054 INFO  L231             Difference]: Finished difference. Result has 45 places, 40 transitions, 154 flow
[2024-06-20 19:42:21,054 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=45, PETRI_TRANSITIONS=40}
[2024-06-20 19:42:21,055 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places.
[2024-06-20 19:42:21,055 INFO  L495      AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 154 flow
[2024-06-20 19:42:21,055 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:21,056 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:42:21,056 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:42:21,058 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-20 19:42:21,058 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:42:21,058 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:42:21,059 INFO  L85        PathProgramCache]: Analyzing trace with hash 575081838, now seen corresponding path program 1 times
[2024-06-20 19:42:21,059 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:42:21,065 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275483409]
[2024-06-20 19:42:21,065 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:42:21,065 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:42:21,118 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:42:24,080 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:42:24,081 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:42:24,081 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275483409]
[2024-06-20 19:42:24,081 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275483409] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:42:24,081 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:42:24,081 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-20 19:42:24,082 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636937474]
[2024-06-20 19:42:24,082 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:42:24,082 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-20 19:42:24,082 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:42:24,083 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-20 19:42:24,083 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-06-20 19:42:24,161 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40
[2024-06-20 19:42:24,161 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 154 flow. Second operand  has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:24,161 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:42:24,161 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40
[2024-06-20 19:42:24,162 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:42:25,020 INFO  L124   PetriNetUnfolderBase]: 1751/2607 cut-off events.
[2024-06-20 19:42:25,020 INFO  L125   PetriNetUnfolderBase]: For 1290/1290 co-relation queries the response was YES.
[2024-06-20 19:42:25,024 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6759 conditions, 2607 events. 1751/2607 cut-off events. For 1290/1290 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 12068 event pairs, 770 based on Foata normal form. 11/2618 useless extension candidates. Maximal degree in co-relation 6744. Up to 2426 conditions per place. 
[2024-06-20 19:42:25,034 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 62 selfloop transitions, 16 changer transitions 0/82 dead transitions.
[2024-06-20 19:42:25,034 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 82 transitions, 444 flow
[2024-06-20 19:42:25,035 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 19:42:25,035 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 19:42:25,037 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions.
[2024-06-20 19:42:25,039 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.595
[2024-06-20 19:42:25,039 INFO  L175             Difference]: Start difference. First operand has 45 places, 40 transitions, 154 flow. Second operand 5 states and 119 transitions.
[2024-06-20 19:42:25,039 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 82 transitions, 444 flow
[2024-06-20 19:42:25,041 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 82 transitions, 434 flow, removed 2 selfloop flow, removed 1 redundant places.
[2024-06-20 19:42:25,043 INFO  L231             Difference]: Finished difference. Result has 51 places, 51 transitions, 257 flow
[2024-06-20 19:42:25,043 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=257, PETRI_PLACES=51, PETRI_TRANSITIONS=51}
[2024-06-20 19:42:25,044 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places.
[2024-06-20 19:42:25,044 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 51 transitions, 257 flow
[2024-06-20 19:42:25,045 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:25,045 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:42:25,045 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:42:25,045 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-20 19:42:25,045 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:42:25,046 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:42:25,046 INFO  L85        PathProgramCache]: Analyzing trace with hash -238910817, now seen corresponding path program 1 times
[2024-06-20 19:42:25,046 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:42:25,046 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244434418]
[2024-06-20 19:42:25,046 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:42:25,046 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:42:25,105 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:42:28,163 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:42:28,163 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:42:28,163 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244434418]
[2024-06-20 19:42:28,164 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244434418] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:42:28,164 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:42:28,164 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-20 19:42:28,175 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592301377]
[2024-06-20 19:42:28,175 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:42:28,175 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-20 19:42:28,176 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:42:28,176 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-20 19:42:28,176 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-06-20 19:42:28,281 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40
[2024-06-20 19:42:28,281 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 51 transitions, 257 flow. Second operand  has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:28,281 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:42:28,281 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40
[2024-06-20 19:42:28,281 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:42:29,183 INFO  L124   PetriNetUnfolderBase]: 1819/2708 cut-off events.
[2024-06-20 19:42:29,184 INFO  L125   PetriNetUnfolderBase]: For 3467/3467 co-relation queries the response was YES.
[2024-06-20 19:42:29,188 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8341 conditions, 2708 events. 1819/2708 cut-off events. For 3467/3467 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 12473 event pairs, 572 based on Foata normal form. 9/2716 useless extension candidates. Maximal degree in co-relation 8322. Up to 2426 conditions per place. 
[2024-06-20 19:42:29,196 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 83 selfloop transitions, 25 changer transitions 0/112 dead transitions.
[2024-06-20 19:42:29,196 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 112 transitions, 717 flow
[2024-06-20 19:42:29,197 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:42:29,197 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:42:29,198 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions.
[2024-06-20 19:42:29,198 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5958333333333333
[2024-06-20 19:42:29,198 INFO  L175             Difference]: Start difference. First operand has 51 places, 51 transitions, 257 flow. Second operand 6 states and 143 transitions.
[2024-06-20 19:42:29,199 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 112 transitions, 717 flow
[2024-06-20 19:42:29,205 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 112 transitions, 705 flow, removed 6 selfloop flow, removed 0 redundant places.
[2024-06-20 19:42:29,207 INFO  L231             Difference]: Finished difference. Result has 60 places, 71 transitions, 463 flow
[2024-06-20 19:42:29,207 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=463, PETRI_PLACES=60, PETRI_TRANSITIONS=71}
[2024-06-20 19:42:29,208 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 19 predicate places.
[2024-06-20 19:42:29,209 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 71 transitions, 463 flow
[2024-06-20 19:42:29,209 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:29,209 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:42:29,209 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:42:29,209 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-20 19:42:29,209 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:42:29,210 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:42:29,210 INFO  L85        PathProgramCache]: Analyzing trace with hash 1183700845, now seen corresponding path program 1 times
[2024-06-20 19:42:29,210 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:42:29,210 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911305140]
[2024-06-20 19:42:29,210 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:42:29,210 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:42:29,270 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:42:32,503 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:42:32,503 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:42:32,503 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911305140]
[2024-06-20 19:42:32,504 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911305140] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:42:32,504 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:42:32,504 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:42:32,504 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624648417]
[2024-06-20 19:42:32,504 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:42:32,504 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:42:32,505 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:42:32,505 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:42:32,505 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:42:32,624 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40
[2024-06-20 19:42:32,625 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 71 transitions, 463 flow. Second operand  has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:32,625 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:42:32,625 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40
[2024-06-20 19:42:32,625 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:42:33,736 INFO  L124   PetriNetUnfolderBase]: 1922/2889 cut-off events.
[2024-06-20 19:42:33,737 INFO  L125   PetriNetUnfolderBase]: For 6568/6568 co-relation queries the response was YES.
[2024-06-20 19:42:33,741 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10415 conditions, 2889 events. 1922/2889 cut-off events. For 6568/6568 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 13778 event pairs, 422 based on Foata normal form. 30/2918 useless extension candidates. Maximal degree in co-relation 10390. Up to 2403 conditions per place. 
[2024-06-20 19:42:33,751 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 91 selfloop transitions, 28 changer transitions 0/123 dead transitions.
[2024-06-20 19:42:33,752 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 123 transitions, 893 flow
[2024-06-20 19:42:33,752 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:42:33,752 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:42:33,753 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions.
[2024-06-20 19:42:33,753 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5821428571428572
[2024-06-20 19:42:33,753 INFO  L175             Difference]: Start difference. First operand has 60 places, 71 transitions, 463 flow. Second operand 7 states and 163 transitions.
[2024-06-20 19:42:33,753 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 123 transitions, 893 flow
[2024-06-20 19:42:33,758 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 123 transitions, 873 flow, removed 10 selfloop flow, removed 0 redundant places.
[2024-06-20 19:42:33,759 INFO  L231             Difference]: Finished difference. Result has 66 places, 73 transitions, 528 flow
[2024-06-20 19:42:33,759 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=528, PETRI_PLACES=66, PETRI_TRANSITIONS=73}
[2024-06-20 19:42:33,760 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 25 predicate places.
[2024-06-20 19:42:33,760 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 73 transitions, 528 flow
[2024-06-20 19:42:33,760 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:33,760 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:42:33,760 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:42:33,760 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-20 19:42:33,761 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:42:33,761 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:42:33,761 INFO  L85        PathProgramCache]: Analyzing trace with hash 257532158, now seen corresponding path program 1 times
[2024-06-20 19:42:33,761 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:42:33,761 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746830681]
[2024-06-20 19:42:33,761 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:42:33,761 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:42:33,783 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:42:39,989 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:42:39,989 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:42:39,989 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746830681]
[2024-06-20 19:42:39,989 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746830681] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:42:39,989 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:42:39,989 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-20 19:42:39,989 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350056408]
[2024-06-20 19:42:39,989 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:42:39,990 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-20 19:42:39,990 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:42:39,990 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-20 19:42:39,990 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-06-20 19:42:40,121 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:42:40,121 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 73 transitions, 528 flow. Second operand  has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:40,121 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:42:40,121 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:42:40,121 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:42:41,020 INFO  L124   PetriNetUnfolderBase]: 1908/2868 cut-off events.
[2024-06-20 19:42:41,020 INFO  L125   PetriNetUnfolderBase]: For 8203/8203 co-relation queries the response was YES.
[2024-06-20 19:42:41,026 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11077 conditions, 2868 events. 1908/2868 cut-off events. For 8203/8203 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 13556 event pairs, 707 based on Foata normal form. 5/2873 useless extension candidates. Maximal degree in co-relation 11048. Up to 2823 conditions per place. 
[2024-06-20 19:42:41,037 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 76 selfloop transitions, 12 changer transitions 0/91 dead transitions.
[2024-06-20 19:42:41,037 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 91 transitions, 764 flow
[2024-06-20 19:42:41,038 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 19:42:41,038 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 19:42:41,038 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions.
[2024-06-20 19:42:41,038 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.435
[2024-06-20 19:42:41,038 INFO  L175             Difference]: Start difference. First operand has 66 places, 73 transitions, 528 flow. Second operand 5 states and 87 transitions.
[2024-06-20 19:42:41,038 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 91 transitions, 764 flow
[2024-06-20 19:42:41,044 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 91 transitions, 701 flow, removed 6 selfloop flow, removed 5 redundant places.
[2024-06-20 19:42:41,046 INFO  L231             Difference]: Finished difference. Result has 66 places, 76 transitions, 530 flow
[2024-06-20 19:42:41,046 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=530, PETRI_PLACES=66, PETRI_TRANSITIONS=76}
[2024-06-20 19:42:41,046 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 25 predicate places.
[2024-06-20 19:42:41,047 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 76 transitions, 530 flow
[2024-06-20 19:42:41,047 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:41,047 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:42:41,047 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:42:41,047 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-20 19:42:41,047 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:42:41,048 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:42:41,048 INFO  L85        PathProgramCache]: Analyzing trace with hash -606667320, now seen corresponding path program 1 times
[2024-06-20 19:42:41,048 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:42:41,048 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135225934]
[2024-06-20 19:42:41,048 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:42:41,048 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:42:41,078 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:42:48,089 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:42:48,089 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:42:48,089 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135225934]
[2024-06-20 19:42:48,090 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135225934] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:42:48,090 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:42:48,090 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:42:48,090 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947833567]
[2024-06-20 19:42:48,090 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:42:48,090 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:42:48,090 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:42:48,091 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:42:48,091 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:42:48,151 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:42:48,152 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 76 transitions, 530 flow. Second operand  has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 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-06-20 19:42:48,152 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:42:48,152 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:42:48,152 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:42:49,135 INFO  L124   PetriNetUnfolderBase]: 1928/2896 cut-off events.
[2024-06-20 19:42:49,135 INFO  L125   PetriNetUnfolderBase]: For 9781/9781 co-relation queries the response was YES.
[2024-06-20 19:42:49,142 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11369 conditions, 2896 events. 1928/2896 cut-off events. For 9781/9781 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 13656 event pairs, 686 based on Foata normal form. 10/2906 useless extension candidates. Maximal degree in co-relation 11338. Up to 2811 conditions per place. 
[2024-06-20 19:42:49,152 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 79 selfloop transitions, 19 changer transitions 0/101 dead transitions.
[2024-06-20 19:42:49,152 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 101 transitions, 802 flow
[2024-06-20 19:42:49,153 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:42:49,153 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:42:49,153 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions.
[2024-06-20 19:42:49,154 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4375
[2024-06-20 19:42:49,154 INFO  L175             Difference]: Start difference. First operand has 66 places, 76 transitions, 530 flow. Second operand 6 states and 105 transitions.
[2024-06-20 19:42:49,154 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 101 transitions, 802 flow
[2024-06-20 19:42:49,160 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 101 transitions, 773 flow, removed 6 selfloop flow, removed 3 redundant places.
[2024-06-20 19:42:49,162 INFO  L231             Difference]: Finished difference. Result has 69 places, 80 transitions, 586 flow
[2024-06-20 19:42:49,162 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=586, PETRI_PLACES=69, PETRI_TRANSITIONS=80}
[2024-06-20 19:42:49,162 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 28 predicate places.
[2024-06-20 19:42:49,162 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 80 transitions, 586 flow
[2024-06-20 19:42:49,163 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 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-06-20 19:42:49,163 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:42:49,163 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:42:49,163 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-20 19:42:49,163 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:42:49,163 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:42:49,164 INFO  L85        PathProgramCache]: Analyzing trace with hash -1826477957, now seen corresponding path program 1 times
[2024-06-20 19:42:49,164 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:42:49,164 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093221393]
[2024-06-20 19:42:49,164 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:42:49,164 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:42:49,201 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:42:54,482 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:42:54,482 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:42:54,482 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093221393]
[2024-06-20 19:42:54,483 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093221393] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:42:54,483 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:42:54,483 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:42:54,483 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403811199]
[2024-06-20 19:42:54,483 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:42:54,483 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:42:54,483 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:42:54,484 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:42:54,484 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:42:54,543 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:42:54,543 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 80 transitions, 586 flow. Second operand  has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 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-06-20 19:42:54,543 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:42:54,544 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:42:54,544 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:42:55,410 INFO  L124   PetriNetUnfolderBase]: 1940/2915 cut-off events.
[2024-06-20 19:42:55,410 INFO  L125   PetriNetUnfolderBase]: For 11484/11486 co-relation queries the response was YES.
[2024-06-20 19:42:55,416 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12169 conditions, 2915 events. 1940/2915 cut-off events. For 11484/11486 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 13813 event pairs, 672 based on Foata normal form. 12/2927 useless extension candidates. Maximal degree in co-relation 12137. Up to 2722 conditions per place. 
[2024-06-20 19:42:55,424 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 85 selfloop transitions, 23 changer transitions 0/111 dead transitions.
[2024-06-20 19:42:55,425 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 111 transitions, 943 flow
[2024-06-20 19:42:55,425 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:42:55,426 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:42:55,426 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions.
[2024-06-20 19:42:55,426 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4583333333333333
[2024-06-20 19:42:55,426 INFO  L175             Difference]: Start difference. First operand has 69 places, 80 transitions, 586 flow. Second operand 6 states and 110 transitions.
[2024-06-20 19:42:55,426 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 111 transitions, 943 flow
[2024-06-20 19:42:55,433 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 111 transitions, 892 flow, removed 11 selfloop flow, removed 4 redundant places.
[2024-06-20 19:42:55,435 INFO  L231             Difference]: Finished difference. Result has 71 places, 84 transitions, 634 flow
[2024-06-20 19:42:55,435 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=634, PETRI_PLACES=71, PETRI_TRANSITIONS=84}
[2024-06-20 19:42:55,435 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 30 predicate places.
[2024-06-20 19:42:55,435 INFO  L495      AbstractCegarLoop]: Abstraction has has 71 places, 84 transitions, 634 flow
[2024-06-20 19:42:55,436 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 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-06-20 19:42:55,436 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:42:55,436 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:42:55,436 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-20 19:42:55,436 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:42:55,436 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:42:55,436 INFO  L85        PathProgramCache]: Analyzing trace with hash -2132639827, now seen corresponding path program 2 times
[2024-06-20 19:42:55,437 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:42:55,437 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155802743]
[2024-06-20 19:42:55,437 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:42:55,437 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:42:55,466 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:43:00,450 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:43:00,450 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:43:00,450 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155802743]
[2024-06-20 19:43:00,450 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155802743] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:43:00,450 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:43:00,450 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:43:00,450 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388694675]
[2024-06-20 19:43:00,451 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:43:00,451 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:43:00,451 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:43:00,451 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:43:00,451 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:43:00,514 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:43:00,514 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 84 transitions, 634 flow. Second operand  has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 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-06-20 19:43:00,514 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:43:00,514 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:43:00,514 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:43:01,352 INFO  L124   PetriNetUnfolderBase]: 1910/2868 cut-off events.
[2024-06-20 19:43:01,352 INFO  L125   PetriNetUnfolderBase]: For 12800/12800 co-relation queries the response was YES.
[2024-06-20 19:43:01,358 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12216 conditions, 2868 events. 1910/2868 cut-off events. For 12800/12800 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 13566 event pairs, 691 based on Foata normal form. 5/2873 useless extension candidates. Maximal degree in co-relation 12183. Up to 2829 conditions per place. 
[2024-06-20 19:43:01,366 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 87 selfloop transitions, 12 changer transitions 0/102 dead transitions.
[2024-06-20 19:43:01,367 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 102 transitions, 881 flow
[2024-06-20 19:43:01,367 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:43:01,367 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:43:01,367 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions.
[2024-06-20 19:43:01,368 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4083333333333333
[2024-06-20 19:43:01,368 INFO  L175             Difference]: Start difference. First operand has 71 places, 84 transitions, 634 flow. Second operand 6 states and 98 transitions.
[2024-06-20 19:43:01,368 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 102 transitions, 881 flow
[2024-06-20 19:43:01,376 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 102 transitions, 848 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-06-20 19:43:01,378 INFO  L231             Difference]: Finished difference. Result has 74 places, 84 transitions, 634 flow
[2024-06-20 19:43:01,378 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=634, PETRI_PLACES=74, PETRI_TRANSITIONS=84}
[2024-06-20 19:43:01,378 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 33 predicate places.
[2024-06-20 19:43:01,378 INFO  L495      AbstractCegarLoop]: Abstraction has has 74 places, 84 transitions, 634 flow
[2024-06-20 19:43:01,379 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 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-06-20 19:43:01,379 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:43:01,379 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:43:01,379 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-20 19:43:01,379 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:43:01,379 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:43:01,379 INFO  L85        PathProgramCache]: Analyzing trace with hash -1893055063, now seen corresponding path program 1 times
[2024-06-20 19:43:01,380 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:43:01,380 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56450274]
[2024-06-20 19:43:01,380 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:43:01,380 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:43:01,408 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:43:07,500 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:43:07,501 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:43:07,501 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56450274]
[2024-06-20 19:43:07,501 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56450274] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:43:07,501 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:43:07,501 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:43:07,501 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593248]
[2024-06-20 19:43:07,501 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:43:07,501 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:43:07,501 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:43:07,502 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:43:07,502 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:43:07,638 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:43:07,638 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 84 transitions, 634 flow. Second operand  has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:43:07,638 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:43:07,638 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:43:07,638 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:43:08,596 INFO  L124   PetriNetUnfolderBase]: 1982/2975 cut-off events.
[2024-06-20 19:43:08,596 INFO  L125   PetriNetUnfolderBase]: For 15222/15224 co-relation queries the response was YES.
[2024-06-20 19:43:08,601 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12765 conditions, 2975 events. 1982/2975 cut-off events. For 15222/15224 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 14145 event pairs, 536 based on Foata normal form. 14/2989 useless extension candidates. Maximal degree in co-relation 12731. Up to 2602 conditions per place. 
[2024-06-20 19:43:08,609 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 96 selfloop transitions, 37 changer transitions 0/136 dead transitions.
[2024-06-20 19:43:08,610 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 136 transitions, 1178 flow
[2024-06-20 19:43:08,611 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:43:08,611 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:43:08,612 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions.
[2024-06-20 19:43:08,612 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45
[2024-06-20 19:43:08,612 INFO  L175             Difference]: Start difference. First operand has 74 places, 84 transitions, 634 flow. Second operand 8 states and 144 transitions.
[2024-06-20 19:43:08,612 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 136 transitions, 1178 flow
[2024-06-20 19:43:08,622 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 136 transitions, 1108 flow, removed 6 selfloop flow, removed 6 redundant places.
[2024-06-20 19:43:08,624 INFO  L231             Difference]: Finished difference. Result has 78 places, 100 transitions, 807 flow
[2024-06-20 19:43:08,624 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=807, PETRI_PLACES=78, PETRI_TRANSITIONS=100}
[2024-06-20 19:43:08,624 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 37 predicate places.
[2024-06-20 19:43:08,625 INFO  L495      AbstractCegarLoop]: Abstraction has has 78 places, 100 transitions, 807 flow
[2024-06-20 19:43:08,625 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:43:08,625 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:43:08,625 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:43:08,625 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-20 19:43:08,625 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:43:08,625 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:43:08,626 INFO  L85        PathProgramCache]: Analyzing trace with hash 1329927319, now seen corresponding path program 2 times
[2024-06-20 19:43:08,626 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:43:08,626 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711523914]
[2024-06-20 19:43:08,626 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:43:08,626 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:43:08,653 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:43:13,847 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:43:13,847 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:43:13,847 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711523914]
[2024-06-20 19:43:13,847 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711523914] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:43:13,847 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:43:13,847 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:43:13,847 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424250768]
[2024-06-20 19:43:13,847 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:43:13,848 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:43:13,848 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:43:13,848 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:43:13,848 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:43:13,954 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:43:13,954 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 100 transitions, 807 flow. Second operand  has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:43:13,954 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:43:13,955 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:43:13,955 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:43:14,941 INFO  L124   PetriNetUnfolderBase]: 2004/3006 cut-off events.
[2024-06-20 19:43:14,941 INFO  L125   PetriNetUnfolderBase]: For 17993/17993 co-relation queries the response was YES.
[2024-06-20 19:43:14,948 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13987 conditions, 3006 events. 2004/3006 cut-off events. For 17993/17993 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 14256 event pairs, 608 based on Foata normal form. 4/3010 useless extension candidates. Maximal degree in co-relation 13951. Up to 2949 conditions per place. 
[2024-06-20 19:43:14,956 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 110 selfloop transitions, 17 changer transitions 0/130 dead transitions.
[2024-06-20 19:43:14,956 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 130 transitions, 1171 flow
[2024-06-20 19:43:14,958 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:43:14,958 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:43:14,958 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions.
[2024-06-20 19:43:14,958 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3875
[2024-06-20 19:43:14,958 INFO  L175             Difference]: Start difference. First operand has 78 places, 100 transitions, 807 flow. Second operand 8 states and 124 transitions.
[2024-06-20 19:43:14,958 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 130 transitions, 1171 flow
[2024-06-20 19:43:14,972 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 130 transitions, 1129 flow, removed 12 selfloop flow, removed 3 redundant places.
[2024-06-20 19:43:14,974 INFO  L231             Difference]: Finished difference. Result has 84 places, 106 transitions, 869 flow
[2024-06-20 19:43:14,974 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=869, PETRI_PLACES=84, PETRI_TRANSITIONS=106}
[2024-06-20 19:43:14,975 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 43 predicate places.
[2024-06-20 19:43:14,975 INFO  L495      AbstractCegarLoop]: Abstraction has has 84 places, 106 transitions, 869 flow
[2024-06-20 19:43:14,975 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:43:14,975 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:43:14,975 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:43:14,975 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-20 19:43:14,976 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:43:14,976 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:43:14,976 INFO  L85        PathProgramCache]: Analyzing trace with hash 1108045129, now seen corresponding path program 3 times
[2024-06-20 19:43:14,976 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:43:14,976 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622867215]
[2024-06-20 19:43:14,976 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:43:14,976 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:43:15,004 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:43:20,822 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:43:20,822 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:43:20,822 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622867215]
[2024-06-20 19:43:20,822 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622867215] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:43:20,822 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:43:20,822 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:43:20,822 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75529161]
[2024-06-20 19:43:20,822 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:43:20,823 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:43:20,823 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:43:20,823 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:43:20,823 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:43:20,955 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:43:20,955 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 106 transitions, 869 flow. Second operand  has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:43:20,955 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:43:20,955 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:43:20,955 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:43:21,946 INFO  L124   PetriNetUnfolderBase]: 2010/3015 cut-off events.
[2024-06-20 19:43:21,947 INFO  L125   PetriNetUnfolderBase]: For 20173/20173 co-relation queries the response was YES.
[2024-06-20 19:43:21,953 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14475 conditions, 3015 events. 2010/3015 cut-off events. For 20173/20173 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 14287 event pairs, 608 based on Foata normal form. 4/3019 useless extension candidates. Maximal degree in co-relation 14437. Up to 2920 conditions per place. 
[2024-06-20 19:43:21,960 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 111 selfloop transitions, 24 changer transitions 0/138 dead transitions.
[2024-06-20 19:43:21,960 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 138 transitions, 1303 flow
[2024-06-20 19:43:21,962 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:43:21,962 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:43:21,962 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions.
[2024-06-20 19:43:21,962 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.403125
[2024-06-20 19:43:21,962 INFO  L175             Difference]: Start difference. First operand has 84 places, 106 transitions, 869 flow. Second operand 8 states and 129 transitions.
[2024-06-20 19:43:21,962 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 138 transitions, 1303 flow
[2024-06-20 19:43:21,975 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 138 transitions, 1269 flow, removed 3 selfloop flow, removed 5 redundant places.
[2024-06-20 19:43:21,977 INFO  L231             Difference]: Finished difference. Result has 88 places, 111 transitions, 956 flow
[2024-06-20 19:43:21,977 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=835, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=956, PETRI_PLACES=88, PETRI_TRANSITIONS=111}
[2024-06-20 19:43:21,977 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 47 predicate places.
[2024-06-20 19:43:21,978 INFO  L495      AbstractCegarLoop]: Abstraction has has 88 places, 111 transitions, 956 flow
[2024-06-20 19:43:21,978 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:43:21,978 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:43:21,978 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:43:21,978 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-20 19:43:21,978 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:43:21,979 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:43:21,979 INFO  L85        PathProgramCache]: Analyzing trace with hash 1108291207, now seen corresponding path program 1 times
[2024-06-20 19:43:21,979 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:43:21,979 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382828033]
[2024-06-20 19:43:21,979 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:43:21,979 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:43:22,015 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:43:29,088 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:43:29,088 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:43:29,088 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382828033]
[2024-06-20 19:43:29,089 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382828033] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:43:29,089 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:43:29,089 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:43:29,089 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842084183]
[2024-06-20 19:43:29,089 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:43:29,089 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:43:29,090 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:43:29,090 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:43:29,090 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:43:29,236 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:43:29,236 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 111 transitions, 956 flow. Second operand  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:43:29,236 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:43:29,236 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:43:29,236 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:43:30,363 INFO  L124   PetriNetUnfolderBase]: 2054/3083 cut-off events.
[2024-06-20 19:43:30,363 INFO  L125   PetriNetUnfolderBase]: For 23713/23713 co-relation queries the response was YES.
[2024-06-20 19:43:30,371 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15039 conditions, 3083 events. 2054/3083 cut-off events. For 23713/23713 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 14615 event pairs, 576 based on Foata normal form. 18/3101 useless extension candidates. Maximal degree in co-relation 14999. Up to 2922 conditions per place. 
[2024-06-20 19:43:30,380 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 118 selfloop transitions, 24 changer transitions 0/145 dead transitions.
[2024-06-20 19:43:30,380 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 145 transitions, 1364 flow
[2024-06-20 19:43:30,381 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:43:30,381 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:43:30,381 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions.
[2024-06-20 19:43:30,381 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44642857142857145
[2024-06-20 19:43:30,381 INFO  L175             Difference]: Start difference. First operand has 88 places, 111 transitions, 956 flow. Second operand 7 states and 125 transitions.
[2024-06-20 19:43:30,381 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 145 transitions, 1364 flow
[2024-06-20 19:43:30,396 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 145 transitions, 1336 flow, removed 6 selfloop flow, removed 4 redundant places.
[2024-06-20 19:43:30,398 INFO  L231             Difference]: Finished difference. Result has 91 places, 114 transitions, 1020 flow
[2024-06-20 19:43:30,398 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=928, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1020, PETRI_PLACES=91, PETRI_TRANSITIONS=114}
[2024-06-20 19:43:30,398 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 50 predicate places.
[2024-06-20 19:43:30,399 INFO  L495      AbstractCegarLoop]: Abstraction has has 91 places, 114 transitions, 1020 flow
[2024-06-20 19:43:30,399 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:43:30,399 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:43:30,399 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:43:30,399 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-20 19:43:30,399 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:43:30,400 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:43:30,400 INFO  L85        PathProgramCache]: Analyzing trace with hash 1392524634, now seen corresponding path program 1 times
[2024-06-20 19:43:30,400 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:43:30,400 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661936329]
[2024-06-20 19:43:30,400 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:43:30,400 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:43:30,431 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:43:36,609 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:43:36,609 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:43:36,609 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661936329]
[2024-06-20 19:43:36,609 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661936329] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:43:36,609 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:43:36,609 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:43:36,609 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055660207]
[2024-06-20 19:43:36,609 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:43:36,610 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:43:36,610 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:43:36,610 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:43:36,610 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:43:36,749 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:43:36,749 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 114 transitions, 1020 flow. Second operand  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:43:36,749 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:43:36,749 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:43:36,749 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:43:37,926 INFO  L124   PetriNetUnfolderBase]: 2134/3196 cut-off events.
[2024-06-20 19:43:37,926 INFO  L125   PetriNetUnfolderBase]: For 26419/26421 co-relation queries the response was YES.
[2024-06-20 19:43:37,934 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16240 conditions, 3196 events. 2134/3196 cut-off events. For 26419/26421 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 15206 event pairs, 589 based on Foata normal form. 7/3203 useless extension candidates. Maximal degree in co-relation 16198. Up to 2786 conditions per place. 
[2024-06-20 19:43:37,942 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 123 selfloop transitions, 45 changer transitions 0/171 dead transitions.
[2024-06-20 19:43:37,942 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 171 transitions, 1743 flow
[2024-06-20 19:43:37,943 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:43:37,943 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:43:37,943 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions.
[2024-06-20 19:43:37,943 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4785714285714286
[2024-06-20 19:43:37,944 INFO  L175             Difference]: Start difference. First operand has 91 places, 114 transitions, 1020 flow. Second operand 7 states and 134 transitions.
[2024-06-20 19:43:37,944 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 171 transitions, 1743 flow
[2024-06-20 19:43:37,961 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 171 transitions, 1691 flow, removed 5 selfloop flow, removed 5 redundant places.
[2024-06-20 19:43:37,963 INFO  L231             Difference]: Finished difference. Result has 95 places, 133 transitions, 1308 flow
[2024-06-20 19:43:37,963 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=968, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1308, PETRI_PLACES=95, PETRI_TRANSITIONS=133}
[2024-06-20 19:43:37,963 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 54 predicate places.
[2024-06-20 19:43:37,964 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 133 transitions, 1308 flow
[2024-06-20 19:43:37,964 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:43:37,964 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:43:37,964 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:43:37,964 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-20 19:43:37,964 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:43:37,964 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:43:37,965 INFO  L85        PathProgramCache]: Analyzing trace with hash 1441111214, now seen corresponding path program 2 times
[2024-06-20 19:43:37,965 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:43:37,965 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458728322]
[2024-06-20 19:43:37,965 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:43:37,965 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:43:37,995 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:43:44,175 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:43:44,176 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:43:44,176 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458728322]
[2024-06-20 19:43:44,176 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458728322] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:43:44,176 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:43:44,176 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:43:44,176 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485642587]
[2024-06-20 19:43:44,176 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:43:44,176 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:43:44,176 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:43:44,177 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:43:44,177 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:43:44,295 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:43:44,296 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 133 transitions, 1308 flow. Second operand  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:43:44,296 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:43:44,296 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:43:44,296 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:43:45,316 INFO  L124   PetriNetUnfolderBase]: 2138/3200 cut-off events.
[2024-06-20 19:43:45,316 INFO  L125   PetriNetUnfolderBase]: For 31180/31182 co-relation queries the response was YES.
[2024-06-20 19:43:45,326 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17578 conditions, 3200 events. 2138/3200 cut-off events. For 31180/31182 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 15224 event pairs, 620 based on Foata normal form. 7/3207 useless extension candidates. Maximal degree in co-relation 17533. Up to 3003 conditions per place. 
[2024-06-20 19:43:45,335 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 130 selfloop transitions, 33 changer transitions 0/166 dead transitions.
[2024-06-20 19:43:45,335 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 166 transitions, 1785 flow
[2024-06-20 19:43:45,336 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:43:45,336 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:43:45,336 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions.
[2024-06-20 19:43:45,336 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44642857142857145
[2024-06-20 19:43:45,336 INFO  L175             Difference]: Start difference. First operand has 95 places, 133 transitions, 1308 flow. Second operand 7 states and 125 transitions.
[2024-06-20 19:43:45,336 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 166 transitions, 1785 flow
[2024-06-20 19:43:45,359 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 166 transitions, 1726 flow, removed 24 selfloop flow, removed 2 redundant places.
[2024-06-20 19:43:45,361 INFO  L231             Difference]: Finished difference. Result has 100 places, 137 transitions, 1384 flow
[2024-06-20 19:43:45,361 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1253, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1384, PETRI_PLACES=100, PETRI_TRANSITIONS=137}
[2024-06-20 19:43:45,362 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 59 predicate places.
[2024-06-20 19:43:45,362 INFO  L495      AbstractCegarLoop]: Abstraction has has 100 places, 137 transitions, 1384 flow
[2024-06-20 19:43:45,362 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:43:45,362 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:43:45,363 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:43:45,363 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-20 19:43:45,363 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:43:45,364 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:43:45,364 INFO  L85        PathProgramCache]: Analyzing trace with hash 1396339649, now seen corresponding path program 1 times
[2024-06-20 19:43:45,364 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:43:45,364 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052796097]
[2024-06-20 19:43:45,364 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:43:45,364 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:43:45,396 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:43:51,492 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:43:51,492 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:43:51,492 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052796097]
[2024-06-20 19:43:51,492 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052796097] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:43:51,492 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:43:51,492 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:43:51,493 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455791773]
[2024-06-20 19:43:51,493 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:43:51,493 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:43:51,493 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:43:51,493 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:43:51,494 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:43:51,664 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:43:51,665 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 137 transitions, 1384 flow. Second operand  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:43:51,665 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:43:51,665 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:43:51,665 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:43:52,904 INFO  L124   PetriNetUnfolderBase]: 2655/3918 cut-off events.
[2024-06-20 19:43:52,904 INFO  L125   PetriNetUnfolderBase]: For 43882/43884 co-relation queries the response was YES.
[2024-06-20 19:43:52,915 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22079 conditions, 3918 events. 2655/3918 cut-off events. For 43882/43884 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 19028 event pairs, 563 based on Foata normal form. 12/3930 useless extension candidates. Maximal degree in co-relation 22032. Up to 2958 conditions per place. 
[2024-06-20 19:43:52,926 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 122 selfloop transitions, 88 changer transitions 0/213 dead transitions.
[2024-06-20 19:43:52,926 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 213 transitions, 2390 flow
[2024-06-20 19:43:52,927 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:43:52,927 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:43:52,927 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions.
[2024-06-20 19:43:52,928 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4875
[2024-06-20 19:43:52,928 INFO  L175             Difference]: Start difference. First operand has 100 places, 137 transitions, 1384 flow. Second operand 8 states and 156 transitions.
[2024-06-20 19:43:52,928 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 213 transitions, 2390 flow
[2024-06-20 19:43:52,967 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 213 transitions, 2299 flow, removed 16 selfloop flow, removed 5 redundant places.
[2024-06-20 19:43:52,969 INFO  L231             Difference]: Finished difference. Result has 105 places, 169 transitions, 1916 flow
[2024-06-20 19:43:52,969 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1295, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1916, PETRI_PLACES=105, PETRI_TRANSITIONS=169}
[2024-06-20 19:43:52,970 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 64 predicate places.
[2024-06-20 19:43:52,970 INFO  L495      AbstractCegarLoop]: Abstraction has has 105 places, 169 transitions, 1916 flow
[2024-06-20 19:43:52,970 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:43:52,970 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:43:52,970 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:43:52,971 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-20 19:43:52,971 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:43:52,971 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:43:52,971 INFO  L85        PathProgramCache]: Analyzing trace with hash 1396334069, now seen corresponding path program 2 times
[2024-06-20 19:43:52,971 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:43:52,971 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421776032]
[2024-06-20 19:43:52,971 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:43:52,972 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:43:53,001 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:43:59,068 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:43:59,068 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:43:59,068 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421776032]
[2024-06-20 19:43:59,069 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421776032] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:43:59,069 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:43:59,069 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:43:59,069 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019433671]
[2024-06-20 19:43:59,069 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:43:59,069 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:43:59,069 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:43:59,070 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:43:59,070 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:43:59,175 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:43:59,175 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 169 transitions, 1916 flow. Second operand  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:43:59,175 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:43:59,175 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:43:59,175 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:44:00,513 INFO  L124   PetriNetUnfolderBase]: 2815/4142 cut-off events.
[2024-06-20 19:44:00,513 INFO  L125   PetriNetUnfolderBase]: For 55818/55820 co-relation queries the response was YES.
[2024-06-20 19:44:00,526 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25880 conditions, 4142 events. 2815/4142 cut-off events. For 55818/55820 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 20234 event pairs, 565 based on Foata normal form. 22/4164 useless extension candidates. Maximal degree in co-relation 25830. Up to 3066 conditions per place. 
[2024-06-20 19:44:00,539 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 128 selfloop transitions, 102 changer transitions 0/233 dead transitions.
[2024-06-20 19:44:00,539 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 233 transitions, 2916 flow
[2024-06-20 19:44:00,540 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:44:00,540 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:44:00,540 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions.
[2024-06-20 19:44:00,542 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.503125
[2024-06-20 19:44:00,542 INFO  L175             Difference]: Start difference. First operand has 105 places, 169 transitions, 1916 flow. Second operand 8 states and 161 transitions.
[2024-06-20 19:44:00,542 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 233 transitions, 2916 flow
[2024-06-20 19:44:00,591 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 233 transitions, 2839 flow, removed 32 selfloop flow, removed 2 redundant places.
[2024-06-20 19:44:00,594 INFO  L231             Difference]: Finished difference. Result has 113 places, 187 transitions, 2426 flow
[2024-06-20 19:44:00,594 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1851, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2426, PETRI_PLACES=113, PETRI_TRANSITIONS=187}
[2024-06-20 19:44:00,595 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 72 predicate places.
[2024-06-20 19:44:00,595 INFO  L495      AbstractCegarLoop]: Abstraction has has 113 places, 187 transitions, 2426 flow
[2024-06-20 19:44:00,595 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:44:00,595 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:44:00,595 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:44:00,595 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-20 19:44:00,595 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:44:00,596 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:44:00,596 INFO  L85        PathProgramCache]: Analyzing trace with hash -1701369453, now seen corresponding path program 3 times
[2024-06-20 19:44:00,596 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:44:00,596 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892010411]
[2024-06-20 19:44:00,596 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:44:00,596 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:44:00,625 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:44:06,271 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:44:06,272 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:44:06,272 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892010411]
[2024-06-20 19:44:06,273 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892010411] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:44:06,273 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:44:06,273 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:44:06,273 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420868122]
[2024-06-20 19:44:06,273 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:44:06,273 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:44:06,273 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:44:06,273 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:44:06,273 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:44:06,369 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:44:06,369 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 187 transitions, 2426 flow. Second operand  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:44:06,369 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:44:06,369 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:44:06,369 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:44:07,714 INFO  L124   PetriNetUnfolderBase]: 2877/4227 cut-off events.
[2024-06-20 19:44:07,715 INFO  L125   PetriNetUnfolderBase]: For 63230/63232 co-relation queries the response was YES.
[2024-06-20 19:44:07,729 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28317 conditions, 4227 events. 2877/4227 cut-off events. For 63230/63232 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 20549 event pairs, 684 based on Foata normal form. 12/4239 useless extension candidates. Maximal degree in co-relation 28262. Up to 4025 conditions per place. 
[2024-06-20 19:44:07,742 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 192 selfloop transitions, 39 changer transitions 0/234 dead transitions.
[2024-06-20 19:44:07,742 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 234 transitions, 3199 flow
[2024-06-20 19:44:07,743 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:44:07,743 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:44:07,743 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions.
[2024-06-20 19:44:07,744 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.446875
[2024-06-20 19:44:07,744 INFO  L175             Difference]: Start difference. First operand has 113 places, 187 transitions, 2426 flow. Second operand 8 states and 143 transitions.
[2024-06-20 19:44:07,744 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 234 transitions, 3199 flow
[2024-06-20 19:44:07,810 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 234 transitions, 3063 flow, removed 14 selfloop flow, removed 4 redundant places.
[2024-06-20 19:44:07,813 INFO  L231             Difference]: Finished difference. Result has 119 places, 203 transitions, 2623 flow
[2024-06-20 19:44:07,813 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2303, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2623, PETRI_PLACES=119, PETRI_TRANSITIONS=203}
[2024-06-20 19:44:07,813 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 78 predicate places.
[2024-06-20 19:44:07,813 INFO  L495      AbstractCegarLoop]: Abstraction has has 119 places, 203 transitions, 2623 flow
[2024-06-20 19:44:07,814 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:44:07,814 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:44:07,814 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:44:07,814 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-20 19:44:07,814 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:44:07,814 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:44:07,814 INFO  L85        PathProgramCache]: Analyzing trace with hash -1721658116, now seen corresponding path program 1 times
[2024-06-20 19:44:07,814 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:44:07,814 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282562268]
[2024-06-20 19:44:07,814 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:44:07,814 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:44:07,849 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:44:13,673 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:44:13,673 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:44:13,673 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282562268]
[2024-06-20 19:44:13,674 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282562268] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:44:13,674 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:44:13,674 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:44:13,674 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548530907]
[2024-06-20 19:44:13,674 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:44:13,674 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:44:13,674 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:44:13,675 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:44:13,675 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:44:13,760 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:44:13,761 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 203 transitions, 2623 flow. Second operand  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:44:13,761 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:44:13,761 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:44:13,761 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:44:15,080 INFO  L124   PetriNetUnfolderBase]: 2872/4219 cut-off events.
[2024-06-20 19:44:15,080 INFO  L125   PetriNetUnfolderBase]: For 67645/67645 co-relation queries the response was YES.
[2024-06-20 19:44:15,094 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28790 conditions, 4219 events. 2872/4219 cut-off events. For 67645/67645 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 20468 event pairs, 772 based on Foata normal form. 2/4221 useless extension candidates. Maximal degree in co-relation 28732. Up to 4153 conditions per place. 
[2024-06-20 19:44:15,108 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 202 selfloop transitions, 19 changer transitions 0/224 dead transitions.
[2024-06-20 19:44:15,108 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 224 transitions, 3137 flow
[2024-06-20 19:44:15,110 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:44:15,110 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:44:15,110 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions.
[2024-06-20 19:44:15,111 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3964285714285714
[2024-06-20 19:44:15,111 INFO  L175             Difference]: Start difference. First operand has 119 places, 203 transitions, 2623 flow. Second operand 7 states and 111 transitions.
[2024-06-20 19:44:15,111 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 224 transitions, 3137 flow
[2024-06-20 19:44:15,185 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 224 transitions, 3031 flow, removed 26 selfloop flow, removed 4 redundant places.
[2024-06-20 19:44:15,188 INFO  L231             Difference]: Finished difference. Result has 122 places, 204 transitions, 2589 flow
[2024-06-20 19:44:15,188 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2519, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2589, PETRI_PLACES=122, PETRI_TRANSITIONS=204}
[2024-06-20 19:44:15,189 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 81 predicate places.
[2024-06-20 19:44:15,189 INFO  L495      AbstractCegarLoop]: Abstraction has has 122 places, 204 transitions, 2589 flow
[2024-06-20 19:44:15,189 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:44:15,189 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:44:15,189 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:44:15,189 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-20 19:44:15,190 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:44:15,190 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:44:15,190 INFO  L85        PathProgramCache]: Analyzing trace with hash 1721918604, now seen corresponding path program 1 times
[2024-06-20 19:44:15,190 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:44:15,190 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219348768]
[2024-06-20 19:44:15,190 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:44:15,190 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:44:15,222 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:44:21,985 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:44:21,985 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:44:21,985 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219348768]
[2024-06-20 19:44:21,985 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219348768] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:44:21,985 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:44:21,986 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:44:21,986 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631315337]
[2024-06-20 19:44:21,986 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:44:21,986 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:44:21,986 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:44:21,987 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:44:21,987 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:44:22,153 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:44:22,154 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 204 transitions, 2589 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:44:22,154 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:44:22,154 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:44:22,154 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:44:23,646 INFO  L124   PetriNetUnfolderBase]: 3139/4623 cut-off events.
[2024-06-20 19:44:23,646 INFO  L125   PetriNetUnfolderBase]: For 81341/81343 co-relation queries the response was YES.
[2024-06-20 19:44:23,663 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31218 conditions, 4623 events. 3139/4623 cut-off events. For 81341/81343 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 23049 event pairs, 644 based on Foata normal form. 18/4641 useless extension candidates. Maximal degree in co-relation 31159. Up to 3982 conditions per place. 
[2024-06-20 19:44:23,679 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 210 selfloop transitions, 52 changer transitions 0/265 dead transitions.
[2024-06-20 19:44:23,679 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 265 transitions, 3602 flow
[2024-06-20 19:44:23,681 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:44:23,681 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:44:23,681 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions.
[2024-06-20 19:44:23,681 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.478125
[2024-06-20 19:44:23,682 INFO  L175             Difference]: Start difference. First operand has 122 places, 204 transitions, 2589 flow. Second operand 8 states and 153 transitions.
[2024-06-20 19:44:23,682 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 265 transitions, 3602 flow
[2024-06-20 19:44:23,757 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 265 transitions, 3570 flow, removed 1 selfloop flow, removed 5 redundant places.
[2024-06-20 19:44:23,760 INFO  L231             Difference]: Finished difference. Result has 127 places, 218 transitions, 2909 flow
[2024-06-20 19:44:23,760 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2557, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2909, PETRI_PLACES=127, PETRI_TRANSITIONS=218}
[2024-06-20 19:44:23,761 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 86 predicate places.
[2024-06-20 19:44:23,761 INFO  L495      AbstractCegarLoop]: Abstraction has has 127 places, 218 transitions, 2909 flow
[2024-06-20 19:44:23,761 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:44:23,761 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:44:23,761 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:44:23,761 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-20 19:44:23,761 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:44:23,762 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:44:23,762 INFO  L85        PathProgramCache]: Analyzing trace with hash 1721979054, now seen corresponding path program 2 times
[2024-06-20 19:44:23,762 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:44:23,762 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394659179]
[2024-06-20 19:44:23,762 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:44:23,762 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:44:23,792 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:44:30,376 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:44:30,377 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:44:30,377 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394659179]
[2024-06-20 19:44:30,377 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394659179] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:44:30,377 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:44:30,377 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:44:30,377 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150888179]
[2024-06-20 19:44:30,377 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:44:30,378 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:44:30,378 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:44:30,378 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:44:30,378 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:44:30,446 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:44:30,446 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 218 transitions, 2909 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:44:30,446 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:44:30,446 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:44:30,446 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:44:31,900 INFO  L124   PetriNetUnfolderBase]: 3216/4746 cut-off events.
[2024-06-20 19:44:31,900 INFO  L125   PetriNetUnfolderBase]: For 92684/92686 co-relation queries the response was YES.
[2024-06-20 19:44:31,917 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33423 conditions, 4746 events. 3216/4746 cut-off events. For 92684/92686 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 23923 event pairs, 825 based on Foata normal form. 18/4764 useless extension candidates. Maximal degree in co-relation 33361. Up to 4387 conditions per place. 
[2024-06-20 19:44:31,933 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 212 selfloop transitions, 47 changer transitions 0/262 dead transitions.
[2024-06-20 19:44:31,933 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 262 transitions, 3687 flow
[2024-06-20 19:44:31,934 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:44:31,934 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:44:31,934 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions.
[2024-06-20 19:44:31,935 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4625
[2024-06-20 19:44:31,935 INFO  L175             Difference]: Start difference. First operand has 127 places, 218 transitions, 2909 flow. Second operand 8 states and 148 transitions.
[2024-06-20 19:44:31,935 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 262 transitions, 3687 flow
[2024-06-20 19:44:32,019 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 262 transitions, 3617 flow, removed 23 selfloop flow, removed 3 redundant places.
[2024-06-20 19:44:32,022 INFO  L231             Difference]: Finished difference. Result has 133 places, 222 transitions, 3038 flow
[2024-06-20 19:44:32,023 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2849, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3038, PETRI_PLACES=133, PETRI_TRANSITIONS=222}
[2024-06-20 19:44:32,023 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 92 predicate places.
[2024-06-20 19:44:32,023 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 222 transitions, 3038 flow
[2024-06-20 19:44:32,023 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:44:32,023 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:44:32,023 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:44:32,023 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-20 19:44:32,023 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:44:32,024 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:44:32,024 INFO  L85        PathProgramCache]: Analyzing trace with hash 221392868, now seen corresponding path program 1 times
[2024-06-20 19:44:32,024 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:44:32,024 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657101727]
[2024-06-20 19:44:32,024 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:44:32,024 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:44:32,055 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:44:38,666 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:44:38,666 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:44:38,666 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657101727]
[2024-06-20 19:44:38,667 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657101727] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:44:38,667 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:44:38,667 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:44:38,667 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629347768]
[2024-06-20 19:44:38,667 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:44:38,667 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:44:38,667 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:44:38,667 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:44:38,668 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:44:38,814 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:44:38,814 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 222 transitions, 3038 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:44:38,814 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:44:38,814 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:44:38,814 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:44:40,316 INFO  L124   PetriNetUnfolderBase]: 3206/4732 cut-off events.
[2024-06-20 19:44:40,316 INFO  L125   PetriNetUnfolderBase]: For 94950/94952 co-relation queries the response was YES.
[2024-06-20 19:44:40,334 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33739 conditions, 4732 events. 3206/4732 cut-off events. For 94950/94952 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 23815 event pairs, 778 based on Foata normal form. 6/4738 useless extension candidates. Maximal degree in co-relation 33674. Up to 4299 conditions per place. 
[2024-06-20 19:44:40,349 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 196 selfloop transitions, 58 changer transitions 0/257 dead transitions.
[2024-06-20 19:44:40,349 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 257 transitions, 3722 flow
[2024-06-20 19:44:40,351 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:44:40,351 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:44:40,351 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions.
[2024-06-20 19:44:40,351 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4305555555555556
[2024-06-20 19:44:40,351 INFO  L175             Difference]: Start difference. First operand has 133 places, 222 transitions, 3038 flow. Second operand 9 states and 155 transitions.
[2024-06-20 19:44:40,351 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 257 transitions, 3722 flow
[2024-06-20 19:44:40,443 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 257 transitions, 3622 flow, removed 8 selfloop flow, removed 5 redundant places.
[2024-06-20 19:44:40,446 INFO  L231             Difference]: Finished difference. Result has 137 places, 222 transitions, 3062 flow
[2024-06-20 19:44:40,446 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2938, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3062, PETRI_PLACES=137, PETRI_TRANSITIONS=222}
[2024-06-20 19:44:40,447 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 96 predicate places.
[2024-06-20 19:44:40,447 INFO  L495      AbstractCegarLoop]: Abstraction has has 137 places, 222 transitions, 3062 flow
[2024-06-20 19:44:40,447 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:44:40,447 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:44:40,447 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:44:40,447 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-20 19:44:40,447 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:44:40,448 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:44:40,448 INFO  L85        PathProgramCache]: Analyzing trace with hash 1724775564, now seen corresponding path program 3 times
[2024-06-20 19:44:40,448 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:44:40,448 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251473554]
[2024-06-20 19:44:40,448 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:44:40,448 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:44:40,480 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:44:47,591 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:44:47,591 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:44:47,592 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251473554]
[2024-06-20 19:44:47,592 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251473554] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:44:47,592 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:44:47,592 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:44:47,592 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290322035]
[2024-06-20 19:44:47,592 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:44:47,593 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:44:47,593 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:44:47,593 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:44:47,593 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:44:47,725 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:44:47,725 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 222 transitions, 3062 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:44:47,725 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:44:47,725 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:44:47,725 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:44:49,137 INFO  L124   PetriNetUnfolderBase]: 3278/4844 cut-off events.
[2024-06-20 19:44:49,137 INFO  L125   PetriNetUnfolderBase]: For 107459/107461 co-relation queries the response was YES.
[2024-06-20 19:44:49,157 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34567 conditions, 4844 events. 3278/4844 cut-off events. For 107459/107461 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 24553 event pairs, 862 based on Foata normal form. 28/4872 useless extension candidates. Maximal degree in co-relation 34501. Up to 4545 conditions per place. 
[2024-06-20 19:44:49,175 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 222 selfloop transitions, 39 changer transitions 0/264 dead transitions.
[2024-06-20 19:44:49,175 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 264 transitions, 3819 flow
[2024-06-20 19:44:49,176 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:44:49,176 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:44:49,176 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions.
[2024-06-20 19:44:49,176 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45625
[2024-06-20 19:44:49,176 INFO  L175             Difference]: Start difference. First operand has 137 places, 222 transitions, 3062 flow. Second operand 8 states and 146 transitions.
[2024-06-20 19:44:49,177 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 264 transitions, 3819 flow
[2024-06-20 19:44:49,280 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 264 transitions, 3693 flow, removed 4 selfloop flow, removed 7 redundant places.
[2024-06-20 19:44:49,284 INFO  L231             Difference]: Finished difference. Result has 138 places, 226 transitions, 3097 flow
[2024-06-20 19:44:49,284 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2938, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3097, PETRI_PLACES=138, PETRI_TRANSITIONS=226}
[2024-06-20 19:44:49,284 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 97 predicate places.
[2024-06-20 19:44:49,284 INFO  L495      AbstractCegarLoop]: Abstraction has has 138 places, 226 transitions, 3097 flow
[2024-06-20 19:44:49,284 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:44:49,284 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:44:49,284 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:44:49,285 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-20 19:44:49,285 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:44:49,285 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:44:49,285 INFO  L85        PathProgramCache]: Analyzing trace with hash 1840251432, now seen corresponding path program 1 times
[2024-06-20 19:44:49,285 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:44:49,285 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557242109]
[2024-06-20 19:44:49,285 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:44:49,285 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:44:49,320 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:44:56,223 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:44:56,223 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:44:56,223 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557242109]
[2024-06-20 19:44:56,223 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557242109] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:44:56,224 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:44:56,224 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:44:56,224 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036814252]
[2024-06-20 19:44:56,224 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:44:56,224 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:44:56,224 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:44:56,224 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:44:56,224 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:44:56,342 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:44:56,342 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 226 transitions, 3097 flow. Second operand  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:44:56,342 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:44:56,342 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:44:56,342 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:44:58,096 INFO  L124   PetriNetUnfolderBase]: 3820/5729 cut-off events.
[2024-06-20 19:44:58,096 INFO  L125   PetriNetUnfolderBase]: For 145080/145082 co-relation queries the response was YES.
[2024-06-20 19:44:58,120 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39062 conditions, 5729 events. 3820/5729 cut-off events. For 145080/145082 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 30398 event pairs, 759 based on Foata normal form. 130/5859 useless extension candidates. Maximal degree in co-relation 38995. Up to 3839 conditions per place. 
[2024-06-20 19:44:58,140 INFO  L140   encePairwiseOnDemand]: 25/40 looper letters, 168 selfloop transitions, 127 changer transitions 0/298 dead transitions.
[2024-06-20 19:44:58,140 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 298 transitions, 4317 flow
[2024-06-20 19:44:58,140 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:44:58,141 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:44:58,141 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 183 transitions.
[2024-06-20 19:44:58,141 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5083333333333333
[2024-06-20 19:44:58,141 INFO  L175             Difference]: Start difference. First operand has 138 places, 226 transitions, 3097 flow. Second operand 9 states and 183 transitions.
[2024-06-20 19:44:58,141 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 298 transitions, 4317 flow
[2024-06-20 19:44:58,280 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 298 transitions, 4222 flow, removed 13 selfloop flow, removed 6 redundant places.
[2024-06-20 19:44:58,283 INFO  L231             Difference]: Finished difference. Result has 145 places, 245 transitions, 3712 flow
[2024-06-20 19:44:58,283 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3002, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3712, PETRI_PLACES=145, PETRI_TRANSITIONS=245}
[2024-06-20 19:44:58,284 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 104 predicate places.
[2024-06-20 19:44:58,284 INFO  L495      AbstractCegarLoop]: Abstraction has has 145 places, 245 transitions, 3712 flow
[2024-06-20 19:44:58,284 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:44:58,284 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:44:58,284 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:44:58,284 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-20 19:44:58,284 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:44:58,284 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:44:58,284 INFO  L85        PathProgramCache]: Analyzing trace with hash -1831793216, now seen corresponding path program 1 times
[2024-06-20 19:44:58,284 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:44:58,284 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639297903]
[2024-06-20 19:44:58,285 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:44:58,285 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:44:58,317 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:45:04,439 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:45:04,440 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:45:04,440 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639297903]
[2024-06-20 19:45:04,440 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639297903] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:45:04,440 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:45:04,440 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:45:04,440 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824693857]
[2024-06-20 19:45:04,440 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:45:04,440 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:45:04,440 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:45:04,441 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:45:04,441 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:45:04,559 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:45:04,560 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 245 transitions, 3712 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:45:04,560 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:45:04,560 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:45:04,560 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:45:06,126 INFO  L124   PetriNetUnfolderBase]: 3800/5689 cut-off events.
[2024-06-20 19:45:06,127 INFO  L125   PetriNetUnfolderBase]: For 130456/130458 co-relation queries the response was YES.
[2024-06-20 19:45:06,153 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41870 conditions, 5689 events. 3800/5689 cut-off events. For 130456/130458 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 30114 event pairs, 1001 based on Foata normal form. 4/5693 useless extension candidates. Maximal degree in co-relation 41798. Up to 5590 conditions per place. 
[2024-06-20 19:45:06,174 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 240 selfloop transitions, 24 changer transitions 0/267 dead transitions.
[2024-06-20 19:45:06,174 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 267 transitions, 4314 flow
[2024-06-20 19:45:06,176 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:45:06,176 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:45:06,176 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions.
[2024-06-20 19:45:06,176 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4035714285714286
[2024-06-20 19:45:06,177 INFO  L175             Difference]: Start difference. First operand has 145 places, 245 transitions, 3712 flow. Second operand 7 states and 113 transitions.
[2024-06-20 19:45:06,177 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 267 transitions, 4314 flow
[2024-06-20 19:45:06,377 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 267 transitions, 4142 flow, removed 40 selfloop flow, removed 2 redundant places.
[2024-06-20 19:45:06,380 INFO  L231             Difference]: Finished difference. Result has 150 places, 246 transitions, 3620 flow
[2024-06-20 19:45:06,380 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3541, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3620, PETRI_PLACES=150, PETRI_TRANSITIONS=246}
[2024-06-20 19:45:06,381 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 109 predicate places.
[2024-06-20 19:45:06,381 INFO  L495      AbstractCegarLoop]: Abstraction has has 150 places, 246 transitions, 3620 flow
[2024-06-20 19:45:06,381 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:45:06,381 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:45:06,381 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:45:06,381 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-20 19:45:06,381 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:45:06,382 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:45:06,382 INFO  L85        PathProgramCache]: Analyzing trace with hash -1831496298, now seen corresponding path program 2 times
[2024-06-20 19:45:06,382 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:45:06,382 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422542612]
[2024-06-20 19:45:06,382 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:45:06,382 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:45:06,417 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:45:12,820 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:45:12,820 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:45:12,820 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422542612]
[2024-06-20 19:45:12,821 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422542612] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:45:12,821 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:45:12,821 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:45:12,821 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507160887]
[2024-06-20 19:45:12,821 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:45:12,821 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:45:12,821 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:45:12,821 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:45:12,822 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:45:13,011 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:45:13,011 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 246 transitions, 3620 flow. Second operand  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:45:13,011 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:45:13,011 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:45:13,011 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:45:14,586 INFO  L124   PetriNetUnfolderBase]: 3817/5715 cut-off events.
[2024-06-20 19:45:14,586 INFO  L125   PetriNetUnfolderBase]: For 134362/134362 co-relation queries the response was YES.
[2024-06-20 19:45:14,615 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40602 conditions, 5715 events. 3817/5715 cut-off events. For 134362/134362 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 30167 event pairs, 982 based on Foata normal form. 4/5719 useless extension candidates. Maximal degree in co-relation 40528. Up to 5635 conditions per place. 
[2024-06-20 19:45:14,635 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 254 selfloop transitions, 17 changer transitions 0/274 dead transitions.
[2024-06-20 19:45:14,635 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 274 transitions, 4268 flow
[2024-06-20 19:45:14,637 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:45:14,637 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:45:14,637 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions.
[2024-06-20 19:45:14,637 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3875
[2024-06-20 19:45:14,638 INFO  L175             Difference]: Start difference. First operand has 150 places, 246 transitions, 3620 flow. Second operand 8 states and 124 transitions.
[2024-06-20 19:45:14,638 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 274 transitions, 4268 flow
[2024-06-20 19:45:14,824 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 274 transitions, 4224 flow, removed 2 selfloop flow, removed 5 redundant places.
[2024-06-20 19:45:14,828 INFO  L231             Difference]: Finished difference. Result has 154 places, 249 transitions, 3670 flow
[2024-06-20 19:45:14,828 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3576, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3670, PETRI_PLACES=154, PETRI_TRANSITIONS=249}
[2024-06-20 19:45:14,828 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 113 predicate places.
[2024-06-20 19:45:14,828 INFO  L495      AbstractCegarLoop]: Abstraction has has 154 places, 249 transitions, 3670 flow
[2024-06-20 19:45:14,829 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:45:14,829 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:45:14,829 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:45:14,829 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-20 19:45:14,829 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:45:14,829 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:45:14,829 INFO  L85        PathProgramCache]: Analyzing trace with hash -320486968, now seen corresponding path program 3 times
[2024-06-20 19:45:14,829 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:45:14,829 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25402605]
[2024-06-20 19:45:14,830 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:45:14,830 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:45:14,877 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:45:21,357 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:45:21,358 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:45:21,358 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25402605]
[2024-06-20 19:45:21,358 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25402605] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:45:21,358 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:45:21,358 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:45:21,358 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211747126]
[2024-06-20 19:45:21,358 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:45:21,358 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:45:21,358 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:45:21,359 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:45:21,359 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:45:21,509 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:45:21,509 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 249 transitions, 3670 flow. Second operand  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:45:21,509 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:45:21,509 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:45:21,510 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:45:23,321 INFO  L124   PetriNetUnfolderBase]: 3899/5849 cut-off events.
[2024-06-20 19:45:23,322 INFO  L125   PetriNetUnfolderBase]: For 150742/150742 co-relation queries the response was YES.
[2024-06-20 19:45:23,348 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41761 conditions, 5849 events. 3899/5849 cut-off events. For 150742/150742 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 31173 event pairs, 998 based on Foata normal form. 24/5873 useless extension candidates. Maximal degree in co-relation 41685. Up to 5509 conditions per place. 
[2024-06-20 19:45:23,368 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 238 selfloop transitions, 58 changer transitions 0/299 dead transitions.
[2024-06-20 19:45:23,368 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 299 transitions, 4590 flow
[2024-06-20 19:45:23,369 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:45:23,369 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:45:23,369 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions.
[2024-06-20 19:45:23,369 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.435
[2024-06-20 19:45:23,370 INFO  L175             Difference]: Start difference. First operand has 154 places, 249 transitions, 3670 flow. Second operand 10 states and 174 transitions.
[2024-06-20 19:45:23,370 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 299 transitions, 4590 flow
[2024-06-20 19:45:23,547 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 299 transitions, 4504 flow, removed 29 selfloop flow, removed 5 redundant places.
[2024-06-20 19:45:23,551 INFO  L231             Difference]: Finished difference. Result has 161 places, 257 transitions, 3887 flow
[2024-06-20 19:45:23,551 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3584, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3887, PETRI_PLACES=161, PETRI_TRANSITIONS=257}
[2024-06-20 19:45:23,552 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 120 predicate places.
[2024-06-20 19:45:23,552 INFO  L495      AbstractCegarLoop]: Abstraction has has 161 places, 257 transitions, 3887 flow
[2024-06-20 19:45:23,552 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:45:23,552 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:45:23,552 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:45:23,552 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-20 19:45:23,552 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:45:23,553 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:45:23,553 INFO  L85        PathProgramCache]: Analyzing trace with hash -92585818, now seen corresponding path program 4 times
[2024-06-20 19:45:23,553 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:45:23,553 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816057098]
[2024-06-20 19:45:23,553 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:45:23,553 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:45:23,593 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:45:29,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-06-20 19:45:29,890 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:45:29,890 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816057098]
[2024-06-20 19:45:29,890 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816057098] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:45:29,890 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:45:29,890 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:45:29,890 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619015935]
[2024-06-20 19:45:29,891 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:45:29,891 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:45:29,891 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:45:29,891 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:45:29,891 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:45:30,009 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:45:30,009 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 257 transitions, 3887 flow. Second operand  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:45:30,009 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:45:30,009 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:45:30,009 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:45:31,729 INFO  L124   PetriNetUnfolderBase]: 3916/5876 cut-off events.
[2024-06-20 19:45:31,729 INFO  L125   PetriNetUnfolderBase]: For 160623/160623 co-relation queries the response was YES.
[2024-06-20 19:45:31,760 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43111 conditions, 5876 events. 3916/5876 cut-off events. For 160623/160623 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 31327 event pairs, 1056 based on Foata normal form. 4/5880 useless extension candidates. Maximal degree in co-relation 43032. Up to 5801 conditions per place. 
[2024-06-20 19:45:31,782 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 266 selfloop transitions, 19 changer transitions 0/288 dead transitions.
[2024-06-20 19:45:31,782 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 288 transitions, 4573 flow
[2024-06-20 19:45:31,784 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:45:31,784 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:45:31,784 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions.
[2024-06-20 19:45:31,784 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38333333333333336
[2024-06-20 19:45:31,784 INFO  L175             Difference]: Start difference. First operand has 161 places, 257 transitions, 3887 flow. Second operand 9 states and 138 transitions.
[2024-06-20 19:45:31,784 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 288 transitions, 4573 flow
[2024-06-20 19:45:31,978 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 288 transitions, 4391 flow, removed 31 selfloop flow, removed 6 redundant places.
[2024-06-20 19:45:31,982 INFO  L231             Difference]: Finished difference. Result has 164 places, 259 transitions, 3796 flow
[2024-06-20 19:45:31,982 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3705, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3796, PETRI_PLACES=164, PETRI_TRANSITIONS=259}
[2024-06-20 19:45:31,982 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 123 predicate places.
[2024-06-20 19:45:31,983 INFO  L495      AbstractCegarLoop]: Abstraction has has 164 places, 259 transitions, 3796 flow
[2024-06-20 19:45:31,983 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:45:31,983 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:45:31,983 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:45:31,983 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-20 19:45:31,983 INFO  L420      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:45:31,983 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:45:31,984 INFO  L85        PathProgramCache]: Analyzing trace with hash -92355178, now seen corresponding path program 5 times
[2024-06-20 19:45:31,984 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:45:31,984 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889104175]
[2024-06-20 19:45:31,984 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:45:31,984 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:45:32,022 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:45:38,261 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:45:38,261 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:45:38,261 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889104175]
[2024-06-20 19:45:38,261 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889104175] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:45:38,261 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:45:38,261 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:45:38,261 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429152673]
[2024-06-20 19:45:38,261 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:45:38,262 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:45:38,262 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:45:38,262 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:45:38,262 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:45:38,459 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:45:38,459 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 259 transitions, 3796 flow. Second operand  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:45:38,459 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:45:38,459 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:45:38,459 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:45:40,102 INFO  L124   PetriNetUnfolderBase]: 3908/5864 cut-off events.
[2024-06-20 19:45:40,102 INFO  L125   PetriNetUnfolderBase]: For 164103/164103 co-relation queries the response was YES.
[2024-06-20 19:45:40,134 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42519 conditions, 5864 events. 3908/5864 cut-off events. For 164103/164103 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 31283 event pairs, 1048 based on Foata normal form. 4/5868 useless extension candidates. Maximal degree in co-relation 42440. Up to 5762 conditions per place. 
[2024-06-20 19:45:40,156 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 260 selfloop transitions, 23 changer transitions 0/286 dead transitions.
[2024-06-20 19:45:40,157 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 286 transitions, 4472 flow
[2024-06-20 19:45:40,158 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:45:40,158 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:45:40,158 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions.
[2024-06-20 19:45:40,159 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.390625
[2024-06-20 19:45:40,159 INFO  L175             Difference]: Start difference. First operand has 164 places, 259 transitions, 3796 flow. Second operand 8 states and 125 transitions.
[2024-06-20 19:45:40,159 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 286 transitions, 4472 flow
[2024-06-20 19:45:40,385 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 286 transitions, 4403 flow, removed 19 selfloop flow, removed 6 redundant places.
[2024-06-20 19:45:40,389 INFO  L231             Difference]: Finished difference. Result has 166 places, 261 transitions, 3833 flow
[2024-06-20 19:45:40,389 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3727, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3833, PETRI_PLACES=166, PETRI_TRANSITIONS=261}
[2024-06-20 19:45:40,389 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 125 predicate places.
[2024-06-20 19:45:40,390 INFO  L495      AbstractCegarLoop]: Abstraction has has 166 places, 261 transitions, 3833 flow
[2024-06-20 19:45:40,390 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:45:40,390 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:45:40,390 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:45:40,390 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-20 19:45:40,390 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:45:40,390 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:45:40,391 INFO  L85        PathProgramCache]: Analyzing trace with hash -972887351, now seen corresponding path program 1 times
[2024-06-20 19:45:40,391 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:45:40,391 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472371947]
[2024-06-20 19:45:40,391 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:45:40,391 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:45:40,437 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:45:47,525 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:45:47,526 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:45:47,526 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472371947]
[2024-06-20 19:45:47,526 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472371947] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:45:47,526 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:45:47,526 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:45:47,526 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330148355]
[2024-06-20 19:45:47,526 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:45:47,527 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:45:47,527 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:45:47,527 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:45:47,527 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:45:47,616 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:45:47,616 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 261 transitions, 3833 flow. Second operand  has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:45:47,616 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:45:47,616 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:45:47,616 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:45:49,073 INFO  L124   PetriNetUnfolderBase]: 3893/5844 cut-off events.
[2024-06-20 19:45:49,073 INFO  L125   PetriNetUnfolderBase]: For 167987/167987 co-relation queries the response was YES.
[2024-06-20 19:45:49,106 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42531 conditions, 5844 events. 3893/5844 cut-off events. For 167987/167987 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 31162 event pairs, 963 based on Foata normal form. 5/5849 useless extension candidates. Maximal degree in co-relation 42451. Up to 5782 conditions per place. 
[2024-06-20 19:45:49,210 INFO  L140   encePairwiseOnDemand]: 33/40 looper letters, 258 selfloop transitions, 20 changer transitions 0/281 dead transitions.
[2024-06-20 19:45:49,211 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 281 transitions, 4516 flow
[2024-06-20 19:45:49,212 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 19:45:49,212 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 19:45:49,212 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions.
[2024-06-20 19:45:49,212 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.445
[2024-06-20 19:45:49,212 INFO  L175             Difference]: Start difference. First operand has 166 places, 261 transitions, 3833 flow. Second operand 5 states and 89 transitions.
[2024-06-20 19:45:49,212 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 281 transitions, 4516 flow
[2024-06-20 19:45:49,412 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 281 transitions, 4428 flow, removed 24 selfloop flow, removed 6 redundant places.
[2024-06-20 19:45:49,416 INFO  L231             Difference]: Finished difference. Result has 165 places, 264 transitions, 3868 flow
[2024-06-20 19:45:49,416 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3747, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3868, PETRI_PLACES=165, PETRI_TRANSITIONS=264}
[2024-06-20 19:45:49,417 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 124 predicate places.
[2024-06-20 19:45:49,417 INFO  L495      AbstractCegarLoop]: Abstraction has has 165 places, 264 transitions, 3868 flow
[2024-06-20 19:45:49,417 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:45:49,417 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:45:49,417 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:45:49,417 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-20 19:45:49,417 INFO  L420      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:45:49,418 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:45:49,418 INFO  L85        PathProgramCache]: Analyzing trace with hash 1839870186, now seen corresponding path program 1 times
[2024-06-20 19:45:49,418 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:45:49,418 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667876786]
[2024-06-20 19:45:49,418 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:45:49,418 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:45:49,451 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:45:56,166 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:45:56,167 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:45:56,167 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667876786]
[2024-06-20 19:45:56,167 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667876786] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:45:56,167 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:45:56,167 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:45:56,167 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044476985]
[2024-06-20 19:45:56,167 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:45:56,167 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:45:56,167 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:45:56,168 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:45:56,168 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:45:56,267 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:45:56,267 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 264 transitions, 3868 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:45:56,267 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:45:56,267 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:45:56,267 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:45:58,816 INFO  L124   PetriNetUnfolderBase]: 5310/8072 cut-off events.
[2024-06-20 19:45:58,816 INFO  L125   PetriNetUnfolderBase]: For 301460/301462 co-relation queries the response was YES.
[2024-06-20 19:45:58,853 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 58536 conditions, 8072 events. 5310/8072 cut-off events. For 301460/301462 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 46660 event pairs, 1011 based on Foata normal form. 82/8154 useless extension candidates. Maximal degree in co-relation 58455. Up to 4464 conditions per place. 
[2024-06-20 19:45:58,878 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 269 selfloop transitions, 83 changer transitions 0/355 dead transitions.
[2024-06-20 19:45:58,878 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 355 transitions, 5541 flow
[2024-06-20 19:45:58,879 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:45:58,879 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:45:58,879 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 191 transitions.
[2024-06-20 19:45:58,879 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5305555555555556
[2024-06-20 19:45:58,879 INFO  L175             Difference]: Start difference. First operand has 165 places, 264 transitions, 3868 flow. Second operand 9 states and 191 transitions.
[2024-06-20 19:45:58,879 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 355 transitions, 5541 flow
[2024-06-20 19:45:59,133 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 355 transitions, 5440 flow, removed 20 selfloop flow, removed 4 redundant places.
[2024-06-20 19:45:59,137 INFO  L231             Difference]: Finished difference. Result has 173 places, 282 transitions, 4404 flow
[2024-06-20 19:45:59,138 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3767, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4404, PETRI_PLACES=173, PETRI_TRANSITIONS=282}
[2024-06-20 19:45:59,138 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 132 predicate places.
[2024-06-20 19:45:59,138 INFO  L495      AbstractCegarLoop]: Abstraction has has 173 places, 282 transitions, 4404 flow
[2024-06-20 19:45:59,138 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:45:59,138 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:45:59,138 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:45:59,138 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-20 19:45:59,138 INFO  L420      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:45:59,139 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:45:59,139 INFO  L85        PathProgramCache]: Analyzing trace with hash -1813594474, now seen corresponding path program 2 times
[2024-06-20 19:45:59,139 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:45:59,139 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432008789]
[2024-06-20 19:45:59,139 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:45:59,139 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:45:59,176 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:46:06,032 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:46:06,032 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:46:06,032 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432008789]
[2024-06-20 19:46:06,032 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432008789] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:46:06,032 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:46:06,033 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:46:06,033 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407134130]
[2024-06-20 19:46:06,033 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:46:06,033 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:46:06,033 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:46:06,033 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:46:06,033 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:46:06,194 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:46:06,195 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 282 transitions, 4404 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:46:06,195 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:46:06,195 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:46:06,195 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:46:09,077 INFO  L124   PetriNetUnfolderBase]: 6344/9692 cut-off events.
[2024-06-20 19:46:09,077 INFO  L125   PetriNetUnfolderBase]: For 407151/407153 co-relation queries the response was YES.
[2024-06-20 19:46:09,133 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 74343 conditions, 9692 events. 6344/9692 cut-off events. For 407151/407153 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 58478 event pairs, 1680 based on Foata normal form. 82/9774 useless extension candidates. Maximal degree in co-relation 74259. Up to 7151 conditions per place. 
[2024-06-20 19:46:09,170 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 270 selfloop transitions, 90 changer transitions 1/364 dead transitions.
[2024-06-20 19:46:09,170 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 364 transitions, 6017 flow
[2024-06-20 19:46:09,170 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:46:09,170 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:46:09,171 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 205 transitions.
[2024-06-20 19:46:09,171 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5125
[2024-06-20 19:46:09,171 INFO  L175             Difference]: Start difference. First operand has 173 places, 282 transitions, 4404 flow. Second operand 10 states and 205 transitions.
[2024-06-20 19:46:09,171 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 364 transitions, 6017 flow
[2024-06-20 19:46:09,757 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 364 transitions, 5879 flow, removed 65 selfloop flow, removed 2 redundant places.
[2024-06-20 19:46:09,762 INFO  L231             Difference]: Finished difference. Result has 182 places, 295 transitions, 4802 flow
[2024-06-20 19:46:09,762 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4296, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4802, PETRI_PLACES=182, PETRI_TRANSITIONS=295}
[2024-06-20 19:46:09,762 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 141 predicate places.
[2024-06-20 19:46:09,762 INFO  L495      AbstractCegarLoop]: Abstraction has has 182 places, 295 transitions, 4802 flow
[2024-06-20 19:46:09,762 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:46:09,762 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:46:09,763 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:46:09,763 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-20 19:46:09,763 INFO  L420      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:46:09,763 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:46:09,763 INFO  L85        PathProgramCache]: Analyzing trace with hash 1928583816, now seen corresponding path program 3 times
[2024-06-20 19:46:09,763 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:46:09,763 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764700963]
[2024-06-20 19:46:09,763 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:46:09,763 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:46:09,794 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:46:16,972 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:46:16,972 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:46:16,972 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764700963]
[2024-06-20 19:46:16,972 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764700963] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:46:16,972 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:46:16,972 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:46:16,972 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036385265]
[2024-06-20 19:46:16,973 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:46:16,973 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:46:16,973 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:46:16,973 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:46:16,973 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:46:17,085 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:46:17,086 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 295 transitions, 4802 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:46:17,086 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:46:17,086 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:46:17,086 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:46:20,109 INFO  L124   PetriNetUnfolderBase]: 6590/10118 cut-off events.
[2024-06-20 19:46:20,109 INFO  L125   PetriNetUnfolderBase]: For 430708/430710 co-relation queries the response was YES.
[2024-06-20 19:46:20,170 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 76966 conditions, 10118 events. 6590/10118 cut-off events. For 430708/430710 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 62106 event pairs, 2136 based on Foata normal form. 82/10200 useless extension candidates. Maximal degree in co-relation 76879. Up to 7719 conditions per place. 
[2024-06-20 19:46:20,208 INFO  L140   encePairwiseOnDemand]: 25/40 looper letters, 213 selfloop transitions, 138 changer transitions 0/354 dead transitions.
[2024-06-20 19:46:20,208 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 354 transitions, 5934 flow
[2024-06-20 19:46:20,209 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:46:20,209 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:46:20,209 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 198 transitions.
[2024-06-20 19:46:20,209 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.495
[2024-06-20 19:46:20,209 INFO  L175             Difference]: Start difference. First operand has 182 places, 295 transitions, 4802 flow. Second operand 10 states and 198 transitions.
[2024-06-20 19:46:20,209 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 354 transitions, 5934 flow
[2024-06-20 19:46:21,000 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 354 transitions, 5762 flow, removed 42 selfloop flow, removed 5 redundant places.
[2024-06-20 19:46:21,005 INFO  L231             Difference]: Finished difference. Result has 188 places, 298 transitions, 5007 flow
[2024-06-20 19:46:21,005 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4630, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5007, PETRI_PLACES=188, PETRI_TRANSITIONS=298}
[2024-06-20 19:46:21,005 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 147 predicate places.
[2024-06-20 19:46:21,005 INFO  L495      AbstractCegarLoop]: Abstraction has has 188 places, 298 transitions, 5007 flow
[2024-06-20 19:46:21,005 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:46:21,005 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:46:21,005 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:46:21,005 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-20 19:46:21,006 INFO  L420      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:46:21,006 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:46:21,006 INFO  L85        PathProgramCache]: Analyzing trace with hash 1847123606, now seen corresponding path program 4 times
[2024-06-20 19:46:21,006 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:46:21,006 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581866033]
[2024-06-20 19:46:21,006 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:46:21,006 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:46:21,037 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:46:28,571 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:46:28,572 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:46:28,572 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581866033]
[2024-06-20 19:46:28,572 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581866033] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:46:28,572 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:46:28,572 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:46:28,572 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606560996]
[2024-06-20 19:46:28,572 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:46:28,572 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:46:28,572 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:46:28,573 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:46:28,573 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:46:28,675 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:46:28,675 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 298 transitions, 5007 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:46:28,675 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:46:28,675 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:46:28,675 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:46:32,092 INFO  L124   PetriNetUnfolderBase]: 7637/11777 cut-off events.
[2024-06-20 19:46:32,092 INFO  L125   PetriNetUnfolderBase]: For 540739/540741 co-relation queries the response was YES.
[2024-06-20 19:46:32,167 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 91109 conditions, 11777 events. 7637/11777 cut-off events. For 540739/540741 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 74657 event pairs, 2250 based on Foata normal form. 74/11851 useless extension candidates. Maximal degree in co-relation 91019. Up to 9646 conditions per place. 
[2024-06-20 19:46:32,215 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 310 selfloop transitions, 62 changer transitions 0/375 dead transitions.
[2024-06-20 19:46:32,215 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 375 transitions, 6548 flow
[2024-06-20 19:46:32,215 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:46:32,215 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:46:32,216 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 184 transitions.
[2024-06-20 19:46:32,216 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5111111111111111
[2024-06-20 19:46:32,216 INFO  L175             Difference]: Start difference. First operand has 188 places, 298 transitions, 5007 flow. Second operand 9 states and 184 transitions.
[2024-06-20 19:46:32,216 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 375 transitions, 6548 flow
[2024-06-20 19:46:33,029 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 375 transitions, 6232 flow, removed 26 selfloop flow, removed 7 redundant places.
[2024-06-20 19:46:33,034 INFO  L231             Difference]: Finished difference. Result has 192 places, 313 transitions, 5211 flow
[2024-06-20 19:46:33,034 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4697, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5211, PETRI_PLACES=192, PETRI_TRANSITIONS=313}
[2024-06-20 19:46:33,034 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 151 predicate places.
[2024-06-20 19:46:33,035 INFO  L495      AbstractCegarLoop]: Abstraction has has 192 places, 313 transitions, 5211 flow
[2024-06-20 19:46:33,035 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:46:33,035 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:46:33,035 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:46:33,035 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-20 19:46:33,035 INFO  L420      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:46:33,036 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:46:33,036 INFO  L85        PathProgramCache]: Analyzing trace with hash 1847127326, now seen corresponding path program 5 times
[2024-06-20 19:46:33,036 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:46:33,036 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278017809]
[2024-06-20 19:46:33,036 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:46:33,036 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:46:33,068 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:46:39,928 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:46:39,928 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:46:39,928 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278017809]
[2024-06-20 19:46:39,928 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278017809] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:46:39,928 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:46:39,928 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:46:39,928 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992701891]
[2024-06-20 19:46:39,928 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:46:39,928 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:46:39,929 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:46:39,929 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:46:39,929 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:46:40,089 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:46:40,089 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 313 transitions, 5211 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:46:40,089 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:46:40,089 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:46:40,089 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:46:43,464 INFO  L124   PetriNetUnfolderBase]: 7882/12200 cut-off events.
[2024-06-20 19:46:43,464 INFO  L125   PetriNetUnfolderBase]: For 570843/570845 co-relation queries the response was YES.
[2024-06-20 19:46:43,562 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 93117 conditions, 12200 events. 7882/12200 cut-off events. For 570843/570845 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 78375 event pairs, 2858 based on Foata normal form. 106/12306 useless extension candidates. Maximal degree in co-relation 93024. Up to 11221 conditions per place. 
[2024-06-20 19:46:43,610 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 311 selfloop transitions, 59 changer transitions 0/373 dead transitions.
[2024-06-20 19:46:43,610 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 373 transitions, 6399 flow
[2024-06-20 19:46:43,611 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:46:43,611 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:46:43,611 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions.
[2024-06-20 19:46:43,611 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49166666666666664
[2024-06-20 19:46:43,611 INFO  L175             Difference]: Start difference. First operand has 192 places, 313 transitions, 5211 flow. Second operand 9 states and 177 transitions.
[2024-06-20 19:46:43,611 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 373 transitions, 6399 flow
[2024-06-20 19:46:44,431 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 373 transitions, 6303 flow, removed 28 selfloop flow, removed 4 redundant places.
[2024-06-20 19:46:44,437 INFO  L231             Difference]: Finished difference. Result has 198 places, 321 transitions, 5455 flow
[2024-06-20 19:46:44,437 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5119, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5455, PETRI_PLACES=198, PETRI_TRANSITIONS=321}
[2024-06-20 19:46:44,437 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 157 predicate places.
[2024-06-20 19:46:44,438 INFO  L495      AbstractCegarLoop]: Abstraction has has 198 places, 321 transitions, 5455 flow
[2024-06-20 19:46:44,438 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:46:44,438 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:46:44,438 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:46:44,438 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-20 19:46:44,438 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:46:44,438 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:46:44,438 INFO  L85        PathProgramCache]: Analyzing trace with hash 1852841618, now seen corresponding path program 1 times
[2024-06-20 19:46:44,438 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:46:44,438 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234526]
[2024-06-20 19:46:44,438 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:46:44,439 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:46:44,481 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:46:50,942 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:46:50,942 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:46:50,942 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234526]
[2024-06-20 19:46:50,942 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234526] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:46:50,942 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:46:50,943 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:46:50,943 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208143073]
[2024-06-20 19:46:50,943 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:46:50,943 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:46:50,943 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:46:50,943 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:46:50,943 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:46:51,178 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:46:51,178 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 321 transitions, 5455 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:46:51,178 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:46:51,178 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:46:51,178 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:46:54,473 INFO  L124   PetriNetUnfolderBase]: 7899/12227 cut-off events.
[2024-06-20 19:46:54,473 INFO  L125   PetriNetUnfolderBase]: For 551831/551833 co-relation queries the response was YES.
[2024-06-20 19:46:54,571 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 94904 conditions, 12227 events. 7899/12227 cut-off events. For 551831/551833 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 78883 event pairs, 3082 based on Foata normal form. 6/12233 useless extension candidates. Maximal degree in co-relation 94808. Up to 11934 conditions per place. 
[2024-06-20 19:46:54,619 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 308 selfloop transitions, 46 changer transitions 0/357 dead transitions.
[2024-06-20 19:46:54,619 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 357 transitions, 6304 flow
[2024-06-20 19:46:54,620 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:46:54,620 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:46:54,620 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions.
[2024-06-20 19:46:54,620 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41388888888888886
[2024-06-20 19:46:54,621 INFO  L175             Difference]: Start difference. First operand has 198 places, 321 transitions, 5455 flow. Second operand 9 states and 149 transitions.
[2024-06-20 19:46:54,621 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 357 transitions, 6304 flow
[2024-06-20 19:46:55,653 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 357 transitions, 6143 flow, removed 47 selfloop flow, removed 5 redundant places.
[2024-06-20 19:46:55,658 INFO  L231             Difference]: Finished difference. Result has 202 places, 323 transitions, 5448 flow
[2024-06-20 19:46:55,659 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5294, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5448, PETRI_PLACES=202, PETRI_TRANSITIONS=323}
[2024-06-20 19:46:55,659 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 161 predicate places.
[2024-06-20 19:46:55,659 INFO  L495      AbstractCegarLoop]: Abstraction has has 202 places, 323 transitions, 5448 flow
[2024-06-20 19:46:55,659 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:46:55,659 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:46:55,659 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:46:55,659 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-20 19:46:55,660 INFO  L420      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:46:55,660 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:46:55,660 INFO  L85        PathProgramCache]: Analyzing trace with hash 1852849058, now seen corresponding path program 2 times
[2024-06-20 19:46:55,660 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:46:55,660 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152633777]
[2024-06-20 19:46:55,660 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:46:55,660 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:46:55,703 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:47:02,473 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:47:02,473 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:47:02,473 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152633777]
[2024-06-20 19:47:02,473 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152633777] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:47:02,473 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:47:02,473 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:47:02,473 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019727969]
[2024-06-20 19:47:02,473 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:47:02,474 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:47:02,474 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:47:02,474 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:47:02,474 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:47:02,658 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:47:02,659 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 323 transitions, 5448 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:47:02,659 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:47:02,659 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:47:02,659 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:47:06,311 INFO  L124   PetriNetUnfolderBase]: 8047/12455 cut-off events.
[2024-06-20 19:47:06,311 INFO  L125   PetriNetUnfolderBase]: For 601345/601347 co-relation queries the response was YES.
[2024-06-20 19:47:06,403 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 97137 conditions, 12455 events. 8047/12455 cut-off events. For 601345/601347 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 80648 event pairs, 2913 based on Foata normal form. 20/12475 useless extension candidates. Maximal degree in co-relation 97039. Up to 11112 conditions per place. 
[2024-06-20 19:47:06,458 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 278 selfloop transitions, 112 changer transitions 0/393 dead transitions.
[2024-06-20 19:47:06,458 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 393 transitions, 6920 flow
[2024-06-20 19:47:06,458 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:47:06,458 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:47:06,459 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions.
[2024-06-20 19:47:06,459 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4888888888888889
[2024-06-20 19:47:06,459 INFO  L175             Difference]: Start difference. First operand has 202 places, 323 transitions, 5448 flow. Second operand 9 states and 176 transitions.
[2024-06-20 19:47:06,459 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 393 transitions, 6920 flow
[2024-06-20 19:47:07,315 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 393 transitions, 6828 flow, removed 22 selfloop flow, removed 4 redundant places.
[2024-06-20 19:47:07,320 INFO  L231             Difference]: Finished difference. Result has 210 places, 343 transitions, 6073 flow
[2024-06-20 19:47:07,321 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5356, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6073, PETRI_PLACES=210, PETRI_TRANSITIONS=343}
[2024-06-20 19:47:07,321 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 169 predicate places.
[2024-06-20 19:47:07,321 INFO  L495      AbstractCegarLoop]: Abstraction has has 210 places, 343 transitions, 6073 flow
[2024-06-20 19:47:07,321 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:47:07,321 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:47:07,321 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:47:07,321 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-20 19:47:07,322 INFO  L420      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:47:07,322 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:47:07,322 INFO  L85        PathProgramCache]: Analyzing trace with hash -1207514282, now seen corresponding path program 3 times
[2024-06-20 19:47:07,322 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:47:07,322 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189839922]
[2024-06-20 19:47:07,322 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:47:07,322 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:47:07,365 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:47:14,266 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:47:14,267 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:47:14,267 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189839922]
[2024-06-20 19:47:14,267 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189839922] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:47:14,267 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:47:14,267 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:47:14,267 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624220079]
[2024-06-20 19:47:14,267 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:47:14,267 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:47:14,267 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:47:14,268 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:47:14,268 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:47:14,354 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:47:14,355 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 343 transitions, 6073 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:47:14,355 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:47:14,355 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:47:14,355 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:47:18,166 INFO  L124   PetriNetUnfolderBase]: 8135/12595 cut-off events.
[2024-06-20 19:47:18,166 INFO  L125   PetriNetUnfolderBase]: For 641320/641322 co-relation queries the response was YES.
[2024-06-20 19:47:18,258 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 100958 conditions, 12595 events. 8135/12595 cut-off events. For 641320/641322 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 81734 event pairs, 3229 based on Foata normal form. 20/12615 useless extension candidates. Maximal degree in co-relation 100856. Up to 12295 conditions per place. 
[2024-06-20 19:47:18,309 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 336 selfloop transitions, 47 changer transitions 0/386 dead transitions.
[2024-06-20 19:47:18,309 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 386 transitions, 7143 flow
[2024-06-20 19:47:18,310 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:47:18,310 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:47:18,310 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions.
[2024-06-20 19:47:18,310 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45555555555555555
[2024-06-20 19:47:18,310 INFO  L175             Difference]: Start difference. First operand has 210 places, 343 transitions, 6073 flow. Second operand 9 states and 164 transitions.
[2024-06-20 19:47:18,310 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 386 transitions, 7143 flow
[2024-06-20 19:47:19,404 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 386 transitions, 7046 flow, removed 33 selfloop flow, removed 3 redundant places.
[2024-06-20 19:47:19,414 INFO  L231             Difference]: Finished difference. Result has 216 places, 346 transitions, 6166 flow
[2024-06-20 19:47:19,415 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5976, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6166, PETRI_PLACES=216, PETRI_TRANSITIONS=346}
[2024-06-20 19:47:19,415 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 175 predicate places.
[2024-06-20 19:47:19,415 INFO  L495      AbstractCegarLoop]: Abstraction has has 216 places, 346 transitions, 6166 flow
[2024-06-20 19:47:19,415 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:47:19,415 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:47:19,415 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:47:19,415 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-20 19:47:19,415 INFO  L420      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:47:19,416 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:47:19,416 INFO  L85        PathProgramCache]: Analyzing trace with hash -1207506842, now seen corresponding path program 4 times
[2024-06-20 19:47:19,416 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:47:19,416 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272831835]
[2024-06-20 19:47:19,416 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:47:19,416 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:47:19,455 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:47:26,951 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:47:26,952 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:47:26,952 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272831835]
[2024-06-20 19:47:26,952 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272831835] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:47:26,952 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:47:26,952 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:47:26,952 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142228858]
[2024-06-20 19:47:26,952 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:47:26,952 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:47:26,952 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:47:26,952 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:47:26,953 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:47:27,155 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:47:27,156 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 346 transitions, 6166 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:47:27,156 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:47:27,156 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:47:27,156 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:47:31,018 INFO  L124   PetriNetUnfolderBase]: 8308/12862 cut-off events.
[2024-06-20 19:47:31,018 INFO  L125   PetriNetUnfolderBase]: For 681341/681343 co-relation queries the response was YES.
[2024-06-20 19:47:31,105 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 104401 conditions, 12862 events. 8308/12862 cut-off events. For 681341/681343 co-relation queries the response was YES. Maximal size of possible extension queue 568. Compared 83738 event pairs, 3250 based on Foata normal form. 20/12882 useless extension candidates. Maximal degree in co-relation 104297. Up to 12320 conditions per place. 
[2024-06-20 19:47:31,157 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 341 selfloop transitions, 52 changer transitions 0/396 dead transitions.
[2024-06-20 19:47:31,157 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 396 transitions, 7440 flow
[2024-06-20 19:47:31,158 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:47:31,158 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:47:31,158 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions.
[2024-06-20 19:47:31,158 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46944444444444444
[2024-06-20 19:47:31,158 INFO  L175             Difference]: Start difference. First operand has 216 places, 346 transitions, 6166 flow. Second operand 9 states and 169 transitions.
[2024-06-20 19:47:31,159 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 396 transitions, 7440 flow
[2024-06-20 19:47:32,012 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 396 transitions, 7303 flow, removed 33 selfloop flow, removed 6 redundant places.
[2024-06-20 19:47:32,018 INFO  L231             Difference]: Finished difference. Result has 220 places, 351 transitions, 6307 flow
[2024-06-20 19:47:32,018 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6029, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6307, PETRI_PLACES=220, PETRI_TRANSITIONS=351}
[2024-06-20 19:47:32,018 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 179 predicate places.
[2024-06-20 19:47:32,019 INFO  L495      AbstractCegarLoop]: Abstraction has has 220 places, 351 transitions, 6307 flow
[2024-06-20 19:47:32,019 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:47:32,019 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:47:32,019 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:47:32,019 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-20 19:47:32,019 INFO  L420      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:47:32,019 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:47:32,019 INFO  L85        PathProgramCache]: Analyzing trace with hash -951013772, now seen corresponding path program 5 times
[2024-06-20 19:47:32,019 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:47:32,019 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342385865]
[2024-06-20 19:47:32,019 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:47:32,019 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:47:32,056 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:47:39,022 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:47:39,022 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:47:39,022 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342385865]
[2024-06-20 19:47:39,022 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342385865] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:47:39,022 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:47:39,022 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:47:39,022 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575840114]
[2024-06-20 19:47:39,022 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:47:39,023 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:47:39,023 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:47:39,023 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:47:39,023 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:47:39,208 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:47:39,209 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 351 transitions, 6307 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:47:39,209 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:47:39,209 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:47:39,209 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:47:43,294 INFO  L124   PetriNetUnfolderBase]: 8325/12889 cut-off events.
[2024-06-20 19:47:43,294 INFO  L125   PetriNetUnfolderBase]: For 703018/703020 co-relation queries the response was YES.
[2024-06-20 19:47:43,371 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 105452 conditions, 12889 events. 8325/12889 cut-off events. For 703018/703020 co-relation queries the response was YES. Maximal size of possible extension queue 568. Compared 83887 event pairs, 3350 based on Foata normal form. 6/12895 useless extension candidates. Maximal degree in co-relation 105346. Up to 12754 conditions per place. 
[2024-06-20 19:47:43,419 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 349 selfloop transitions, 28 changer transitions 0/380 dead transitions.
[2024-06-20 19:47:43,419 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 380 transitions, 7202 flow
[2024-06-20 19:47:43,421 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:47:43,421 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:47:43,421 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions.
[2024-06-20 19:47:43,422 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.396875
[2024-06-20 19:47:43,422 INFO  L175             Difference]: Start difference. First operand has 220 places, 351 transitions, 6307 flow. Second operand 8 states and 127 transitions.
[2024-06-20 19:47:43,422 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 380 transitions, 7202 flow
[2024-06-20 19:47:44,571 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 380 transitions, 7061 flow, removed 44 selfloop flow, removed 5 redundant places.
[2024-06-20 19:47:44,576 INFO  L231             Difference]: Finished difference. Result has 223 places, 354 transitions, 6311 flow
[2024-06-20 19:47:44,577 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6166, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6311, PETRI_PLACES=223, PETRI_TRANSITIONS=354}
[2024-06-20 19:47:44,577 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 182 predicate places.
[2024-06-20 19:47:44,577 INFO  L495      AbstractCegarLoop]: Abstraction has has 223 places, 354 transitions, 6311 flow
[2024-06-20 19:47:44,577 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:47:44,577 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:47:44,577 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:47:44,578 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-20 19:47:44,578 INFO  L420      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:47:44,578 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:47:44,578 INFO  L85        PathProgramCache]: Analyzing trace with hash -951006332, now seen corresponding path program 6 times
[2024-06-20 19:47:44,578 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:47:44,578 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558876152]
[2024-06-20 19:47:44,578 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:47:44,579 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:47:44,612 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:47:51,986 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:47:51,986 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:47:51,986 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558876152]
[2024-06-20 19:47:51,986 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558876152] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:47:51,986 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:47:51,986 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:47:51,987 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574712059]
[2024-06-20 19:47:51,987 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:47:51,987 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:47:51,987 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:47:51,987 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:47:51,988 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:47:52,228 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:47:52,229 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 354 transitions, 6311 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:47:52,229 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:47:52,229 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:47:52,229 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:47:55,994 INFO  L124   PetriNetUnfolderBase]: 8342/12916 cut-off events.
[2024-06-20 19:47:55,994 INFO  L125   PetriNetUnfolderBase]: For 725689/725691 co-relation queries the response was YES.
[2024-06-20 19:47:56,116 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 105804 conditions, 12916 events. 8342/12916 cut-off events. For 725689/725691 co-relation queries the response was YES. Maximal size of possible extension queue 568. Compared 84129 event pairs, 3349 based on Foata normal form. 6/12922 useless extension candidates. Maximal degree in co-relation 105696. Up to 12699 conditions per place. 
[2024-06-20 19:47:56,176 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 346 selfloop transitions, 34 changer transitions 0/383 dead transitions.
[2024-06-20 19:47:56,176 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 383 transitions, 7212 flow
[2024-06-20 19:47:56,177 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:47:56,177 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:47:56,177 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions.
[2024-06-20 19:47:56,177 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4
[2024-06-20 19:47:56,177 INFO  L175             Difference]: Start difference. First operand has 223 places, 354 transitions, 6311 flow. Second operand 8 states and 128 transitions.
[2024-06-20 19:47:56,177 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 383 transitions, 7212 flow
[2024-06-20 19:47:57,290 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 383 transitions, 7100 flow, removed 31 selfloop flow, removed 6 redundant places.
[2024-06-20 19:47:57,296 INFO  L231             Difference]: Finished difference. Result has 225 places, 357 transitions, 6358 flow
[2024-06-20 19:47:57,296 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6199, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6358, PETRI_PLACES=225, PETRI_TRANSITIONS=357}
[2024-06-20 19:47:57,296 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 184 predicate places.
[2024-06-20 19:47:57,296 INFO  L495      AbstractCegarLoop]: Abstraction has has 225 places, 357 transitions, 6358 flow
[2024-06-20 19:47:57,297 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:47:57,297 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:47:57,297 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:47:57,297 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-20 19:47:57,297 INFO  L420      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:47:57,297 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:47:57,297 INFO  L85        PathProgramCache]: Analyzing trace with hash -941809562, now seen corresponding path program 7 times
[2024-06-20 19:47:57,297 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:47:57,298 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100259917]
[2024-06-20 19:47:57,298 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:47:57,298 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:47:57,337 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:48:04,101 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:48:04,102 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:48:04,102 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100259917]
[2024-06-20 19:48:04,102 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100259917] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:48:04,102 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:48:04,102 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:48:04,102 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069382258]
[2024-06-20 19:48:04,102 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:48:04,102 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:48:04,102 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:48:04,102 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:48:04,103 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:48:04,301 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:48:04,302 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 357 transitions, 6358 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:48:04,302 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:48:04,302 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:48:04,302 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:48:08,712 INFO  L124   PetriNetUnfolderBase]: 8334/12904 cut-off events.
[2024-06-20 19:48:08,712 INFO  L125   PetriNetUnfolderBase]: For 752793/752795 co-relation queries the response was YES.
[2024-06-20 19:48:08,795 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 106336 conditions, 12904 events. 8334/12904 cut-off events. For 752793/752795 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 84000 event pairs, 3343 based on Foata normal form. 6/12910 useless extension candidates. Maximal degree in co-relation 106227. Up to 12800 conditions per place. 
[2024-06-20 19:48:08,843 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 364 selfloop transitions, 18 changer transitions 0/385 dead transitions.
[2024-06-20 19:48:08,844 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 385 transitions, 7256 flow
[2024-06-20 19:48:08,845 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:48:08,845 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:48:08,845 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions.
[2024-06-20 19:48:08,846 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.390625
[2024-06-20 19:48:08,846 INFO  L175             Difference]: Start difference. First operand has 225 places, 357 transitions, 6358 flow. Second operand 8 states and 125 transitions.
[2024-06-20 19:48:08,846 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 385 transitions, 7256 flow
[2024-06-20 19:48:09,985 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 385 transitions, 7128 flow, removed 33 selfloop flow, removed 6 redundant places.
[2024-06-20 19:48:09,990 INFO  L231             Difference]: Finished difference. Result has 227 places, 359 transitions, 6347 flow
[2024-06-20 19:48:09,990 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6230, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6347, PETRI_PLACES=227, PETRI_TRANSITIONS=359}
[2024-06-20 19:48:09,991 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 186 predicate places.
[2024-06-20 19:48:09,991 INFO  L495      AbstractCegarLoop]: Abstraction has has 227 places, 359 transitions, 6347 flow
[2024-06-20 19:48:09,993 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:48:09,994 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:48:09,994 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:48:09,994 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-20 19:48:09,994 INFO  L420      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:48:09,994 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:48:09,994 INFO  L85        PathProgramCache]: Analyzing trace with hash -94735891, now seen corresponding path program 1 times
[2024-06-20 19:48:09,994 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:48:09,995 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313086451]
[2024-06-20 19:48:09,995 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:48:09,995 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:48:10,039 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:48:17,719 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:48:17,720 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:48:17,721 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313086451]
[2024-06-20 19:48:17,721 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313086451] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:48:17,721 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:48:17,721 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:48:17,721 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219997755]
[2024-06-20 19:48:17,721 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:48:17,722 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:48:17,722 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:48:17,722 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:48:17,722 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:48:17,853 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:48:17,853 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 359 transitions, 6347 flow. Second operand  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:48:17,853 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:48:17,853 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:48:17,853 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:48:21,873 INFO  L124   PetriNetUnfolderBase]: 8330/12901 cut-off events.
[2024-06-20 19:48:21,873 INFO  L125   PetriNetUnfolderBase]: For 780004/780006 co-relation queries the response was YES.
[2024-06-20 19:48:21,962 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 106572 conditions, 12901 events. 8330/12901 cut-off events. For 780004/780006 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 84015 event pairs, 2857 based on Foata normal form. 12/12913 useless extension candidates. Maximal degree in co-relation 106462. Up to 12548 conditions per place. 
[2024-06-20 19:48:22,013 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 332 selfloop transitions, 58 changer transitions 0/393 dead transitions.
[2024-06-20 19:48:22,013 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 393 transitions, 7468 flow
[2024-06-20 19:48:22,013 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:48:22,014 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:48:22,014 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions.
[2024-06-20 19:48:22,014 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.475
[2024-06-20 19:48:22,014 INFO  L175             Difference]: Start difference. First operand has 227 places, 359 transitions, 6347 flow. Second operand 6 states and 114 transitions.
[2024-06-20 19:48:22,014 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 393 transitions, 7468 flow
[2024-06-20 19:48:23,092 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 393 transitions, 7369 flow, removed 33 selfloop flow, removed 6 redundant places.
[2024-06-20 19:48:23,098 INFO  L231             Difference]: Finished difference. Result has 228 places, 366 transitions, 6571 flow
[2024-06-20 19:48:23,098 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6248, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6571, PETRI_PLACES=228, PETRI_TRANSITIONS=366}
[2024-06-20 19:48:23,098 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 187 predicate places.
[2024-06-20 19:48:23,098 INFO  L495      AbstractCegarLoop]: Abstraction has has 228 places, 366 transitions, 6571 flow
[2024-06-20 19:48:23,099 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:48:23,099 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:48:23,099 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:48:23,099 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-20 19:48:23,099 INFO  L420      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:48:23,099 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:48:23,099 INFO  L85        PathProgramCache]: Analyzing trace with hash 518134397, now seen corresponding path program 1 times
[2024-06-20 19:48:23,099 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:48:23,099 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594455060]
[2024-06-20 19:48:23,099 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:48:23,099 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:48:23,136 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:48:31,867 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:48:31,867 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:48:31,867 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594455060]
[2024-06-20 19:48:31,867 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594455060] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:48:31,868 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:48:31,868 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:48:31,868 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852504587]
[2024-06-20 19:48:31,868 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:48:31,868 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:48:31,868 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:48:31,868 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:48:31,869 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:48:31,985 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:48:31,985 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 366 transitions, 6571 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:48:31,985 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:48:31,985 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:48:31,985 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:48:35,609 INFO  L124   PetriNetUnfolderBase]: 8324/12909 cut-off events.
[2024-06-20 19:48:35,609 INFO  L125   PetriNetUnfolderBase]: For 803618/803618 co-relation queries the response was YES.
[2024-06-20 19:48:35,710 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 107602 conditions, 12909 events. 8324/12909 cut-off events. For 803618/803618 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 84371 event pairs, 4707 based on Foata normal form. 2/12911 useless extension candidates. Maximal degree in co-relation 107490. Up to 12796 conditions per place. 
[2024-06-20 19:48:35,764 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 354 selfloop transitions, 33 changer transitions 0/390 dead transitions.
[2024-06-20 19:48:35,764 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 390 transitions, 7495 flow
[2024-06-20 19:48:35,764 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:48:35,764 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:48:35,765 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions.
[2024-06-20 19:48:35,765 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3875
[2024-06-20 19:48:35,765 INFO  L175             Difference]: Start difference. First operand has 228 places, 366 transitions, 6571 flow. Second operand 8 states and 124 transitions.
[2024-06-20 19:48:35,765 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 390 transitions, 7495 flow
[2024-06-20 19:48:37,059 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 390 transitions, 7347 flow, removed 30 selfloop flow, removed 4 redundant places.
[2024-06-20 19:48:37,065 INFO  L231             Difference]: Finished difference. Result has 233 places, 371 transitions, 6601 flow
[2024-06-20 19:48:37,065 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6425, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6601, PETRI_PLACES=233, PETRI_TRANSITIONS=371}
[2024-06-20 19:48:37,065 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 192 predicate places.
[2024-06-20 19:48:37,065 INFO  L495      AbstractCegarLoop]: Abstraction has has 233 places, 371 transitions, 6601 flow
[2024-06-20 19:48:37,066 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:48:37,066 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:48:37,066 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:48:37,066 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-20 19:48:37,066 INFO  L420      AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:48:37,066 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:48:37,066 INFO  L85        PathProgramCache]: Analyzing trace with hash 930803381, now seen corresponding path program 1 times
[2024-06-20 19:48:37,066 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:48:37,066 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885310189]
[2024-06-20 19:48:37,066 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:48:37,066 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:48:37,118 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:48:47,315 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:48:47,316 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:48:47,316 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885310189]
[2024-06-20 19:48:47,316 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885310189] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:48:47,316 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:48:47,316 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:48:47,316 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699782923]
[2024-06-20 19:48:47,316 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:48:47,316 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:48:47,316 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:48:47,316 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:48:47,316 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:48:47,440 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:48:47,440 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 371 transitions, 6601 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:48:47,441 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:48:47,441 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:48:47,441 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:48:51,136 INFO  L124   PetriNetUnfolderBase]: 8319/12902 cut-off events.
[2024-06-20 19:48:51,136 INFO  L125   PetriNetUnfolderBase]: For 831812/831812 co-relation queries the response was YES.
[2024-06-20 19:48:51,242 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 108431 conditions, 12902 events. 8319/12902 cut-off events. For 831812/831812 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 83772 event pairs, 4693 based on Foata normal form. 2/12904 useless extension candidates. Maximal degree in co-relation 108317. Up to 12858 conditions per place. 
[2024-06-20 19:48:51,296 INFO  L140   encePairwiseOnDemand]: 34/40 looper letters, 367 selfloop transitions, 12 changer transitions 0/382 dead transitions.
[2024-06-20 19:48:51,296 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 382 transitions, 7425 flow
[2024-06-20 19:48:51,297 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 19:48:51,297 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 19:48:51,297 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions.
[2024-06-20 19:48:51,298 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4
[2024-06-20 19:48:51,298 INFO  L175             Difference]: Start difference. First operand has 233 places, 371 transitions, 6601 flow. Second operand 5 states and 80 transitions.
[2024-06-20 19:48:51,298 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 382 transitions, 7425 flow
[2024-06-20 19:48:52,527 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 382 transitions, 7325 flow, removed 25 selfloop flow, removed 4 redundant places.
[2024-06-20 19:48:52,532 INFO  L231             Difference]: Finished difference. Result has 234 places, 373 transitions, 6576 flow
[2024-06-20 19:48:52,533 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6501, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6576, PETRI_PLACES=234, PETRI_TRANSITIONS=373}
[2024-06-20 19:48:52,534 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 193 predicate places.
[2024-06-20 19:48:52,534 INFO  L495      AbstractCegarLoop]: Abstraction has has 234 places, 373 transitions, 6576 flow
[2024-06-20 19:48:52,534 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:48:52,535 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:48:52,535 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:48:52,535 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-20 19:48:52,535 INFO  L420      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:48:52,535 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:48:52,535 INFO  L85        PathProgramCache]: Analyzing trace with hash -1433898534, now seen corresponding path program 1 times
[2024-06-20 19:48:52,535 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:48:52,535 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562527912]
[2024-06-20 19:48:52,535 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:48:52,535 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:48:52,584 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:49:01,395 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:49:01,396 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:49:01,396 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562527912]
[2024-06-20 19:49:01,396 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562527912] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:49:01,396 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:49:01,396 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:49:01,396 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595123927]
[2024-06-20 19:49:01,396 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:49:01,396 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:49:01,396 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:49:01,397 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:49:01,397 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:49:01,593 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:49:01,593 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 373 transitions, 6576 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:49:01,593 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:49:01,593 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:49:01,593 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:49:05,769 INFO  L124   PetriNetUnfolderBase]: 8445/13071 cut-off events.
[2024-06-20 19:49:05,769 INFO  L125   PetriNetUnfolderBase]: For 864473/864501 co-relation queries the response was YES.
[2024-06-20 19:49:05,869 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 111360 conditions, 13071 events. 8445/13071 cut-off events. For 864473/864501 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 85221 event pairs, 3209 based on Foata normal form. 30/13101 useless extension candidates. Maximal degree in co-relation 111244. Up to 12799 conditions per place. 
[2024-06-20 19:49:05,924 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 377 selfloop transitions, 52 changer transitions 0/432 dead transitions.
[2024-06-20 19:49:05,924 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 432 transitions, 8170 flow
[2024-06-20 19:49:05,924 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:49:05,925 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:49:05,925 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions.
[2024-06-20 19:49:05,925 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44722222222222224
[2024-06-20 19:49:05,925 INFO  L175             Difference]: Start difference. First operand has 234 places, 373 transitions, 6576 flow. Second operand 9 states and 161 transitions.
[2024-06-20 19:49:05,925 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 432 transitions, 8170 flow
[2024-06-20 19:49:07,247 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 432 transitions, 8111 flow, removed 19 selfloop flow, removed 3 redundant places.
[2024-06-20 19:49:07,253 INFO  L231             Difference]: Finished difference. Result has 242 places, 395 transitions, 7183 flow
[2024-06-20 19:49:07,253 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6517, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7183, PETRI_PLACES=242, PETRI_TRANSITIONS=395}
[2024-06-20 19:49:07,253 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 201 predicate places.
[2024-06-20 19:49:07,254 INFO  L495      AbstractCegarLoop]: Abstraction has has 242 places, 395 transitions, 7183 flow
[2024-06-20 19:49:07,254 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:49:07,254 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:49:07,254 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:49:07,254 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-20 19:49:07,254 INFO  L420      AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:49:07,254 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:49:07,254 INFO  L85        PathProgramCache]: Analyzing trace with hash -91171536, now seen corresponding path program 2 times
[2024-06-20 19:49:07,254 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:49:07,254 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657199000]
[2024-06-20 19:49:07,254 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:49:07,254 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:49:07,299 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:49:16,963 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:49:16,963 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:49:16,964 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657199000]
[2024-06-20 19:49:16,964 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657199000] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:49:16,964 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:49:16,964 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:49:16,964 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659459658]
[2024-06-20 19:49:16,964 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:49:16,964 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:49:16,964 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:49:16,964 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:49:16,964 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:49:17,111 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:49:17,112 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 395 transitions, 7183 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:49:17,112 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:49:17,112 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:49:17,112 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:49:21,471 INFO  L124   PetriNetUnfolderBase]: 8867/13678 cut-off events.
[2024-06-20 19:49:21,472 INFO  L125   PetriNetUnfolderBase]: For 928231/928255 co-relation queries the response was YES.
[2024-06-20 19:49:21,584 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 121121 conditions, 13678 events. 8867/13678 cut-off events. For 928231/928255 co-relation queries the response was YES. Maximal size of possible extension queue 575. Compared 88935 event pairs, 3109 based on Foata normal form. 26/13704 useless extension candidates. Maximal degree in co-relation 121002. Up to 12985 conditions per place. 
[2024-06-20 19:49:21,647 INFO  L140   encePairwiseOnDemand]: 25/40 looper letters, 404 selfloop transitions, 110 changer transitions 0/517 dead transitions.
[2024-06-20 19:49:21,647 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 517 transitions, 10547 flow
[2024-06-20 19:49:21,649 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:49:21,649 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:49:21,649 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions.
[2024-06-20 19:49:21,649 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4425
[2024-06-20 19:49:21,650 INFO  L175             Difference]: Start difference. First operand has 242 places, 395 transitions, 7183 flow. Second operand 10 states and 177 transitions.
[2024-06-20 19:49:21,650 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 517 transitions, 10547 flow
[2024-06-20 19:49:23,284 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 517 transitions, 10213 flow, removed 87 selfloop flow, removed 5 redundant places.
[2024-06-20 19:49:23,291 INFO  L231             Difference]: Finished difference. Result has 252 places, 467 transitions, 9056 flow
[2024-06-20 19:49:23,292 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7011, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9056, PETRI_PLACES=252, PETRI_TRANSITIONS=467}
[2024-06-20 19:49:23,292 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 211 predicate places.
[2024-06-20 19:49:23,292 INFO  L495      AbstractCegarLoop]: Abstraction has has 252 places, 467 transitions, 9056 flow
[2024-06-20 19:49:23,292 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:49:23,292 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:49:23,292 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:49:23,292 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-20 19:49:23,292 INFO  L420      AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:49:23,293 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:49:23,293 INFO  L85        PathProgramCache]: Analyzing trace with hash 725401106, now seen corresponding path program 3 times
[2024-06-20 19:49:23,293 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:49:23,293 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099847644]
[2024-06-20 19:49:23,293 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:49:23,293 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:49:23,335 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:49:31,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-06-20 19:49:31,866 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:49:31,866 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099847644]
[2024-06-20 19:49:31,866 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099847644] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:49:31,866 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:49:31,866 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:49:31,866 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205067669]
[2024-06-20 19:49:31,866 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:49:31,867 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:49:31,867 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:49:31,867 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:49:31,867 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:49:32,035 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:49:32,035 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 467 transitions, 9056 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:49:32,035 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:49:32,035 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:49:32,035 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:49:36,386 INFO  L124   PetriNetUnfolderBase]: 9051/13951 cut-off events.
[2024-06-20 19:49:36,386 INFO  L125   PetriNetUnfolderBase]: For 982489/982515 co-relation queries the response was YES.
[2024-06-20 19:49:36,549 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 127169 conditions, 13951 events. 9051/13951 cut-off events. For 982489/982515 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 90593 event pairs, 3256 based on Foata normal form. 28/13979 useless extension candidates. Maximal degree in co-relation 127044. Up to 13108 conditions per place. 
[2024-06-20 19:49:36,618 INFO  L140   encePairwiseOnDemand]: 25/40 looper letters, 457 selfloop transitions, 204 changer transitions 0/664 dead transitions.
[2024-06-20 19:49:36,618 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 664 transitions, 14337 flow
[2024-06-20 19:49:36,619 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:49:36,619 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:49:36,619 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions.
[2024-06-20 19:49:36,619 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46944444444444444
[2024-06-20 19:49:36,619 INFO  L175             Difference]: Start difference. First operand has 252 places, 467 transitions, 9056 flow. Second operand 9 states and 169 transitions.
[2024-06-20 19:49:36,619 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 664 transitions, 14337 flow
[2024-06-20 19:49:38,892 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 664 transitions, 14007 flow, removed 101 selfloop flow, removed 3 redundant places.
[2024-06-20 19:49:38,902 INFO  L231             Difference]: Finished difference. Result has 263 places, 603 transitions, 12639 flow
[2024-06-20 19:49:38,903 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8859, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=467, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12639, PETRI_PLACES=263, PETRI_TRANSITIONS=603}
[2024-06-20 19:49:38,903 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 222 predicate places.
[2024-06-20 19:49:38,903 INFO  L495      AbstractCegarLoop]: Abstraction has has 263 places, 603 transitions, 12639 flow
[2024-06-20 19:49:38,903 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:49:38,903 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:49:38,903 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:49:38,903 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-20 19:49:38,903 INFO  L420      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:49:38,904 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:49:38,904 INFO  L85        PathProgramCache]: Analyzing trace with hash -1223184681, now seen corresponding path program 1 times
[2024-06-20 19:49:38,904 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:49:38,904 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174113464]
[2024-06-20 19:49:38,904 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:49:38,904 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:49:38,933 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:49:48,247 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:49:48,247 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:49:48,248 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174113464]
[2024-06-20 19:49:48,248 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174113464] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:49:48,248 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:49:48,248 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:49:48,248 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041539094]
[2024-06-20 19:49:48,248 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:49:48,248 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:49:48,248 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:49:48,248 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:49:48,248 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:49:48,391 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:49:48,391 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 603 transitions, 12639 flow. Second operand  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:49:48,391 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:49:48,391 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:49:48,391 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:49:54,555 INFO  L124   PetriNetUnfolderBase]: 9814/15084 cut-off events.
[2024-06-20 19:49:54,555 INFO  L125   PetriNetUnfolderBase]: For 1213595/1213641 co-relation queries the response was YES.
[2024-06-20 19:49:54,696 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 145007 conditions, 15084 events. 9814/15084 cut-off events. For 1213595/1213641 co-relation queries the response was YES. Maximal size of possible extension queue 613. Compared 98367 event pairs, 3157 based on Foata normal form. 140/15224 useless extension candidates. Maximal degree in co-relation 144876. Up to 13815 conditions per place. 
[2024-06-20 19:49:54,768 INFO  L140   encePairwiseOnDemand]: 24/40 looper letters, 604 selfloop transitions, 146 changer transitions 5/758 dead transitions.
[2024-06-20 19:49:54,769 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 758 transitions, 16903 flow
[2024-06-20 19:49:54,769 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-20 19:49:54,769 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-20 19:49:54,770 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 213 transitions.
[2024-06-20 19:49:54,770 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48409090909090907
[2024-06-20 19:49:54,770 INFO  L175             Difference]: Start difference. First operand has 263 places, 603 transitions, 12639 flow. Second operand 11 states and 213 transitions.
[2024-06-20 19:49:54,770 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 758 transitions, 16903 flow
[2024-06-20 19:49:57,031 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 758 transitions, 16735 flow, removed 83 selfloop flow, removed 1 redundant places.
[2024-06-20 19:49:57,043 INFO  L231             Difference]: Finished difference. Result has 279 places, 680 transitions, 14936 flow
[2024-06-20 19:49:57,043 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=12483, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=603, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=475, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=14936, PETRI_PLACES=279, PETRI_TRANSITIONS=680}
[2024-06-20 19:49:57,044 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 238 predicate places.
[2024-06-20 19:49:57,044 INFO  L495      AbstractCegarLoop]: Abstraction has has 279 places, 680 transitions, 14936 flow
[2024-06-20 19:49:57,044 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:49:57,044 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:49:57,044 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:49:57,044 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-20 19:49:57,044 INFO  L420      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:49:57,044 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:49:57,045 INFO  L85        PathProgramCache]: Analyzing trace with hash 2130715060, now seen corresponding path program 4 times
[2024-06-20 19:49:57,045 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:49:57,045 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687818328]
[2024-06-20 19:49:57,045 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:49:57,045 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:49:57,097 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:50:05,213 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:50:05,213 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:50:05,213 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687818328]
[2024-06-20 19:50:05,213 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687818328] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:50:05,214 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:50:05,214 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:50:05,214 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558455373]
[2024-06-20 19:50:05,214 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:50:05,214 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:50:05,214 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:50:05,214 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:50:05,214 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:50:05,305 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:50:05,306 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 680 transitions, 14936 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:50:05,306 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:50:05,306 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:50:05,306 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:50:10,871 INFO  L124   PetriNetUnfolderBase]: 9838/15120 cut-off events.
[2024-06-20 19:50:10,872 INFO  L125   PetriNetUnfolderBase]: For 1211821/1211847 co-relation queries the response was YES.
[2024-06-20 19:50:11,048 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 149152 conditions, 15120 events. 9838/15120 cut-off events. For 1211821/1211847 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 98537 event pairs, 3032 based on Foata normal form. 44/15164 useless extension candidates. Maximal degree in co-relation 149012. Up to 14401 conditions per place. 
[2024-06-20 19:50:11,119 INFO  L140   encePairwiseOnDemand]: 24/40 looper letters, 563 selfloop transitions, 167 changer transitions 2/735 dead transitions.
[2024-06-20 19:50:11,119 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 735 transitions, 17055 flow
[2024-06-20 19:50:11,120 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:50:11,120 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:50:11,120 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 173 transitions.
[2024-06-20 19:50:11,121 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4325
[2024-06-20 19:50:11,121 INFO  L175             Difference]: Start difference. First operand has 279 places, 680 transitions, 14936 flow. Second operand 10 states and 173 transitions.
[2024-06-20 19:50:11,121 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 735 transitions, 17055 flow
[2024-06-20 19:50:13,700 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 735 transitions, 16689 flow, removed 176 selfloop flow, removed 2 redundant places.
[2024-06-20 19:50:13,711 INFO  L231             Difference]: Finished difference. Result has 291 places, 695 transitions, 15468 flow
[2024-06-20 19:50:13,712 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=14576, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=680, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=513, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=15468, PETRI_PLACES=291, PETRI_TRANSITIONS=695}
[2024-06-20 19:50:13,712 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 250 predicate places.
[2024-06-20 19:50:13,712 INFO  L495      AbstractCegarLoop]: Abstraction has has 291 places, 695 transitions, 15468 flow
[2024-06-20 19:50:13,712 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:50:13,712 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:50:13,713 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:50:13,713 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-20 19:50:13,713 INFO  L420      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:50:13,713 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:50:13,713 INFO  L85        PathProgramCache]: Analyzing trace with hash 56914757, now seen corresponding path program 2 times
[2024-06-20 19:50:13,713 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:50:13,713 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541345180]
[2024-06-20 19:50:13,713 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:50:13,714 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:50:13,744 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:50:22,074 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:50:22,074 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:50:22,074 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541345180]
[2024-06-20 19:50:22,074 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541345180] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:50:22,075 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:50:22,075 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:50:22,075 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500996214]
[2024-06-20 19:50:22,075 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:50:22,075 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:50:22,075 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:50:22,075 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:50:22,075 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:50:22,305 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:50:22,306 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 695 transitions, 15468 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:50:22,306 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:50:22,306 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:50:22,306 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand