./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix038_tso.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/mix038_tso.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/mix038_tso.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix038_tso.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:08:19,501 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-20 19:08:19,569 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-20 19:08:19,573 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-20 19:08:19,574 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-20 19:08:19,596 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-20 19:08:19,597 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-20 19:08:19,597 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-20 19:08:19,598 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-20 19:08:19,601 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-20 19:08:19,601 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-20 19:08:19,602 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-20 19:08:19,602 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-20 19:08:19,603 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-20 19:08:19,603 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-20 19:08:19,604 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-20 19:08:19,604 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-20 19:08:19,604 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-20 19:08:19,605 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-20 19:08:19,605 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-20 19:08:19,605 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-20 19:08:19,605 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-20 19:08:19,606 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-20 19:08:19,606 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-20 19:08:19,606 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-20 19:08:19,606 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-20 19:08:19,607 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-20 19:08:19,607 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-20 19:08:19,608 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-20 19:08:19,608 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-20 19:08:19,609 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-20 19:08:19,609 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-20 19:08:19,609 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-20 19:08:19,609 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-20 19:08:19,610 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-20 19:08:19,610 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-20 19:08:19,610 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-20 19:08:19,610 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-20 19:08:19,610 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-20 19:08:19,611 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-20 19:08:19,611 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-20 19:08:19,611 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-20 19:08:19,611 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-20 19:08:19,612 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:08:19,817 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-20 19:08:19,833 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-20 19:08:19,835 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-20 19:08:19,836 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-20 19:08:19,837 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-20 19:08:19,837 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i
[2024-06-20 19:08:20,900 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-20 19:08:21,119 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-20 19:08:21,121 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i
[2024-06-20 19:08:21,137 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b980b163/01c66bf7d2bc4cb6948c506ddd32e658/FLAGd53203c3e
[2024-06-20 19:08:21,149 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b980b163/01c66bf7d2bc4cb6948c506ddd32e658
[2024-06-20 19:08:21,151 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-20 19:08:21,151 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-20 19:08:21,152 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/mix038_tso.oepc.yml/witness.yml
[2024-06-20 19:08:21,335 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-20 19:08:21,336 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-20 19:08:21,337 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-20 19:08:21,337 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-20 19:08:21,341 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-20 19:08:21,342 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:08:21" (1/2) ...
[2024-06-20 19:08:21,343 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@974ac9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:08:21, skipping insertion in model container
[2024-06-20 19:08:21,343 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:08:21" (1/2) ...
[2024-06-20 19:08:21,346 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2333cc2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:08:21, skipping insertion in model container
[2024-06-20 19:08:21,346 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:08:21" (2/2) ...
[2024-06-20 19:08:21,346 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@974ac9f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:08:21, skipping insertion in model container
[2024-06-20 19:08:21,347 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:08:21" (2/2) ...
[2024-06-20 19:08:21,347 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-20 19:08:21,461 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-20 19:08:21,462 INFO  L97    edCorrectnessWitness]: Location invariant before [L836-L836] ((((((((((((((((((((! multithreaded || x$r_buff0_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a) + (long long )x >= 0LL) && (1LL - (long long )a) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )y >= 0LL) && (1LL - (long long )a) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )x$flush_delayed >= 0LL) && (long long )a + (long long )x$mem_tmp >= 0LL) && (long long )a + (long long )x$r_buff0_thd0 >= 0LL) && (long long )a + (long long )x$r_buff0_thd1 >= 0LL) && (long long )a + (long long )x$r_buff0_thd2 >= 0LL) && (long long )a + (long long )x$r_buff0_thd3 >= 0LL) && (long long )a + (long long )x$r_buff1_thd0 >= 0LL) && (long long )a + (long long )x$r_buff1_thd1 >= 0LL) && (long long )a + (long long )x$r_buff1_thd2 >= 0LL) && (long long )a + (long long )x$r_buff1_thd3 >= 0LL) && (long long )a + (long long )x$read_delayed >= 0LL) && (long long )a + (long long )x$w_buff0 >= 0LL) && (long long )a + (long long )x$w_buff1 >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$read_delayed >= 0LL) && (long long )a - (long long )x$r_buff0_thd0 >= 0LL) && (long long )a - (long long )x$r_buff0_thd1 >= 0LL) && (long long )a - (long long )x$r_buff0_thd3 >= 0LL) && (long long )a - (long long )x$r_buff1_thd0 >= 0LL) && (long long )a - (long long )x$r_buff1_thd1 >= 0LL) && (long long )a - (long long )x$r_buff1_thd3 >= 0LL) && (long long )a - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))
[2024-06-20 19:08:21,463 INFO  L97    edCorrectnessWitness]: Location invariant before [L833-L833] ((((((((((((((((((((! multithreaded || x$r_buff0_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a) + (long long )x >= 0LL) && (1LL - (long long )a) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )y >= 0LL) && (1LL - (long long )a) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )x$flush_delayed >= 0LL) && (long long )a + (long long )x$mem_tmp >= 0LL) && (long long )a + (long long )x$r_buff0_thd0 >= 0LL) && (long long )a + (long long )x$r_buff0_thd1 >= 0LL) && (long long )a + (long long )x$r_buff0_thd2 >= 0LL) && (long long )a + (long long )x$r_buff0_thd3 >= 0LL) && (long long )a + (long long )x$r_buff1_thd0 >= 0LL) && (long long )a + (long long )x$r_buff1_thd1 >= 0LL) && (long long )a + (long long )x$r_buff1_thd2 >= 0LL) && (long long )a + (long long )x$r_buff1_thd3 >= 0LL) && (long long )a + (long long )x$read_delayed >= 0LL) && (long long )a + (long long )x$w_buff0 >= 0LL) && (long long )a + (long long )x$w_buff1 >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$read_delayed >= 0LL) && (long long )a - (long long )x$r_buff0_thd0 >= 0LL) && (long long )a - (long long )x$r_buff0_thd1 >= 0LL) && (long long )a - (long long )x$r_buff0_thd3 >= 0LL) && (long long )a - (long long )x$r_buff1_thd0 >= 0LL) && (long long )a - (long long )x$r_buff1_thd1 >= 0LL) && (long long )a - (long long )x$r_buff1_thd3 >= 0LL) && (long long )a - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))
[2024-06-20 19:08:21,463 INFO  L97    edCorrectnessWitness]: Location invariant before [L835-L835] ((((((((((((((((((((! multithreaded || x$r_buff0_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a) + (long long )x >= 0LL) && (1LL - (long long )a) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )y >= 0LL) && (1LL - (long long )a) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )x$flush_delayed >= 0LL) && (long long )a + (long long )x$mem_tmp >= 0LL) && (long long )a + (long long )x$r_buff0_thd0 >= 0LL) && (long long )a + (long long )x$r_buff0_thd1 >= 0LL) && (long long )a + (long long )x$r_buff0_thd2 >= 0LL) && (long long )a + (long long )x$r_buff0_thd3 >= 0LL) && (long long )a + (long long )x$r_buff1_thd0 >= 0LL) && (long long )a + (long long )x$r_buff1_thd1 >= 0LL) && (long long )a + (long long )x$r_buff1_thd2 >= 0LL) && (long long )a + (long long )x$r_buff1_thd3 >= 0LL) && (long long )a + (long long )x$read_delayed >= 0LL) && (long long )a + (long long )x$w_buff0 >= 0LL) && (long long )a + (long long )x$w_buff1 >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$read_delayed >= 0LL) && (long long )a - (long long )x$r_buff0_thd0 >= 0LL) && (long long )a - (long long )x$r_buff0_thd1 >= 0LL) && (long long )a - (long long )x$r_buff0_thd3 >= 0LL) && (long long )a - (long long )x$r_buff1_thd0 >= 0LL) && (long long )a - (long long )x$r_buff1_thd1 >= 0LL) && (long long )a - (long long )x$r_buff1_thd3 >= 0LL) && (long long )a - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))
[2024-06-20 19:08:21,464 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-20 19:08:21,464 INFO  L106   edCorrectnessWitness]: ghost_update [L831-L831] multithreaded = 1;
[2024-06-20 19:08:21,487 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-20 19:08:21,736 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-20 19:08:21,756 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:08:22,122 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-20 19:08:22,148 INFO  L206         MainTranslator]: Completed translation
[2024-06-20 19:08:22,149 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:08:22 WrapperNode
[2024-06-20 19:08:22,149 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-20 19:08:22,150 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-20 19:08:22,150 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-20 19:08:22,150 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-20 19:08:22,155 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:08:22" (1/1) ...
[2024-06-20 19:08:22,197 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:08:22" (1/1) ...
[2024-06-20 19:08:22,315 INFO  L138                Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 146
[2024-06-20 19:08:22,315 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-20 19:08:22,316 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-20 19:08:22,316 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-20 19:08:22,316 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-20 19:08:22,397 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:08:22" (1/1) ...
[2024-06-20 19:08:22,397 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:08:22" (1/1) ...
[2024-06-20 19:08:22,454 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:08:22" (1/1) ...
[2024-06-20 19:08:22,487 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:08:22,488 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:08:22" (1/1) ...
[2024-06-20 19:08:22,488 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:08:22" (1/1) ...
[2024-06-20 19:08:22,530 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:08:22" (1/1) ...
[2024-06-20 19:08:22,532 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:08:22" (1/1) ...
[2024-06-20 19:08:22,543 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:08:22" (1/1) ...
[2024-06-20 19:08:22,548 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:08:22" (1/1) ...
[2024-06-20 19:08:22,565 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-20 19:08:22,566 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-20 19:08:22,567 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-20 19:08:22,567 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-20 19:08:22,568 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:08:22" (1/1) ...
[2024-06-20 19:08:22,572 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-20 19:08:22,578 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-20 19:08:22,594 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:08:22,605 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:08:22,695 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-20 19:08:22,695 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-20 19:08:22,695 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-20 19:08:22,695 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-20 19:08:22,695 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-20 19:08:22,695 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-20 19:08:22,695 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-20 19:08:22,695 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-20 19:08:22,695 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-20 19:08:22,695 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-20 19:08:22,695 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-20 19:08:22,696 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-20 19:08:22,696 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:08:22,875 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-20 19:08:22,878 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-20 19:08:24,017 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-20 19:08:24,018 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-20 19:08:24,318 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-20 19:08:24,319 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-20 19:08:24,319 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:08:24 BoogieIcfgContainer
[2024-06-20 19:08:24,319 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-20 19:08:24,322 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-20 19:08:24,322 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-20 19:08:24,325 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-20 19:08:24,325 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.06 07:08:21" (1/4) ...
[2024-06-20 19:08:24,325 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71494f4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 07:08:24, skipping insertion in model container
[2024-06-20 19:08:24,325 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:08:21" (2/4) ...
[2024-06-20 19:08:24,326 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71494f4c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 07:08:24, skipping insertion in model container
[2024-06-20 19:08:24,326 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:08:22" (3/4) ...
[2024-06-20 19:08:24,326 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71494f4c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 07:08:24, skipping insertion in model container
[2024-06-20 19:08:24,326 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:08:24" (4/4) ...
[2024-06-20 19:08:24,327 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix038_tso.oepc.i
[2024-06-20 19:08:24,342 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-20 19:08:24,342 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-20 19:08:24,342 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-20 19:08:24,480 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-20 19:08:24,509 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 96 flow
[2024-06-20 19:08:24,565 INFO  L124   PetriNetUnfolderBase]: 0/39 cut-off events.
[2024-06-20 19:08:24,566 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-20 19:08:24,568 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-20 19:08:24,569 INFO  L82        GeneralOperation]: Start removeDead. Operand has 52 places, 42 transitions, 96 flow
[2024-06-20 19:08:24,572 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow
[2024-06-20 19:08:24,582 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-20 19:08:24,588 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;@79699697, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-20 19:08:24,588 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-20 19:08:24,598 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-20 19:08:24,598 INFO  L124   PetriNetUnfolderBase]: 0/5 cut-off events.
[2024-06-20 19:08:24,598 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-20 19:08:24,598 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:08:24,599 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1]
[2024-06-20 19:08:24,599 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:08:24,606 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:08:24,606 INFO  L85        PathProgramCache]: Analyzing trace with hash 378883743, now seen corresponding path program 1 times
[2024-06-20 19:08:24,613 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:08:24,613 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612267804]
[2024-06-20 19:08:24,613 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:08:24,614 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:08:25,097 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:08:31,170 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:08:31,171 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:08:31,172 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612267804]
[2024-06-20 19:08:31,172 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612267804] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:08:31,172 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:08:31,172 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-20 19:08:31,175 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407384043]
[2024-06-20 19:08:31,176 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:08:31,182 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-20 19:08:31,185 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:08:31,206 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-20 19:08:31,207 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-20 19:08:31,279 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 19:08:31,282 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 75 flow. Second operand  has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 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:08:31,282 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:08:31,282 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 19:08:31,283 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:08:32,268 INFO  L124   PetriNetUnfolderBase]: 1363/2170 cut-off events.
[2024-06-20 19:08:32,268 INFO  L125   PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES.
[2024-06-20 19:08:32,275 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4294 conditions, 2170 events. 1363/2170 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 10777 event pairs, 964 based on Foata normal form. 1/2092 useless extension candidates. Maximal degree in co-relation 4282. Up to 2037 conditions per place. 
[2024-06-20 19:08:32,283 INFO  L140   encePairwiseOnDemand]: 35/42 looper letters, 32 selfloop transitions, 4 changer transitions 0/43 dead transitions.
[2024-06-20 19:08:32,284 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 173 flow
[2024-06-20 19:08:32,285 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-20 19:08:32,287 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-20 19:08:32,292 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions.
[2024-06-20 19:08:32,293 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5952380952380952
[2024-06-20 19:08:32,294 INFO  L175             Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 3 states and 75 transitions.
[2024-06-20 19:08:32,295 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 173 flow
[2024-06-20 19:08:32,297 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 168 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-20 19:08:32,299 INFO  L231             Difference]: Finished difference. Result has 43 places, 36 transitions, 102 flow
[2024-06-20 19:08:32,300 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=43, PETRI_TRANSITIONS=36}
[2024-06-20 19:08:32,303 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places.
[2024-06-20 19:08:32,303 INFO  L495      AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 102 flow
[2024-06-20 19:08:32,303 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 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:08:32,304 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:08:32,304 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:08:32,304 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-20 19:08:32,305 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:08:32,305 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:08:32,306 INFO  L85        PathProgramCache]: Analyzing trace with hash -964910146, now seen corresponding path program 1 times
[2024-06-20 19:08:32,306 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:08:32,306 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157070450]
[2024-06-20 19:08:32,306 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:08:32,306 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:08:32,386 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:08:37,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:08:37,267 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:08:37,267 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157070450]
[2024-06-20 19:08:37,267 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157070450] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:08:37,267 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:08:37,267 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-20 19:08:37,267 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941851648]
[2024-06-20 19:08:37,268 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:08:37,269 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-20 19:08:37,269 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:08:37,269 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-20 19:08:37,269 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-06-20 19:08:37,369 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-20 19:08:37,369 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 102 flow. Second operand  has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 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:08:37,370 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:08:37,370 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-20 19:08:37,370 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:08:38,480 INFO  L124   PetriNetUnfolderBase]: 1564/2415 cut-off events.
[2024-06-20 19:08:38,480 INFO  L125   PetriNetUnfolderBase]: For 445/445 co-relation queries the response was YES.
[2024-06-20 19:08:38,483 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5442 conditions, 2415 events. 1564/2415 cut-off events. For 445/445 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 11760 event pairs, 981 based on Foata normal form. 3/2379 useless extension candidates. Maximal degree in co-relation 5430. Up to 2310 conditions per place. 
[2024-06-20 19:08:38,494 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 40 selfloop transitions, 7 changer transitions 0/53 dead transitions.
[2024-06-20 19:08:38,494 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 242 flow
[2024-06-20 19:08:38,494 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-20 19:08:38,495 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-20 19:08:38,497 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions.
[2024-06-20 19:08:38,497 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5595238095238095
[2024-06-20 19:08:38,498 INFO  L175             Difference]: Start difference. First operand has 43 places, 36 transitions, 102 flow. Second operand 4 states and 94 transitions.
[2024-06-20 19:08:38,498 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 242 flow
[2024-06-20 19:08:38,498 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-20 19:08:38,501 INFO  L231             Difference]: Finished difference. Result has 46 places, 39 transitions, 138 flow
[2024-06-20 19:08:38,502 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=46, PETRI_TRANSITIONS=39}
[2024-06-20 19:08:38,502 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places.
[2024-06-20 19:08:38,502 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 138 flow
[2024-06-20 19:08:38,503 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 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:08:38,503 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:08:38,504 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:08:38,506 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-20 19:08:38,506 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:08:38,507 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:08:38,507 INFO  L85        PathProgramCache]: Analyzing trace with hash 152557638, now seen corresponding path program 1 times
[2024-06-20 19:08:38,507 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:08:38,512 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156221081]
[2024-06-20 19:08:38,512 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:08:38,513 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:08:38,571 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:08:43,448 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:08:43,448 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:08:43,448 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156221081]
[2024-06-20 19:08:43,449 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156221081] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:08:43,449 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:08:43,449 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-20 19:08:43,449 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524303465]
[2024-06-20 19:08:43,449 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:08:43,450 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-20 19:08:43,450 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:08:43,450 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-20 19:08:43,450 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2024-06-20 19:08:43,571 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-20 19:08:43,571 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 138 flow. Second operand  has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 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:08:43,571 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:08:43,571 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-20 19:08:43,571 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:08:44,546 INFO  L124   PetriNetUnfolderBase]: 1552/2399 cut-off events.
[2024-06-20 19:08:44,547 INFO  L125   PetriNetUnfolderBase]: For 1262/1262 co-relation queries the response was YES.
[2024-06-20 19:08:44,552 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5994 conditions, 2399 events. 1552/2399 cut-off events. For 1262/1262 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 11673 event pairs, 697 based on Foata normal form. 6/2366 useless extension candidates. Maximal degree in co-relation 5980. Up to 2262 conditions per place. 
[2024-06-20 19:08:44,562 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 48 selfloop transitions, 10 changer transitions 0/64 dead transitions.
[2024-06-20 19:08:44,562 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 64 transitions, 324 flow
[2024-06-20 19:08:44,562 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 19:08:44,563 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 19:08:44,565 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions.
[2024-06-20 19:08:44,567 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5523809523809524
[2024-06-20 19:08:44,567 INFO  L175             Difference]: Start difference. First operand has 46 places, 39 transitions, 138 flow. Second operand 5 states and 116 transitions.
[2024-06-20 19:08:44,567 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 64 transitions, 324 flow
[2024-06-20 19:08:44,569 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 64 transitions, 310 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-06-20 19:08:44,570 INFO  L231             Difference]: Finished difference. Result has 49 places, 42 transitions, 174 flow
[2024-06-20 19:08:44,571 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=174, PETRI_PLACES=49, PETRI_TRANSITIONS=42}
[2024-06-20 19:08:44,572 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places.
[2024-06-20 19:08:44,572 INFO  L495      AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 174 flow
[2024-06-20 19:08:44,572 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 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:08:44,572 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:08:44,572 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:08:44,572 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-20 19:08:44,573 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:08:44,573 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:08:44,573 INFO  L85        PathProgramCache]: Analyzing trace with hash -1140494977, now seen corresponding path program 1 times
[2024-06-20 19:08:44,573 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:08:44,573 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914500531]
[2024-06-20 19:08:44,574 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:08:44,574 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:08:44,643 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:08:50,561 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:08:50,562 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:08:50,562 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914500531]
[2024-06-20 19:08:50,567 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914500531] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:08:50,568 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:08:50,568 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:08:50,568 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928660783]
[2024-06-20 19:08:50,568 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:08:50,568 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:08:50,569 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:08:50,569 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:08:50,569 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:08:50,681 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-20 19:08:50,681 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 174 flow. Second operand  has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 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:08:50,681 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:08:50,681 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-20 19:08:50,681 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:08:51,804 INFO  L124   PetriNetUnfolderBase]: 1543/2382 cut-off events.
[2024-06-20 19:08:51,805 INFO  L125   PetriNetUnfolderBase]: For 2338/2338 co-relation queries the response was YES.
[2024-06-20 19:08:51,809 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6524 conditions, 2382 events. 1543/2382 cut-off events. For 2338/2338 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 11552 event pairs, 534 based on Foata normal form. 6/2349 useless extension candidates. Maximal degree in co-relation 6509. Up to 2217 conditions per place. 
[2024-06-20 19:08:51,817 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 52 selfloop transitions, 12 changer transitions 0/70 dead transitions.
[2024-06-20 19:08:51,817 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 70 transitions, 378 flow
[2024-06-20 19:08:51,818 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:08:51,818 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:08:51,819 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions.
[2024-06-20 19:08:51,819 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5277777777777778
[2024-06-20 19:08:51,819 INFO  L175             Difference]: Start difference. First operand has 49 places, 42 transitions, 174 flow. Second operand 6 states and 133 transitions.
[2024-06-20 19:08:51,819 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 70 transitions, 378 flow
[2024-06-20 19:08:51,823 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 70 transitions, 354 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-06-20 19:08:51,824 INFO  L231             Difference]: Finished difference. Result has 51 places, 43 transitions, 193 flow
[2024-06-20 19:08:51,824 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=193, PETRI_PLACES=51, PETRI_TRANSITIONS=43}
[2024-06-20 19:08:51,825 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places.
[2024-06-20 19:08:51,825 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 193 flow
[2024-06-20 19:08:51,826 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 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:08:51,826 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:08:51,826 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:08:51,826 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-20 19:08:51,826 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:08:51,826 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:08:51,827 INFO  L85        PathProgramCache]: Analyzing trace with hash -4445516, now seen corresponding path program 1 times
[2024-06-20 19:08:51,827 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:08:51,827 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254436428]
[2024-06-20 19:08:51,827 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:08:51,827 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:08:51,893 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:09:01,189 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:09:01,189 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:09:01,190 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254436428]
[2024-06-20 19:09:01,190 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254436428] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:09:01,190 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:09:01,190 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-20 19:09:01,191 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7284897]
[2024-06-20 19:09:01,191 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:09:01,191 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-20 19:09:01,191 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:09:01,192 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-20 19:09:01,192 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-06-20 19:09:01,292 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 19:09:01,293 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 193 flow. Second operand  has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 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:09:01,293 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:09:01,293 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 19:09:01,293 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:09:02,226 INFO  L124   PetriNetUnfolderBase]: 1331/2196 cut-off events.
[2024-06-20 19:09:02,226 INFO  L125   PetriNetUnfolderBase]: For 3113/3113 co-relation queries the response was YES.
[2024-06-20 19:09:02,229 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6201 conditions, 2196 events. 1331/2196 cut-off events. For 3113/3113 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 11393 event pairs, 638 based on Foata normal form. 2/2188 useless extension candidates. Maximal degree in co-relation 6184. Up to 1979 conditions per place. 
[2024-06-20 19:09:02,235 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 43 selfloop transitions, 8 changer transitions 0/57 dead transitions.
[2024-06-20 19:09:02,235 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 57 transitions, 339 flow
[2024-06-20 19:09:02,236 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 19:09:02,236 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 19:09:02,236 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions.
[2024-06-20 19:09:02,236 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-20 19:09:02,237 INFO  L175             Difference]: Start difference. First operand has 51 places, 43 transitions, 193 flow. Second operand 5 states and 95 transitions.
[2024-06-20 19:09:02,237 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 57 transitions, 339 flow
[2024-06-20 19:09:02,238 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 57 transitions, 306 flow, removed 6 selfloop flow, removed 4 redundant places.
[2024-06-20 19:09:02,239 INFO  L231             Difference]: Finished difference. Result has 52 places, 46 transitions, 206 flow
[2024-06-20 19:09:02,239 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=206, PETRI_PLACES=52, PETRI_TRANSITIONS=46}
[2024-06-20 19:09:02,240 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places.
[2024-06-20 19:09:02,240 INFO  L495      AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 206 flow
[2024-06-20 19:09:02,240 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 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:09:02,240 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:09:02,240 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:09:02,241 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-20 19:09:02,241 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:09:02,241 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:09:02,241 INFO  L85        PathProgramCache]: Analyzing trace with hash 1670634987, now seen corresponding path program 1 times
[2024-06-20 19:09:02,241 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:09:02,241 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004271850]
[2024-06-20 19:09:02,242 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:09:02,242 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:09:02,284 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:09:12,786 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:09:12,786 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:09:12,787 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004271850]
[2024-06-20 19:09:12,787 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004271850] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:09:12,787 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:09:12,787 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:09:12,787 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516163146]
[2024-06-20 19:09:12,787 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:09:12,788 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:09:12,788 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:09:12,788 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:09:12,788 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:09:12,917 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 19:09:12,917 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 206 flow. Second operand  has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:09:12,917 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:09:12,917 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 19:09:12,917 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:09:14,126 INFO  L124   PetriNetUnfolderBase]: 1549/2420 cut-off events.
[2024-06-20 19:09:14,127 INFO  L125   PetriNetUnfolderBase]: For 5049/5049 co-relation queries the response was YES.
[2024-06-20 19:09:14,131 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7487 conditions, 2420 events. 1549/2420 cut-off events. For 5049/5049 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11857 event pairs, 737 based on Foata normal form. 2/2407 useless extension candidates. Maximal degree in co-relation 7468. Up to 2277 conditions per place. 
[2024-06-20 19:09:14,141 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 51 selfloop transitions, 11 changer transitions 0/67 dead transitions.
[2024-06-20 19:09:14,141 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 67 transitions, 396 flow
[2024-06-20 19:09:14,142 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:09:14,142 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:09:14,142 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions.
[2024-06-20 19:09:14,142 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4365079365079365
[2024-06-20 19:09:14,143 INFO  L175             Difference]: Start difference. First operand has 52 places, 46 transitions, 206 flow. Second operand 6 states and 110 transitions.
[2024-06-20 19:09:14,143 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 67 transitions, 396 flow
[2024-06-20 19:09:14,145 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 67 transitions, 374 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-06-20 19:09:14,145 INFO  L231             Difference]: Finished difference. Result has 55 places, 49 transitions, 240 flow
[2024-06-20 19:09:14,146 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=240, PETRI_PLACES=55, PETRI_TRANSITIONS=49}
[2024-06-20 19:09:14,146 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 12 predicate places.
[2024-06-20 19:09:14,146 INFO  L495      AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 240 flow
[2024-06-20 19:09:14,147 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:09:14,147 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:09:14,147 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:09:14,147 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-20 19:09:14,147 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:09:14,147 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:09:14,147 INFO  L85        PathProgramCache]: Analyzing trace with hash 1670784717, now seen corresponding path program 2 times
[2024-06-20 19:09:14,148 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:09:14,148 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652164486]
[2024-06-20 19:09:14,148 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:09:14,148 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:09:14,204 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:09:24,662 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:09:24,662 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:09:24,662 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652164486]
[2024-06-20 19:09:24,662 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652164486] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:09:24,662 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:09:24,663 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:09:24,663 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76963678]
[2024-06-20 19:09:24,663 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:09:24,663 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:09:24,663 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:09:24,664 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:09:24,664 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:09:24,874 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 19:09:24,875 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 240 flow. Second operand  has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:09:24,875 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:09:24,875 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 19:09:24,875 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:09:25,917 INFO  L124   PetriNetUnfolderBase]: 1544/2420 cut-off events.
[2024-06-20 19:09:25,917 INFO  L125   PetriNetUnfolderBase]: For 6844/6856 co-relation queries the response was YES.
[2024-06-20 19:09:25,922 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8030 conditions, 2420 events. 1544/2420 cut-off events. For 6844/6856 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11967 event pairs, 735 based on Foata normal form. 10/2417 useless extension candidates. Maximal degree in co-relation 8010. Up to 2252 conditions per place. 
[2024-06-20 19:09:25,933 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 46 selfloop transitions, 16 changer transitions 0/67 dead transitions.
[2024-06-20 19:09:25,933 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 67 transitions, 428 flow
[2024-06-20 19:09:25,933 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:09:25,934 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:09:25,934 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions.
[2024-06-20 19:09:25,934 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43253968253968256
[2024-06-20 19:09:25,934 INFO  L175             Difference]: Start difference. First operand has 55 places, 49 transitions, 240 flow. Second operand 6 states and 109 transitions.
[2024-06-20 19:09:25,935 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 67 transitions, 428 flow
[2024-06-20 19:09:25,937 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 67 transitions, 396 flow, removed 7 selfloop flow, removed 4 redundant places.
[2024-06-20 19:09:25,938 INFO  L231             Difference]: Finished difference. Result has 57 places, 52 transitions, 280 flow
[2024-06-20 19:09:25,938 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=280, PETRI_PLACES=57, PETRI_TRANSITIONS=52}
[2024-06-20 19:09:25,939 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places.
[2024-06-20 19:09:25,939 INFO  L495      AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 280 flow
[2024-06-20 19:09:25,939 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:09:25,939 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:09:25,939 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:09:25,940 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-20 19:09:25,940 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:09:25,940 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:09:25,940 INFO  L85        PathProgramCache]: Analyzing trace with hash 826318137, now seen corresponding path program 1 times
[2024-06-20 19:09:25,940 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:09:25,941 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830259145]
[2024-06-20 19:09:25,941 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:09:25,941 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:09:25,987 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:09:36,372 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:09:36,372 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:09:36,372 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830259145]
[2024-06-20 19:09:36,372 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830259145] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:09:36,372 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:09:36,372 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:09:36,373 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36988493]
[2024-06-20 19:09:36,373 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:09:36,373 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:09:36,373 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:09:36,373 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:09:36,373 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:09:36,617 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 19:09:36,617 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 280 flow. Second operand  has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 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:09:36,617 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:09:36,617 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 19:09:36,617 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:09:37,854 INFO  L124   PetriNetUnfolderBase]: 1629/2626 cut-off events.
[2024-06-20 19:09:37,854 INFO  L125   PetriNetUnfolderBase]: For 8992/8992 co-relation queries the response was YES.
[2024-06-20 19:09:37,859 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8987 conditions, 2626 events. 1629/2626 cut-off events. For 8992/8992 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 13328 event pairs, 757 based on Foata normal form. 2/2614 useless extension candidates. Maximal degree in co-relation 8966. Up to 2393 conditions per place. 
[2024-06-20 19:09:37,867 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 58 selfloop transitions, 14 changer transitions 0/77 dead transitions.
[2024-06-20 19:09:37,868 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 77 transitions, 511 flow
[2024-06-20 19:09:37,869 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:09:37,869 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:09:37,871 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions.
[2024-06-20 19:09:37,871 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41836734693877553
[2024-06-20 19:09:37,871 INFO  L175             Difference]: Start difference. First operand has 57 places, 52 transitions, 280 flow. Second operand 7 states and 123 transitions.
[2024-06-20 19:09:37,871 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 77 transitions, 511 flow
[2024-06-20 19:09:37,874 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 77 transitions, 460 flow, removed 10 selfloop flow, removed 4 redundant places.
[2024-06-20 19:09:37,876 INFO  L231             Difference]: Finished difference. Result has 61 places, 58 transitions, 316 flow
[2024-06-20 19:09:37,876 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=316, PETRI_PLACES=61, PETRI_TRANSITIONS=58}
[2024-06-20 19:09:37,878 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places.
[2024-06-20 19:09:37,879 INFO  L495      AbstractCegarLoop]: Abstraction has has 61 places, 58 transitions, 316 flow
[2024-06-20 19:09:37,879 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 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:09:37,879 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:09:37,879 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:09:37,879 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-20 19:09:37,879 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:09:37,879 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:09:37,880 INFO  L85        PathProgramCache]: Analyzing trace with hash 249957777, now seen corresponding path program 1 times
[2024-06-20 19:09:37,880 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:09:37,880 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5674614]
[2024-06-20 19:09:37,880 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:09:37,880 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:09:37,928 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:09:47,682 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:09:47,682 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:09:47,682 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5674614]
[2024-06-20 19:09:47,682 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5674614] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:09:47,682 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:09:47,683 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:09:47,683 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211165807]
[2024-06-20 19:09:47,683 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:09:47,683 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:09:47,683 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:09:47,684 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:09:47,684 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:09:47,808 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 19:09:47,808 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 58 transitions, 316 flow. Second operand  has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 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:09:47,808 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:09:47,808 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 19:09:47,808 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:09:49,184 INFO  L124   PetriNetUnfolderBase]: 1838/2849 cut-off events.
[2024-06-20 19:09:49,185 INFO  L125   PetriNetUnfolderBase]: For 13369/13369 co-relation queries the response was YES.
[2024-06-20 19:09:49,189 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10845 conditions, 2849 events. 1838/2849 cut-off events. For 13369/13369 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 14244 event pairs, 659 based on Foata normal form. 4/2833 useless extension candidates. Maximal degree in co-relation 10822. Up to 2652 conditions per place. 
[2024-06-20 19:09:49,196 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 74 selfloop transitions, 17 changer transitions 0/97 dead transitions.
[2024-06-20 19:09:49,196 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 97 transitions, 622 flow
[2024-06-20 19:09:49,197 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:09:49,197 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:09:49,197 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions.
[2024-06-20 19:09:49,197 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44345238095238093
[2024-06-20 19:09:49,198 INFO  L175             Difference]: Start difference. First operand has 61 places, 58 transitions, 316 flow. Second operand 8 states and 149 transitions.
[2024-06-20 19:09:49,198 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 97 transitions, 622 flow
[2024-06-20 19:09:49,201 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 97 transitions, 582 flow, removed 9 selfloop flow, removed 4 redundant places.
[2024-06-20 19:09:49,202 INFO  L231             Difference]: Finished difference. Result has 66 places, 64 transitions, 370 flow
[2024-06-20 19:09:49,202 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=370, PETRI_PLACES=66, PETRI_TRANSITIONS=64}
[2024-06-20 19:09:49,203 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places.
[2024-06-20 19:09:49,203 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 64 transitions, 370 flow
[2024-06-20 19:09:49,203 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 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:09:49,203 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:09:49,204 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:09:49,204 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-20 19:09:49,204 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:09:49,204 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:09:49,204 INFO  L85        PathProgramCache]: Analyzing trace with hash 531124043, now seen corresponding path program 2 times
[2024-06-20 19:09:49,204 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:09:49,206 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858458943]
[2024-06-20 19:09:49,207 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:09:49,207 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:09:49,245 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:09:59,083 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:09:59,083 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:09:59,084 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858458943]
[2024-06-20 19:09:59,084 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858458943] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:09:59,087 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:09:59,087 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:09:59,088 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949583801]
[2024-06-20 19:09:59,088 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:09:59,089 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:09:59,089 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:09:59,090 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:09:59,090 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:09:59,243 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 19:09:59,243 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 64 transitions, 370 flow. Second operand  has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 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:09:59,243 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:09:59,243 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 19:09:59,243 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:10:00,705 INFO  L124   PetriNetUnfolderBase]: 1951/3020 cut-off events.
[2024-06-20 19:10:00,706 INFO  L125   PetriNetUnfolderBase]: For 17969/17969 co-relation queries the response was YES.
[2024-06-20 19:10:00,711 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12583 conditions, 3020 events. 1951/3020 cut-off events. For 17969/17969 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 15057 event pairs, 594 based on Foata normal form. 8/3008 useless extension candidates. Maximal degree in co-relation 12558. Up to 2705 conditions per place. 
[2024-06-20 19:10:00,719 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 75 selfloop transitions, 25 changer transitions 0/106 dead transitions.
[2024-06-20 19:10:00,719 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 106 transitions, 780 flow
[2024-06-20 19:10:00,720 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:10:00,720 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:10:00,720 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions.
[2024-06-20 19:10:00,721 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45535714285714285
[2024-06-20 19:10:00,721 INFO  L175             Difference]: Start difference. First operand has 66 places, 64 transitions, 370 flow. Second operand 8 states and 153 transitions.
[2024-06-20 19:10:00,721 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 106 transitions, 780 flow
[2024-06-20 19:10:00,725 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 106 transitions, 728 flow, removed 12 selfloop flow, removed 5 redundant places.
[2024-06-20 19:10:00,726 INFO  L231             Difference]: Finished difference. Result has 70 places, 72 transitions, 478 flow
[2024-06-20 19:10:00,727 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=478, PETRI_PLACES=70, PETRI_TRANSITIONS=72}
[2024-06-20 19:10:00,727 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 27 predicate places.
[2024-06-20 19:10:00,727 INFO  L495      AbstractCegarLoop]: Abstraction has has 70 places, 72 transitions, 478 flow
[2024-06-20 19:10:00,727 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 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:10:00,727 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:10:00,727 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:10:00,728 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-20 19:10:00,728 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:10:00,728 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:10:00,728 INFO  L85        PathProgramCache]: Analyzing trace with hash 708255563, now seen corresponding path program 3 times
[2024-06-20 19:10:00,728 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:10:00,728 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178804607]
[2024-06-20 19:10:00,728 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:10:00,729 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:10:00,766 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:10:11,007 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:10:11,007 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:10:11,007 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178804607]
[2024-06-20 19:10:11,007 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178804607] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:10:11,008 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:10:11,008 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:10:11,008 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223887288]
[2024-06-20 19:10:11,008 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:10:11,008 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:10:11,008 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:10:11,008 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:10:11,008 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:10:11,182 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 19:10:11,183 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 72 transitions, 478 flow. Second operand  has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 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:10:11,183 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:10:11,183 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 19:10:11,183 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:10:12,513 INFO  L124   PetriNetUnfolderBase]: 1959/3018 cut-off events.
[2024-06-20 19:10:12,514 INFO  L125   PetriNetUnfolderBase]: For 23201/23230 co-relation queries the response was YES.
[2024-06-20 19:10:12,520 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13661 conditions, 3018 events. 1959/3018 cut-off events. For 23201/23230 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 15047 event pairs, 555 based on Foata normal form. 23/3018 useless extension candidates. Maximal degree in co-relation 13634. Up to 2576 conditions per place. 
[2024-06-20 19:10:12,529 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 70 selfloop transitions, 38 changer transitions 0/114 dead transitions.
[2024-06-20 19:10:12,529 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 114 transitions, 966 flow
[2024-06-20 19:10:12,530 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:10:12,530 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:10:12,531 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions.
[2024-06-20 19:10:12,531 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46726190476190477
[2024-06-20 19:10:12,531 INFO  L175             Difference]: Start difference. First operand has 70 places, 72 transitions, 478 flow. Second operand 8 states and 157 transitions.
[2024-06-20 19:10:12,531 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 114 transitions, 966 flow
[2024-06-20 19:10:12,538 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 114 transitions, 918 flow, removed 16 selfloop flow, removed 4 redundant places.
[2024-06-20 19:10:12,540 INFO  L231             Difference]: Finished difference. Result has 75 places, 80 transitions, 630 flow
[2024-06-20 19:10:12,540 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=630, PETRI_PLACES=75, PETRI_TRANSITIONS=80}
[2024-06-20 19:10:12,541 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 32 predicate places.
[2024-06-20 19:10:12,541 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 80 transitions, 630 flow
[2024-06-20 19:10:12,541 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 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:10:12,541 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:10:12,542 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:10:12,542 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-20 19:10:12,542 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:10:12,542 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:10:12,542 INFO  L85        PathProgramCache]: Analyzing trace with hash 708501827, now seen corresponding path program 1 times
[2024-06-20 19:10:12,542 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:10:12,542 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689783415]
[2024-06-20 19:10:12,542 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:10:12,543 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:10:12,586 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:10:24,274 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:10:24,274 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:10:24,274 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689783415]
[2024-06-20 19:10:24,274 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689783415] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:10:24,274 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:10:24,274 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:10:24,274 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67438357]
[2024-06-20 19:10:24,274 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:10:24,275 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:10:24,275 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:10:24,275 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:10:24,275 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:10:24,465 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 19:10:24,465 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 80 transitions, 630 flow. Second operand  has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 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:10:24,465 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:10:24,466 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 19:10:24,466 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:10:25,759 INFO  L124   PetriNetUnfolderBase]: 1825/2905 cut-off events.
[2024-06-20 19:10:25,760 INFO  L125   PetriNetUnfolderBase]: For 23468/23468 co-relation queries the response was YES.
[2024-06-20 19:10:25,766 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13418 conditions, 2905 events. 1825/2905 cut-off events. For 23468/23468 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 14588 event pairs, 569 based on Foata normal form. 4/2891 useless extension candidates. Maximal degree in co-relation 13388. Up to 2662 conditions per place. 
[2024-06-20 19:10:25,775 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 85 selfloop transitions, 16 changer transitions 0/106 dead transitions.
[2024-06-20 19:10:25,775 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 106 transitions, 924 flow
[2024-06-20 19:10:25,792 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:10:25,792 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:10:25,793 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions.
[2024-06-20 19:10:25,794 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41369047619047616
[2024-06-20 19:10:25,794 INFO  L175             Difference]: Start difference. First operand has 75 places, 80 transitions, 630 flow. Second operand 8 states and 139 transitions.
[2024-06-20 19:10:25,794 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 106 transitions, 924 flow
[2024-06-20 19:10:25,811 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 106 transitions, 818 flow, removed 28 selfloop flow, removed 5 redundant places.
[2024-06-20 19:10:25,813 INFO  L231             Difference]: Finished difference. Result has 78 places, 82 transitions, 599 flow
[2024-06-20 19:10:25,813 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=599, PETRI_PLACES=78, PETRI_TRANSITIONS=82}
[2024-06-20 19:10:25,814 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 35 predicate places.
[2024-06-20 19:10:25,814 INFO  L495      AbstractCegarLoop]: Abstraction has has 78 places, 82 transitions, 599 flow
[2024-06-20 19:10:25,815 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 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:10:25,815 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:10:25,815 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:10:25,815 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-20 19:10:25,815 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:10:25,815 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:10:25,815 INFO  L85        PathProgramCache]: Analyzing trace with hash 323932773, now seen corresponding path program 1 times
[2024-06-20 19:10:25,816 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:10:25,816 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477090875]
[2024-06-20 19:10:25,816 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:10:25,816 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:10:25,853 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:10:40,886 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:10:40,887 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:10:40,887 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477090875]
[2024-06-20 19:10:40,887 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477090875] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:10:40,887 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:10:40,887 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:10:40,887 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417424417]
[2024-06-20 19:10:40,888 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:10:40,888 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:10:40,888 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:10:40,889 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:10:40,889 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:10:41,014 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 19:10:41,014 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 82 transitions, 599 flow. Second operand  has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 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:10:41,014 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:10:41,014 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 19:10:41,014 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:10:42,142 INFO  L124   PetriNetUnfolderBase]: 1822/2901 cut-off events.
[2024-06-20 19:10:42,142 INFO  L125   PetriNetUnfolderBase]: For 23871/23871 co-relation queries the response was YES.
[2024-06-20 19:10:42,148 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13090 conditions, 2901 events. 1822/2901 cut-off events. For 23871/23871 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 14505 event pairs, 583 based on Foata normal form. 1/2884 useless extension candidates. Maximal degree in co-relation 13059. Up to 2700 conditions per place. 
[2024-06-20 19:10:42,156 INFO  L140   encePairwiseOnDemand]: 35/42 looper letters, 80 selfloop transitions, 8 changer transitions 0/93 dead transitions.
[2024-06-20 19:10:42,156 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 93 transitions, 817 flow
[2024-06-20 19:10:42,157 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 19:10:42,157 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 19:10:42,157 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions.
[2024-06-20 19:10:42,157 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4142857142857143
[2024-06-20 19:10:42,157 INFO  L175             Difference]: Start difference. First operand has 78 places, 82 transitions, 599 flow. Second operand 5 states and 87 transitions.
[2024-06-20 19:10:42,158 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 93 transitions, 817 flow
[2024-06-20 19:10:42,167 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 93 transitions, 762 flow, removed 13 selfloop flow, removed 6 redundant places.
[2024-06-20 19:10:42,169 INFO  L231             Difference]: Finished difference. Result has 77 places, 85 transitions, 594 flow
[2024-06-20 19:10:42,169 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=594, PETRI_PLACES=77, PETRI_TRANSITIONS=85}
[2024-06-20 19:10:42,170 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 34 predicate places.
[2024-06-20 19:10:42,170 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 85 transitions, 594 flow
[2024-06-20 19:10:42,170 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 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:10:42,170 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:10:42,170 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:10:42,170 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-20 19:10:42,171 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:10:42,171 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:10:42,171 INFO  L85        PathProgramCache]: Analyzing trace with hash -841332982, now seen corresponding path program 1 times
[2024-06-20 19:10:42,171 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:10:42,171 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493799876]
[2024-06-20 19:10:42,171 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:10:42,171 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:10:42,224 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:10:52,751 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:10:52,751 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:10:52,751 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493799876]
[2024-06-20 19:10:52,752 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493799876] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:10:52,752 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:10:52,752 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:10:52,752 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791049369]
[2024-06-20 19:10:52,752 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:10:52,752 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:10:52,752 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:10:52,753 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:10:52,753 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:10:53,010 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 19:10:53,010 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 85 transitions, 594 flow. Second operand  has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 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:10:53,010 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:10:53,010 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 19:10:53,010 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:10:54,448 INFO  L124   PetriNetUnfolderBase]: 1943/3006 cut-off events.
[2024-06-20 19:10:54,448 INFO  L125   PetriNetUnfolderBase]: For 31671/31691 co-relation queries the response was YES.
[2024-06-20 19:10:54,454 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14767 conditions, 3006 events. 1943/3006 cut-off events. For 31671/31691 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 14933 event pairs, 575 based on Foata normal form. 7/3010 useless extension candidates. Maximal degree in co-relation 14735. Up to 2800 conditions per place. 
[2024-06-20 19:10:54,462 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 89 selfloop transitions, 19 changer transitions 0/114 dead transitions.
[2024-06-20 19:10:54,463 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 114 transitions, 924 flow
[2024-06-20 19:10:54,463 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:10:54,463 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:10:54,463 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions.
[2024-06-20 19:10:54,464 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.445578231292517
[2024-06-20 19:10:54,464 INFO  L175             Difference]: Start difference. First operand has 77 places, 85 transitions, 594 flow. Second operand 7 states and 131 transitions.
[2024-06-20 19:10:54,464 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 114 transitions, 924 flow
[2024-06-20 19:10:54,473 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 114 transitions, 896 flow, removed 8 selfloop flow, removed 3 redundant places.
[2024-06-20 19:10:54,475 INFO  L231             Difference]: Finished difference. Result has 81 places, 88 transitions, 668 flow
[2024-06-20 19:10:54,475 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=668, PETRI_PLACES=81, PETRI_TRANSITIONS=88}
[2024-06-20 19:10:54,475 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 38 predicate places.
[2024-06-20 19:10:54,475 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 88 transitions, 668 flow
[2024-06-20 19:10:54,476 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 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:10:54,476 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:10:54,476 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:10:54,476 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-20 19:10:54,476 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:10:54,476 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:10:54,477 INFO  L85        PathProgramCache]: Analyzing trace with hash -837517750, now seen corresponding path program 1 times
[2024-06-20 19:10:54,477 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:10:54,477 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279875088]
[2024-06-20 19:10:54,477 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:10:54,477 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:10:54,525 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:11:06,158 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:11:06,159 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:11:06,160 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279875088]
[2024-06-20 19:11:06,160 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279875088] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:11:06,160 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:11:06,160 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:11:06,160 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445607718]
[2024-06-20 19:11:06,160 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:11:06,161 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:11:06,161 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:11:06,161 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:11:06,161 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:11:06,373 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-20 19:11:06,374 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 88 transitions, 668 flow. Second operand  has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 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:11:06,374 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:11:06,374 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-20 19:11:06,374 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:11:07,853 INFO  L124   PetriNetUnfolderBase]: 2053/3134 cut-off events.
[2024-06-20 19:11:07,853 INFO  L125   PetriNetUnfolderBase]: For 34528/34528 co-relation queries the response was YES.
[2024-06-20 19:11:07,860 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15338 conditions, 3134 events. 2053/3134 cut-off events. For 34528/34528 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 14918 event pairs, 635 based on Foata normal form. 2/3133 useless extension candidates. Maximal degree in co-relation 15305. Up to 2990 conditions per place. 
[2024-06-20 19:11:07,869 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 98 selfloop transitions, 17 changer transitions 0/119 dead transitions.
[2024-06-20 19:11:07,869 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 119 transitions, 1015 flow
[2024-06-20 19:11:07,870 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:11:07,870 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:11:07,870 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions.
[2024-06-20 19:11:07,871 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4017857142857143
[2024-06-20 19:11:07,871 INFO  L175             Difference]: Start difference. First operand has 81 places, 88 transitions, 668 flow. Second operand 8 states and 135 transitions.
[2024-06-20 19:11:07,871 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 119 transitions, 1015 flow
[2024-06-20 19:11:07,887 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 119 transitions, 957 flow, removed 14 selfloop flow, removed 5 redundant places.
[2024-06-20 19:11:07,888 INFO  L231             Difference]: Finished difference. Result has 85 places, 93 transitions, 713 flow
[2024-06-20 19:11:07,888 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=713, PETRI_PLACES=85, PETRI_TRANSITIONS=93}
[2024-06-20 19:11:07,889 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 42 predicate places.
[2024-06-20 19:11:07,889 INFO  L495      AbstractCegarLoop]: Abstraction has has 85 places, 93 transitions, 713 flow
[2024-06-20 19:11:07,889 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 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:11:07,889 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:11:07,889 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:11:07,889 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-20 19:11:07,890 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:11:07,890 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:11:07,890 INFO  L85        PathProgramCache]: Analyzing trace with hash 488444308, now seen corresponding path program 2 times
[2024-06-20 19:11:07,890 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:11:07,890 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226438302]
[2024-06-20 19:11:07,890 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:11:07,890 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:11:07,934 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:11:18,840 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:11:18,843 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:11:18,843 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226438302]
[2024-06-20 19:11:18,845 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226438302] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:11:18,845 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:11:18,845 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:11:18,846 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194855537]
[2024-06-20 19:11:18,846 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:11:18,846 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:11:18,847 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:11:18,847 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:11:18,847 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:11:19,052 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-20 19:11:19,052 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 93 transitions, 713 flow. Second operand  has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 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:11:19,052 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:11:19,052 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-20 19:11:19,053 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:11:20,486 INFO  L124   PetriNetUnfolderBase]: 2119/3232 cut-off events.
[2024-06-20 19:11:20,487 INFO  L125   PetriNetUnfolderBase]: For 39198/39207 co-relation queries the response was YES.
[2024-06-20 19:11:20,494 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16149 conditions, 3232 events. 2119/3232 cut-off events. For 39198/39207 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 15443 event pairs, 589 based on Foata normal form. 12/3239 useless extension candidates. Maximal degree in co-relation 16114. Up to 2819 conditions per place. 
[2024-06-20 19:11:20,502 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 94 selfloop transitions, 54 changer transitions 0/152 dead transitions.
[2024-06-20 19:11:20,503 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 152 transitions, 1284 flow
[2024-06-20 19:11:20,503 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:11:20,503 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:11:20,504 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions.
[2024-06-20 19:11:20,504 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-20 19:11:20,504 INFO  L175             Difference]: Start difference. First operand has 85 places, 93 transitions, 713 flow. Second operand 9 states and 162 transitions.
[2024-06-20 19:11:20,504 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 152 transitions, 1284 flow
[2024-06-20 19:11:20,515 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 152 transitions, 1226 flow, removed 15 selfloop flow, removed 5 redundant places.
[2024-06-20 19:11:20,517 INFO  L231             Difference]: Finished difference. Result has 90 places, 116 transitions, 976 flow
[2024-06-20 19:11:20,517 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=976, PETRI_PLACES=90, PETRI_TRANSITIONS=116}
[2024-06-20 19:11:20,518 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 47 predicate places.
[2024-06-20 19:11:20,518 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 116 transitions, 976 flow
[2024-06-20 19:11:20,518 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 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:11:20,518 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:11:20,518 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:11:20,518 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-20 19:11:20,519 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:11:20,519 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:11:20,519 INFO  L85        PathProgramCache]: Analyzing trace with hash -477199592, now seen corresponding path program 3 times
[2024-06-20 19:11:20,519 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:11:20,519 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8384386]
[2024-06-20 19:11:20,519 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:11:20,519 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:11:20,561 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:11:31,757 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:11:31,757 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:11:31,757 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8384386]
[2024-06-20 19:11:31,757 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8384386] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:11:31,758 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:11:31,758 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:11:31,758 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847972637]
[2024-06-20 19:11:31,758 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:11:31,758 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:11:31,758 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:11:31,759 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:11:31,759 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:11:31,982 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-20 19:11:31,982 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 116 transitions, 976 flow. Second operand  has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 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:11:31,983 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:11:31,983 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-20 19:11:31,983 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:11:33,546 INFO  L124   PetriNetUnfolderBase]: 2146/3270 cut-off events.
[2024-06-20 19:11:33,546 INFO  L125   PetriNetUnfolderBase]: For 44055/44064 co-relation queries the response was YES.
[2024-06-20 19:11:33,553 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17190 conditions, 3270 events. 2146/3270 cut-off events. For 44055/44064 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 15687 event pairs, 585 based on Foata normal form. 8/3273 useless extension candidates. Maximal degree in co-relation 17153. Up to 2785 conditions per place. 
[2024-06-20 19:11:33,562 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 93 selfloop transitions, 62 changer transitions 0/159 dead transitions.
[2024-06-20 19:11:33,562 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 159 transitions, 1552 flow
[2024-06-20 19:11:33,563 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:11:33,563 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:11:33,566 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions.
[2024-06-20 19:11:33,566 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-20 19:11:33,566 INFO  L175             Difference]: Start difference. First operand has 90 places, 116 transitions, 976 flow. Second operand 9 states and 162 transitions.
[2024-06-20 19:11:33,566 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 159 transitions, 1552 flow
[2024-06-20 19:11:33,587 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 159 transitions, 1504 flow, removed 17 selfloop flow, removed 3 redundant places.
[2024-06-20 19:11:33,590 INFO  L231             Difference]: Finished difference. Result has 98 places, 123 transitions, 1212 flow
[2024-06-20 19:11:33,590 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=928, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1212, PETRI_PLACES=98, PETRI_TRANSITIONS=123}
[2024-06-20 19:11:33,596 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 55 predicate places.
[2024-06-20 19:11:33,596 INFO  L495      AbstractCegarLoop]: Abstraction has has 98 places, 123 transitions, 1212 flow
[2024-06-20 19:11:33,596 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 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:11:33,597 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:11:33,597 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:11:33,597 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-20 19:11:33,597 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:11:33,598 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:11:33,598 INFO  L85        PathProgramCache]: Analyzing trace with hash 481092658, now seen corresponding path program 4 times
[2024-06-20 19:11:33,598 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:11:33,598 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71044131]
[2024-06-20 19:11:33,598 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:11:33,598 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:11:33,665 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:11:44,604 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:11:44,605 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:11:44,605 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71044131]
[2024-06-20 19:11:44,605 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71044131] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:11:44,605 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:11:44,605 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:11:44,605 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356738792]
[2024-06-20 19:11:44,606 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:11:44,606 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:11:44,607 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:11:44,607 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:11:44,608 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:11:44,731 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-20 19:11:44,732 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 123 transitions, 1212 flow. Second operand  has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 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:11:44,732 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:11:44,732 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-20 19:11:44,732 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:11:46,242 INFO  L124   PetriNetUnfolderBase]: 2125/3240 cut-off events.
[2024-06-20 19:11:46,242 INFO  L125   PetriNetUnfolderBase]: For 47555/47564 co-relation queries the response was YES.
[2024-06-20 19:11:46,250 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17410 conditions, 3240 events. 2125/3240 cut-off events. For 47555/47564 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 15459 event pairs, 599 based on Foata normal form. 12/3247 useless extension candidates. Maximal degree in co-relation 17369. Up to 2827 conditions per place. 
[2024-06-20 19:11:46,258 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 102 selfloop transitions, 53 changer transitions 0/159 dead transitions.
[2024-06-20 19:11:46,259 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 159 transitions, 1634 flow
[2024-06-20 19:11:46,259 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:11:46,259 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:11:46,279 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions.
[2024-06-20 19:11:46,280 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4312169312169312
[2024-06-20 19:11:46,280 INFO  L175             Difference]: Start difference. First operand has 98 places, 123 transitions, 1212 flow. Second operand 9 states and 163 transitions.
[2024-06-20 19:11:46,280 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 159 transitions, 1634 flow
[2024-06-20 19:11:46,309 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 159 transitions, 1515 flow, removed 31 selfloop flow, removed 4 redundant places.
[2024-06-20 19:11:46,314 INFO  L231             Difference]: Finished difference. Result has 104 places, 124 transitions, 1234 flow
[2024-06-20 19:11:46,314 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1093, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1234, PETRI_PLACES=104, PETRI_TRANSITIONS=124}
[2024-06-20 19:11:46,315 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 61 predicate places.
[2024-06-20 19:11:46,315 INFO  L495      AbstractCegarLoop]: Abstraction has has 104 places, 124 transitions, 1234 flow
[2024-06-20 19:11:46,316 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 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:11:46,316 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:11:46,316 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:11:46,316 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-20 19:11:46,316 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:11:46,316 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:11:46,316 INFO  L85        PathProgramCache]: Analyzing trace with hash 1451982775, now seen corresponding path program 1 times
[2024-06-20 19:11:46,316 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:11:46,317 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044487177]
[2024-06-20 19:11:46,317 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:11:46,317 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:11:46,354 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:12:02,625 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:12:02,625 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:12:02,626 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044487177]
[2024-06-20 19:12:02,626 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044487177] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:12:02,626 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:12:02,626 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:12:02,626 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853518328]
[2024-06-20 19:12:02,626 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:12:02,626 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:12:02,627 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:12:02,627 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:12:02,627 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:12:02,797 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-20 19:12:02,798 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 124 transitions, 1234 flow. Second operand  has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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:12:02,798 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:12:02,798 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-20 19:12:02,798 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:12:04,122 INFO  L124   PetriNetUnfolderBase]: 2122/3251 cut-off events.
[2024-06-20 19:12:04,122 INFO  L125   PetriNetUnfolderBase]: For 51244/51244 co-relation queries the response was YES.
[2024-06-20 19:12:04,132 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17641 conditions, 3251 events. 2122/3251 cut-off events. For 51244/51244 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 15620 event pairs, 618 based on Foata normal form. 1/3249 useless extension candidates. Maximal degree in co-relation 17598. Up to 3126 conditions per place. 
[2024-06-20 19:12:04,144 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 121 selfloop transitions, 11 changer transitions 0/136 dead transitions.
[2024-06-20 19:12:04,144 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 136 transitions, 1546 flow
[2024-06-20 19:12:04,144 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:12:04,145 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:12:04,146 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions.
[2024-06-20 19:12:04,146 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.376984126984127
[2024-06-20 19:12:04,146 INFO  L175             Difference]: Start difference. First operand has 104 places, 124 transitions, 1234 flow. Second operand 6 states and 95 transitions.
[2024-06-20 19:12:04,146 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 136 transitions, 1546 flow
[2024-06-20 19:12:04,181 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 136 transitions, 1454 flow, removed 8 selfloop flow, removed 5 redundant places.
[2024-06-20 19:12:04,183 INFO  L231             Difference]: Finished difference. Result has 105 places, 127 transitions, 1202 flow
[2024-06-20 19:12:04,184 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1142, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1202, PETRI_PLACES=105, PETRI_TRANSITIONS=127}
[2024-06-20 19:12:04,184 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 62 predicate places.
[2024-06-20 19:12:04,184 INFO  L495      AbstractCegarLoop]: Abstraction has has 105 places, 127 transitions, 1202 flow
[2024-06-20 19:12:04,184 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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:12:04,184 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:12:04,184 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:12:04,185 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-20 19:12:04,185 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:12:04,185 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:12:04,185 INFO  L85        PathProgramCache]: Analyzing trace with hash -809027544, now seen corresponding path program 1 times
[2024-06-20 19:12:04,185 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:12:04,185 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499426597]
[2024-06-20 19:12:04,186 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:12:04,186 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:12:04,247 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:12:15,790 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:12:15,790 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:12:15,791 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499426597]
[2024-06-20 19:12:15,791 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499426597] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:12:15,791 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:12:15,791 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:12:15,791 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494784603]
[2024-06-20 19:12:15,791 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:12:15,791 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:12:15,792 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:12:15,792 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:12:15,792 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:12:16,036 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 19:12:16,037 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 127 transitions, 1202 flow. Second operand  has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:12:16,037 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:12:16,037 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 19:12:16,037 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:12:17,629 INFO  L124   PetriNetUnfolderBase]: 2078/3208 cut-off events.
[2024-06-20 19:12:17,630 INFO  L125   PetriNetUnfolderBase]: For 65692/65702 co-relation queries the response was YES.
[2024-06-20 19:12:17,638 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18766 conditions, 3208 events. 2078/3208 cut-off events. For 65692/65702 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 15989 event pairs, 431 based on Foata normal form. 4/3195 useless extension candidates. Maximal degree in co-relation 18722. Up to 2938 conditions per place. 
[2024-06-20 19:12:17,649 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 132 selfloop transitions, 17 changer transitions 0/160 dead transitions.
[2024-06-20 19:12:17,650 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 160 transitions, 1618 flow
[2024-06-20 19:12:17,652 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:12:17,652 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:12:17,668 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions.
[2024-06-20 19:12:17,668 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43452380952380953
[2024-06-20 19:12:17,668 INFO  L175             Difference]: Start difference. First operand has 105 places, 127 transitions, 1202 flow. Second operand 8 states and 146 transitions.
[2024-06-20 19:12:17,668 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 160 transitions, 1618 flow
[2024-06-20 19:12:17,698 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 160 transitions, 1580 flow, removed 10 selfloop flow, removed 4 redundant places.
[2024-06-20 19:12:17,700 INFO  L231             Difference]: Finished difference. Result has 109 places, 129 transitions, 1249 flow
[2024-06-20 19:12:17,700 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1164, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1249, PETRI_PLACES=109, PETRI_TRANSITIONS=129}
[2024-06-20 19:12:17,701 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 66 predicate places.
[2024-06-20 19:12:17,701 INFO  L495      AbstractCegarLoop]: Abstraction has has 109 places, 129 transitions, 1249 flow
[2024-06-20 19:12:17,701 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:12:17,701 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:12:17,701 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:12:17,701 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-20 19:12:17,702 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:12:17,702 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:12:17,702 INFO  L85        PathProgramCache]: Analyzing trace with hash -808967094, now seen corresponding path program 2 times
[2024-06-20 19:12:17,702 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:12:17,703 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573594635]
[2024-06-20 19:12:17,703 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:12:17,703 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:12:17,760 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:12:28,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:12:28,823 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:12:28,823 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573594635]
[2024-06-20 19:12:28,823 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573594635] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:12:28,823 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:12:28,824 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:12:28,824 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247721753]
[2024-06-20 19:12:28,824 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:12:28,825 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:12:28,825 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:12:28,825 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:12:28,825 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:12:29,080 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 19:12:29,081 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 129 transitions, 1249 flow. Second operand  has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:12:29,081 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:12:29,081 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 19:12:29,081 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:12:30,741 INFO  L124   PetriNetUnfolderBase]: 2107/3257 cut-off events.
[2024-06-20 19:12:30,741 INFO  L125   PetriNetUnfolderBase]: For 74122/74127 co-relation queries the response was YES.
[2024-06-20 19:12:30,751 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19592 conditions, 3257 events. 2107/3257 cut-off events. For 74122/74127 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 16327 event pairs, 536 based on Foata normal form. 8/3255 useless extension candidates. Maximal degree in co-relation 19547. Up to 2962 conditions per place. 
[2024-06-20 19:12:30,762 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 126 selfloop transitions, 25 changer transitions 0/162 dead transitions.
[2024-06-20 19:12:30,762 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 162 transitions, 1675 flow
[2024-06-20 19:12:30,764 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:12:30,764 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:12:30,765 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions.
[2024-06-20 19:12:30,765 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4375
[2024-06-20 19:12:30,765 INFO  L175             Difference]: Start difference. First operand has 109 places, 129 transitions, 1249 flow. Second operand 8 states and 147 transitions.
[2024-06-20 19:12:30,765 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 162 transitions, 1675 flow
[2024-06-20 19:12:30,795 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 162 transitions, 1608 flow, removed 18 selfloop flow, removed 6 redundant places.
[2024-06-20 19:12:30,796 INFO  L231             Difference]: Finished difference. Result has 111 places, 131 transitions, 1290 flow
[2024-06-20 19:12:30,797 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1182, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1290, PETRI_PLACES=111, PETRI_TRANSITIONS=131}
[2024-06-20 19:12:30,797 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 68 predicate places.
[2024-06-20 19:12:30,797 INFO  L495      AbstractCegarLoop]: Abstraction has has 111 places, 131 transitions, 1290 flow
[2024-06-20 19:12:30,797 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:12:30,797 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:12:30,798 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:12:30,798 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-20 19:12:30,798 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:12:30,798 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:12:30,798 INFO  L85        PathProgramCache]: Analyzing trace with hash -806165624, now seen corresponding path program 1 times
[2024-06-20 19:12:30,798 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:12:30,798 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544688596]
[2024-06-20 19:12:30,798 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:12:30,799 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:12:30,842 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:12:42,811 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:12:42,812 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:12:42,812 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544688596]
[2024-06-20 19:12:42,812 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544688596] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:12:42,812 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:12:42,812 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:12:42,812 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422656909]
[2024-06-20 19:12:42,812 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:12:42,814 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:12:42,814 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:12:42,815 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:12:42,815 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:12:42,988 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-20 19:12:42,989 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 131 transitions, 1290 flow. Second operand  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 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:12:42,989 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:12:42,989 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-20 19:12:42,989 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:12:44,748 INFO  L124   PetriNetUnfolderBase]: 2284/3464 cut-off events.
[2024-06-20 19:12:44,748 INFO  L125   PetriNetUnfolderBase]: For 80671/80671 co-relation queries the response was YES.
[2024-06-20 19:12:44,757 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20633 conditions, 3464 events. 2284/3464 cut-off events. For 80671/80671 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 16716 event pairs, 603 based on Foata normal form. 4/3465 useless extension candidates. Maximal degree in co-relation 20587. Up to 3236 conditions per place. 
[2024-06-20 19:12:44,766 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 150 selfloop transitions, 23 changer transitions 0/178 dead transitions.
[2024-06-20 19:12:44,766 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 178 transitions, 1817 flow
[2024-06-20 19:12:44,768 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:12:44,768 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:12:44,769 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions.
[2024-06-20 19:12:44,769 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4142857142857143
[2024-06-20 19:12:44,769 INFO  L175             Difference]: Start difference. First operand has 111 places, 131 transitions, 1290 flow. Second operand 10 states and 174 transitions.
[2024-06-20 19:12:44,769 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 178 transitions, 1817 flow
[2024-06-20 19:12:44,805 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 178 transitions, 1733 flow, removed 20 selfloop flow, removed 6 redundant places.
[2024-06-20 19:12:44,807 INFO  L231             Difference]: Finished difference. Result has 116 places, 135 transitions, 1339 flow
[2024-06-20 19:12:44,807 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1206, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1339, PETRI_PLACES=116, PETRI_TRANSITIONS=135}
[2024-06-20 19:12:44,807 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 73 predicate places.
[2024-06-20 19:12:44,807 INFO  L495      AbstractCegarLoop]: Abstraction has has 116 places, 135 transitions, 1339 flow
[2024-06-20 19:12:44,808 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 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:12:44,808 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:12:44,808 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:12:44,808 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-20 19:12:44,808 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:12:44,808 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:12:44,808 INFO  L85        PathProgramCache]: Analyzing trace with hash -193430222, now seen corresponding path program 3 times
[2024-06-20 19:12:44,808 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:12:44,809 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684625006]
[2024-06-20 19:12:44,809 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:12:44,809 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:12:44,860 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:12:56,680 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:12:56,680 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:12:56,680 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684625006]
[2024-06-20 19:12:56,680 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684625006] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:12:56,680 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:12:56,680 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:12:56,680 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334682386]
[2024-06-20 19:12:56,680 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:12:56,680 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:12:56,681 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:12:56,681 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:12:56,681 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:12:56,885 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 19:12:56,885 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 135 transitions, 1339 flow. Second operand  has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:12:56,885 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:12:56,885 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 19:12:56,885 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:12:58,720 INFO  L124   PetriNetUnfolderBase]: 2233/3463 cut-off events.
[2024-06-20 19:12:58,720 INFO  L125   PetriNetUnfolderBase]: For 95631/95641 co-relation queries the response was YES.
[2024-06-20 19:12:58,732 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21331 conditions, 3463 events. 2233/3463 cut-off events. For 95631/95641 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 17682 event pairs, 548 based on Foata normal form. 28/3474 useless extension candidates. Maximal degree in co-relation 21283. Up to 2931 conditions per place. 
[2024-06-20 19:12:58,745 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 120 selfloop transitions, 47 changer transitions 0/179 dead transitions.
[2024-06-20 19:12:58,745 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 179 transitions, 1923 flow
[2024-06-20 19:12:58,747 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:12:58,747 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:12:58,748 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions.
[2024-06-20 19:12:58,748 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4576719576719577
[2024-06-20 19:12:58,748 INFO  L175             Difference]: Start difference. First operand has 116 places, 135 transitions, 1339 flow. Second operand 9 states and 173 transitions.
[2024-06-20 19:12:58,748 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 179 transitions, 1923 flow
[2024-06-20 19:12:58,798 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 179 transitions, 1845 flow, removed 19 selfloop flow, removed 7 redundant places.
[2024-06-20 19:12:58,800 INFO  L231             Difference]: Finished difference. Result has 118 places, 137 transitions, 1417 flow
[2024-06-20 19:12:58,800 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1261, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1417, PETRI_PLACES=118, PETRI_TRANSITIONS=137}
[2024-06-20 19:12:58,801 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 75 predicate places.
[2024-06-20 19:12:58,801 INFO  L495      AbstractCegarLoop]: Abstraction has has 118 places, 137 transitions, 1417 flow
[2024-06-20 19:12:58,801 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:12:58,801 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:12:58,801 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:12:58,802 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-20 19:12:58,802 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:12:58,802 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:12:58,802 INFO  L85        PathProgramCache]: Analyzing trace with hash -193425262, now seen corresponding path program 2 times
[2024-06-20 19:12:58,802 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:12:58,802 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993471759]
[2024-06-20 19:12:58,802 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:12:58,802 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:12:58,846 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:13:10,737 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:13:10,738 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:13:10,738 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993471759]
[2024-06-20 19:13:10,738 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993471759] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:13:10,738 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:13:10,738 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:13:10,738 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279455453]
[2024-06-20 19:13:10,738 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:13:10,739 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:13:10,739 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:13:10,740 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:13:10,740 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:13:10,874 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-20 19:13:10,874 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 137 transitions, 1417 flow. Second operand  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 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:13:10,874 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:13:10,874 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-20 19:13:10,874 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:13:12,689 INFO  L124   PetriNetUnfolderBase]: 2437/3707 cut-off events.
[2024-06-20 19:13:12,689 INFO  L125   PetriNetUnfolderBase]: For 97783/97783 co-relation queries the response was YES.
[2024-06-20 19:13:12,700 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22707 conditions, 3707 events. 2437/3707 cut-off events. For 97783/97783 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 18187 event pairs, 616 based on Foata normal form. 4/3708 useless extension candidates. Maximal degree in co-relation 22658. Up to 3384 conditions per place. 
[2024-06-20 19:13:12,712 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 139 selfloop transitions, 40 changer transitions 0/184 dead transitions.
[2024-06-20 19:13:12,712 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 184 transitions, 1987 flow
[2024-06-20 19:13:12,714 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:13:12,714 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:13:12,715 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions.
[2024-06-20 19:13:12,715 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41904761904761906
[2024-06-20 19:13:12,715 INFO  L175             Difference]: Start difference. First operand has 118 places, 137 transitions, 1417 flow. Second operand 10 states and 176 transitions.
[2024-06-20 19:13:12,715 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 184 transitions, 1987 flow
[2024-06-20 19:13:12,772 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 184 transitions, 1854 flow, removed 17 selfloop flow, removed 7 redundant places.
[2024-06-20 19:13:12,774 INFO  L231             Difference]: Finished difference. Result has 121 places, 143 transitions, 1480 flow
[2024-06-20 19:13:12,774 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1295, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1480, PETRI_PLACES=121, PETRI_TRANSITIONS=143}
[2024-06-20 19:13:12,775 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 78 predicate places.
[2024-06-20 19:13:12,775 INFO  L495      AbstractCegarLoop]: Abstraction has has 121 places, 143 transitions, 1480 flow
[2024-06-20 19:13:12,775 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 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:13:12,775 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:13:12,775 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:13:12,775 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-20 19:13:12,776 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:13:12,776 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:13:12,776 INFO  L85        PathProgramCache]: Analyzing trace with hash -193252282, now seen corresponding path program 3 times
[2024-06-20 19:13:12,776 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:13:12,776 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586772692]
[2024-06-20 19:13:12,776 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:13:12,776 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:13:12,820 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:13:24,758 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:13:24,758 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:13:24,758 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586772692]
[2024-06-20 19:13:24,758 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586772692] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:13:24,758 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:13:24,759 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:13:24,759 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268176174]
[2024-06-20 19:13:24,759 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:13:24,759 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:13:24,759 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:13:24,760 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:13:24,760 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:13:24,946 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-20 19:13:24,946 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 143 transitions, 1480 flow. Second operand  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 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:13:24,946 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:13:24,946 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-20 19:13:24,946 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:13:26,728 INFO  L124   PetriNetUnfolderBase]: 2422/3686 cut-off events.
[2024-06-20 19:13:26,729 INFO  L125   PetriNetUnfolderBase]: For 100751/100751 co-relation queries the response was YES.
[2024-06-20 19:13:26,740 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22344 conditions, 3686 events. 2422/3686 cut-off events. For 100751/100751 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 18064 event pairs, 608 based on Foata normal form. 6/3689 useless extension candidates. Maximal degree in co-relation 22294. Up to 3299 conditions per place. 
[2024-06-20 19:13:26,753 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 125 selfloop transitions, 54 changer transitions 0/184 dead transitions.
[2024-06-20 19:13:26,753 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 184 transitions, 1948 flow
[2024-06-20 19:13:26,755 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:13:26,755 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:13:26,756 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions.
[2024-06-20 19:13:26,757 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41904761904761906
[2024-06-20 19:13:26,757 INFO  L175             Difference]: Start difference. First operand has 121 places, 143 transitions, 1480 flow. Second operand 10 states and 176 transitions.
[2024-06-20 19:13:26,757 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 184 transitions, 1948 flow
[2024-06-20 19:13:26,845 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 184 transitions, 1739 flow, removed 46 selfloop flow, removed 11 redundant places.
[2024-06-20 19:13:26,847 INFO  L231             Difference]: Finished difference. Result has 120 places, 143 transitions, 1403 flow
[2024-06-20 19:13:26,847 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1271, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1403, PETRI_PLACES=120, PETRI_TRANSITIONS=143}
[2024-06-20 19:13:26,848 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 77 predicate places.
[2024-06-20 19:13:26,848 INFO  L495      AbstractCegarLoop]: Abstraction has has 120 places, 143 transitions, 1403 flow
[2024-06-20 19:13:26,848 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 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:13:26,848 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:13:26,848 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:13:26,848 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-20 19:13:26,849 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:13:26,849 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:13:26,849 INFO  L85        PathProgramCache]: Analyzing trace with hash -690694716, now seen corresponding path program 1 times
[2024-06-20 19:13:26,849 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:13:26,849 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797042886]
[2024-06-20 19:13:26,849 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:13:26,849 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:13:26,903 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:13:38,838 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:13:38,838 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:13:38,838 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797042886]
[2024-06-20 19:13:38,838 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797042886] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:13:38,838 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:13:38,838 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:13:38,839 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669329774]
[2024-06-20 19:13:38,839 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:13:38,840 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:13:38,841 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:13:38,842 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:13:38,842 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:13:39,070 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-20 19:13:39,070 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 143 transitions, 1403 flow. Second operand  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 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:13:39,070 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:13:39,071 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-20 19:13:39,071 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:13:40,711 INFO  L124   PetriNetUnfolderBase]: 2439/3713 cut-off events.
[2024-06-20 19:13:40,711 INFO  L125   PetriNetUnfolderBase]: For 106454/106454 co-relation queries the response was YES.
[2024-06-20 19:13:40,723 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22633 conditions, 3713 events. 2439/3713 cut-off events. For 106454/106454 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 18257 event pairs, 629 based on Foata normal form. 4/3714 useless extension candidates. Maximal degree in co-relation 22586. Up to 3534 conditions per place. 
[2024-06-20 19:13:40,736 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 152 selfloop transitions, 19 changer transitions 0/176 dead transitions.
[2024-06-20 19:13:40,736 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 176 transitions, 1865 flow
[2024-06-20 19:13:40,738 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:13:40,738 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:13:40,738 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions.
[2024-06-20 19:13:40,739 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3968253968253968
[2024-06-20 19:13:40,739 INFO  L175             Difference]: Start difference. First operand has 120 places, 143 transitions, 1403 flow. Second operand 9 states and 150 transitions.
[2024-06-20 19:13:40,739 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 176 transitions, 1865 flow
[2024-06-20 19:13:40,804 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 176 transitions, 1680 flow, removed 11 selfloop flow, removed 9 redundant places.
[2024-06-20 19:13:40,806 INFO  L231             Difference]: Finished difference. Result has 120 places, 145 transitions, 1309 flow
[2024-06-20 19:13:40,806 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1218, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1309, PETRI_PLACES=120, PETRI_TRANSITIONS=145}
[2024-06-20 19:13:40,807 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 77 predicate places.
[2024-06-20 19:13:40,807 INFO  L495      AbstractCegarLoop]: Abstraction has has 120 places, 145 transitions, 1309 flow
[2024-06-20 19:13:40,807 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 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:13:40,807 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:13:40,807 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:13:40,808 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-20 19:13:40,808 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:13:40,808 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:13:40,808 INFO  L85        PathProgramCache]: Analyzing trace with hash 2061394662, now seen corresponding path program 1 times
[2024-06-20 19:13:40,808 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:13:40,808 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969956269]
[2024-06-20 19:13:40,808 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:13:40,809 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:13:40,843 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:13:57,273 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:13:57,273 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:13:57,273 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969956269]
[2024-06-20 19:13:57,273 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969956269] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:13:57,273 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:13:57,273 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:13:57,273 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023382407]
[2024-06-20 19:13:57,273 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:13:57,273 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:13:57,274 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:13:57,274 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:13:57,274 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:13:57,392 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-20 19:13:57,393 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 145 transitions, 1309 flow. Second operand  has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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:13:57,393 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:13:57,393 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-20 19:13:57,393 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:13:58,922 INFO  L124   PetriNetUnfolderBase]: 2479/3755 cut-off events.
[2024-06-20 19:13:58,922 INFO  L125   PetriNetUnfolderBase]: For 91814/91814 co-relation queries the response was YES.
[2024-06-20 19:13:58,934 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22223 conditions, 3755 events. 2479/3755 cut-off events. For 91814/91814 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 18328 event pairs, 633 based on Foata normal form. 1/3753 useless extension candidates. Maximal degree in co-relation 22175. Up to 3611 conditions per place. 
[2024-06-20 19:13:58,946 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 146 selfloop transitions, 16 changer transitions 0/167 dead transitions.
[2024-06-20 19:13:58,946 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 167 transitions, 1783 flow
[2024-06-20 19:13:58,946 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:13:58,946 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:13:58,947 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions.
[2024-06-20 19:13:58,947 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4126984126984127
[2024-06-20 19:13:58,947 INFO  L175             Difference]: Start difference. First operand has 120 places, 145 transitions, 1309 flow. Second operand 6 states and 104 transitions.
[2024-06-20 19:13:58,947 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 167 transitions, 1783 flow
[2024-06-20 19:13:58,990 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 167 transitions, 1706 flow, removed 21 selfloop flow, removed 7 redundant places.
[2024-06-20 19:13:58,992 INFO  L231             Difference]: Finished difference. Result has 119 places, 151 transitions, 1340 flow
[2024-06-20 19:13:58,992 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1232, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1340, PETRI_PLACES=119, PETRI_TRANSITIONS=151}
[2024-06-20 19:13:58,993 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 76 predicate places.
[2024-06-20 19:13:58,993 INFO  L495      AbstractCegarLoop]: Abstraction has has 119 places, 151 transitions, 1340 flow
[2024-06-20 19:13:58,993 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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:13:58,993 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:13:58,993 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:13:58,993 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-20 19:13:58,994 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:13:58,994 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:13:58,994 INFO  L85        PathProgramCache]: Analyzing trace with hash 2028786762, now seen corresponding path program 4 times
[2024-06-20 19:13:58,994 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:13:58,994 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079572037]
[2024-06-20 19:13:58,994 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:13:58,994 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:13:59,043 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:14:10,543 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:14:10,544 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:14:10,544 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079572037]
[2024-06-20 19:14:10,544 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079572037] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:14:10,546 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:14:10,546 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:14:10,546 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556479251]
[2024-06-20 19:14:10,546 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:14:10,546 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:14:10,547 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:14:10,547 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:14:10,547 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:14:10,787 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 19:14:10,787 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 151 transitions, 1340 flow. Second operand  has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:14:10,787 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:14:10,787 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 19:14:10,787 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:14:12,564 INFO  L124   PetriNetUnfolderBase]: 2378/3678 cut-off events.
[2024-06-20 19:14:12,565 INFO  L125   PetriNetUnfolderBase]: For 108157/108198 co-relation queries the response was YES.
[2024-06-20 19:14:12,576 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22709 conditions, 3678 events. 2378/3678 cut-off events. For 108157/108198 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 18812 event pairs, 562 based on Foata normal form. 60/3726 useless extension candidates. Maximal degree in co-relation 22660. Up to 2938 conditions per place. 
[2024-06-20 19:14:12,586 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 99 selfloop transitions, 80 changer transitions 0/191 dead transitions.
[2024-06-20 19:14:12,586 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 191 transitions, 1862 flow
[2024-06-20 19:14:12,588 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:14:12,588 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:14:12,589 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions.
[2024-06-20 19:14:12,589 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4576719576719577
[2024-06-20 19:14:12,589 INFO  L175             Difference]: Start difference. First operand has 119 places, 151 transitions, 1340 flow. Second operand 9 states and 173 transitions.
[2024-06-20 19:14:12,589 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 191 transitions, 1862 flow
[2024-06-20 19:14:12,631 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 191 transitions, 1824 flow, removed 15 selfloop flow, removed 2 redundant places.
[2024-06-20 19:14:12,633 INFO  L231             Difference]: Finished difference. Result has 126 places, 153 transitions, 1531 flow
[2024-06-20 19:14:12,633 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1302, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1531, PETRI_PLACES=126, PETRI_TRANSITIONS=153}
[2024-06-20 19:14:12,634 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 83 predicate places.
[2024-06-20 19:14:12,634 INFO  L495      AbstractCegarLoop]: Abstraction has has 126 places, 153 transitions, 1531 flow
[2024-06-20 19:14:12,634 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:14:12,634 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:14:12,634 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:14:12,634 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-20 19:14:12,635 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:14:12,635 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:14:12,635 INFO  L85        PathProgramCache]: Analyzing trace with hash 2028971460, now seen corresponding path program 2 times
[2024-06-20 19:14:12,635 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:14:12,635 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377601304]
[2024-06-20 19:14:12,635 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:14:12,635 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:14:12,677 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:14:23,603 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:14:23,604 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:14:23,604 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377601304]
[2024-06-20 19:14:23,604 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377601304] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:14:23,604 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:14:23,604 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:14:23,604 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600412931]
[2024-06-20 19:14:23,604 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:14:23,605 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:14:23,605 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:14:23,605 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:14:23,605 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:14:23,861 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-20 19:14:23,861 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 153 transitions, 1531 flow. Second operand  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 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:14:23,861 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:14:23,862 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-20 19:14:23,862 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:14:25,548 INFO  L124   PetriNetUnfolderBase]: 2630/4010 cut-off events.
[2024-06-20 19:14:25,548 INFO  L125   PetriNetUnfolderBase]: For 118051/118063 co-relation queries the response was YES.
[2024-06-20 19:14:25,561 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24702 conditions, 4010 events. 2630/4010 cut-off events. For 118051/118063 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 20085 event pairs, 630 based on Foata normal form. 32/4037 useless extension candidates. Maximal degree in co-relation 24651. Up to 3429 conditions per place. 
[2024-06-20 19:14:25,575 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 136 selfloop transitions, 58 changer transitions 0/199 dead transitions.
[2024-06-20 19:14:25,575 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 199 transitions, 2102 flow
[2024-06-20 19:14:25,577 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:14:25,577 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:14:25,578 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions.
[2024-06-20 19:14:25,578 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43333333333333335
[2024-06-20 19:14:25,578 INFO  L175             Difference]: Start difference. First operand has 126 places, 153 transitions, 1531 flow. Second operand 10 states and 182 transitions.
[2024-06-20 19:14:25,578 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 199 transitions, 2102 flow
[2024-06-20 19:14:25,654 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 199 transitions, 1907 flow, removed 20 selfloop flow, removed 7 redundant places.
[2024-06-20 19:14:25,656 INFO  L231             Difference]: Finished difference. Result has 129 places, 155 transitions, 1516 flow
[2024-06-20 19:14:25,656 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1338, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1516, PETRI_PLACES=129, PETRI_TRANSITIONS=155}
[2024-06-20 19:14:25,657 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 86 predicate places.
[2024-06-20 19:14:25,657 INFO  L495      AbstractCegarLoop]: Abstraction has has 129 places, 155 transitions, 1516 flow
[2024-06-20 19:14:25,658 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 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:14:25,658 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:14:25,658 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:14:25,658 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-20 19:14:25,658 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:14:25,658 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:14:25,659 INFO  L85        PathProgramCache]: Analyzing trace with hash -2029820476, now seen corresponding path program 3 times
[2024-06-20 19:14:25,659 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:14:25,659 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048896398]
[2024-06-20 19:14:25,659 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:14:25,659 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:14:25,712 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:14:37,652 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:14:37,652 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:14:37,652 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048896398]
[2024-06-20 19:14:37,652 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048896398] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:14:37,652 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:14:37,653 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:14:37,653 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646697464]
[2024-06-20 19:14:37,653 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:14:37,653 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:14:37,653 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:14:37,653 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:14:37,653 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:14:37,949 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-20 19:14:37,950 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 155 transitions, 1516 flow. Second operand  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 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:14:37,950 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:14:37,951 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-20 19:14:37,951 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:14:39,724 INFO  L124   PetriNetUnfolderBase]: 2647/4037 cut-off events.
[2024-06-20 19:14:39,724 INFO  L125   PetriNetUnfolderBase]: For 117977/117989 co-relation queries the response was YES.
[2024-06-20 19:14:39,737 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24892 conditions, 4037 events. 2647/4037 cut-off events. For 117977/117989 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 20250 event pairs, 625 based on Foata normal form. 12/4044 useless extension candidates. Maximal degree in co-relation 24840. Up to 3439 conditions per place. 
[2024-06-20 19:14:39,758 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 105 selfloop transitions, 86 changer transitions 0/196 dead transitions.
[2024-06-20 19:14:39,759 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 196 transitions, 2059 flow
[2024-06-20 19:14:39,761 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:14:39,761 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:14:39,761 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions.
[2024-06-20 19:14:39,761 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41904761904761906
[2024-06-20 19:14:39,761 INFO  L175             Difference]: Start difference. First operand has 129 places, 155 transitions, 1516 flow. Second operand 10 states and 176 transitions.
[2024-06-20 19:14:39,762 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 196 transitions, 2059 flow
[2024-06-20 19:14:39,837 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 196 transitions, 1909 flow, removed 19 selfloop flow, removed 8 redundant places.
[2024-06-20 19:14:39,839 INFO  L231             Difference]: Finished difference. Result has 131 places, 157 transitions, 1603 flow
[2024-06-20 19:14:39,839 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1366, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1603, PETRI_PLACES=131, PETRI_TRANSITIONS=157}
[2024-06-20 19:14:39,840 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 88 predicate places.
[2024-06-20 19:14:39,840 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 157 transitions, 1603 flow
[2024-06-20 19:14:39,840 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 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:14:39,840 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:14:39,840 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:14:39,841 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-20 19:14:39,841 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:14:39,841 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:14:39,841 INFO  L85        PathProgramCache]: Analyzing trace with hash -2029523806, now seen corresponding path program 4 times
[2024-06-20 19:14:39,841 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:14:39,841 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109257095]
[2024-06-20 19:14:39,841 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:14:39,841 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:14:39,884 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:14:51,977 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:14:51,977 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:14:51,978 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109257095]
[2024-06-20 19:14:51,978 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109257095] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:14:51,978 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:14:51,978 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:14:51,978 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067782654]
[2024-06-20 19:14:51,978 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:14:51,979 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:14:51,982 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:14:51,983 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:14:51,983 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:14:52,190 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-20 19:14:52,190 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 157 transitions, 1603 flow. Second operand  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 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:14:52,190 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:14:52,190 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-20 19:14:52,198 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:14:54,202 INFO  L124   PetriNetUnfolderBase]: 2781/4251 cut-off events.
[2024-06-20 19:14:54,203 INFO  L125   PetriNetUnfolderBase]: For 133920/133932 co-relation queries the response was YES.
[2024-06-20 19:14:54,217 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26901 conditions, 4251 events. 2781/4251 cut-off events. For 133920/133932 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 21684 event pairs, 570 based on Foata normal form. 12/4258 useless extension candidates. Maximal degree in co-relation 26848. Up to 3211 conditions per place. 
[2024-06-20 19:14:54,231 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 107 selfloop transitions, 95 changer transitions 0/207 dead transitions.
[2024-06-20 19:14:54,231 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 207 transitions, 2358 flow
[2024-06-20 19:14:54,234 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:14:54,234 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:14:54,234 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions.
[2024-06-20 19:14:54,234 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4357142857142857
[2024-06-20 19:14:54,234 INFO  L175             Difference]: Start difference. First operand has 131 places, 157 transitions, 1603 flow. Second operand 10 states and 183 transitions.
[2024-06-20 19:14:54,234 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 207 transitions, 2358 flow
[2024-06-20 19:14:54,323 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 207 transitions, 2139 flow, removed 25 selfloop flow, removed 8 redundant places.
[2024-06-20 19:14:54,326 INFO  L231             Difference]: Finished difference. Result has 133 places, 161 transitions, 1701 flow
[2024-06-20 19:14:54,326 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1384, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1701, PETRI_PLACES=133, PETRI_TRANSITIONS=161}
[2024-06-20 19:14:54,326 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 90 predicate places.
[2024-06-20 19:14:54,326 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 161 transitions, 1701 flow
[2024-06-20 19:14:54,326 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 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:14:54,327 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:14:54,327 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:14:54,327 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-20 19:14:54,327 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:14:54,327 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:14:54,327 INFO  L85        PathProgramCache]: Analyzing trace with hash -2038094686, now seen corresponding path program 5 times
[2024-06-20 19:14:54,327 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:14:54,327 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170482818]
[2024-06-20 19:14:54,328 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:14:54,328 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:14:54,369 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:15:05,446 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:15:05,447 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:15:05,447 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170482818]
[2024-06-20 19:15:05,447 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170482818] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:15:05,447 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:15:05,447 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:15:05,447 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167289633]
[2024-06-20 19:15:05,447 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:15:05,448 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:15:05,448 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:15:05,449 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:15:05,449 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:15:05,653 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-20 19:15:05,654 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 161 transitions, 1701 flow. Second operand  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 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:15:05,654 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:15:05,654 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-20 19:15:05,654 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:15:07,696 INFO  L124   PetriNetUnfolderBase]: 2842/4358 cut-off events.
[2024-06-20 19:15:07,697 INFO  L125   PetriNetUnfolderBase]: For 152210/152222 co-relation queries the response was YES.
[2024-06-20 19:15:07,711 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27811 conditions, 4358 events. 2842/4358 cut-off events. For 152210/152222 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 22492 event pairs, 680 based on Foata normal form. 32/4385 useless extension candidates. Maximal degree in co-relation 27757. Up to 3777 conditions per place. 
[2024-06-20 19:15:07,725 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 140 selfloop transitions, 62 changer transitions 0/207 dead transitions.
[2024-06-20 19:15:07,725 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 207 transitions, 2283 flow
[2024-06-20 19:15:07,727 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:15:07,728 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:15:07,728 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions.
[2024-06-20 19:15:07,728 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.430952380952381
[2024-06-20 19:15:07,728 INFO  L175             Difference]: Start difference. First operand has 133 places, 161 transitions, 1701 flow. Second operand 10 states and 181 transitions.
[2024-06-20 19:15:07,728 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 207 transitions, 2283 flow
[2024-06-20 19:15:07,833 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 207 transitions, 2060 flow, removed 32 selfloop flow, removed 8 redundant places.
[2024-06-20 19:15:07,835 INFO  L231             Difference]: Finished difference. Result has 135 places, 162 transitions, 1654 flow
[2024-06-20 19:15:07,836 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1480, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1654, PETRI_PLACES=135, PETRI_TRANSITIONS=162}
[2024-06-20 19:15:07,836 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 92 predicate places.
[2024-06-20 19:15:07,836 INFO  L495      AbstractCegarLoop]: Abstraction has has 135 places, 162 transitions, 1654 flow
[2024-06-20 19:15:07,836 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 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:15:07,836 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:15:07,837 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:15:07,837 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-20 19:15:07,837 INFO  L420      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:15:07,837 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:15:07,837 INFO  L85        PathProgramCache]: Analyzing trace with hash -1762190974, now seen corresponding path program 2 times
[2024-06-20 19:15:07,837 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:15:07,837 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249026446]
[2024-06-20 19:15:07,838 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:15:07,838 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:15:07,871 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:15:23,634 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:15:23,634 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:15:23,634 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249026446]
[2024-06-20 19:15:23,634 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249026446] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:15:23,634 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:15:23,634 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:15:23,635 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577215716]
[2024-06-20 19:15:23,635 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:15:23,635 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:15:23,635 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:15:23,635 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:15:23,635 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:15:23,758 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-20 19:15:23,758 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 162 transitions, 1654 flow. Second operand  has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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:15:23,758 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:15:23,758 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-20 19:15:23,758 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:15:25,458 INFO  L124   PetriNetUnfolderBase]: 2839/4354 cut-off events.
[2024-06-20 19:15:25,458 INFO  L125   PetriNetUnfolderBase]: For 149597/149609 co-relation queries the response was YES.
[2024-06-20 19:15:25,474 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27664 conditions, 4354 events. 2839/4354 cut-off events. For 149597/149609 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 22505 event pairs, 740 based on Foata normal form. 9/4358 useless extension candidates. Maximal degree in co-relation 27610. Up to 4209 conditions per place. 
[2024-06-20 19:15:25,490 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 150 selfloop transitions, 16 changer transitions 0/171 dead transitions.
[2024-06-20 19:15:25,490 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 171 transitions, 2008 flow
[2024-06-20 19:15:25,491 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:15:25,491 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:15:25,491 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions.
[2024-06-20 19:15:25,491 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38492063492063494
[2024-06-20 19:15:25,491 INFO  L175             Difference]: Start difference. First operand has 135 places, 162 transitions, 1654 flow. Second operand 6 states and 97 transitions.
[2024-06-20 19:15:25,491 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 171 transitions, 2008 flow
[2024-06-20 19:15:25,601 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 171 transitions, 1830 flow, removed 29 selfloop flow, removed 8 redundant places.
[2024-06-20 19:15:25,603 INFO  L231             Difference]: Finished difference. Result has 133 places, 162 transitions, 1514 flow
[2024-06-20 19:15:25,603 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1476, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1514, PETRI_PLACES=133, PETRI_TRANSITIONS=162}
[2024-06-20 19:15:25,604 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 90 predicate places.
[2024-06-20 19:15:25,604 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 162 transitions, 1514 flow
[2024-06-20 19:15:25,604 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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:15:25,604 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:15:25,604 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:15:25,604 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-20 19:15:25,604 INFO  L420      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:15:25,605 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:15:25,605 INFO  L85        PathProgramCache]: Analyzing trace with hash 2056072644, now seen corresponding path program 1 times
[2024-06-20 19:15:25,605 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:15:25,605 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623575859]
[2024-06-20 19:15:25,605 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:15:25,605 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:15:25,649 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:15:38,824 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:15:38,825 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:15:38,825 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623575859]
[2024-06-20 19:15:38,825 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623575859] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:15:38,825 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:15:38,825 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:15:38,825 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024838834]
[2024-06-20 19:15:38,825 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:15:38,826 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:15:38,826 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:15:38,826 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:15:38,826 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:15:38,906 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 19:15:38,906 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 162 transitions, 1514 flow. Second operand  has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 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:15:38,906 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:15:38,906 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 19:15:38,906 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:15:40,482 INFO  L124   PetriNetUnfolderBase]: 2592/4081 cut-off events.
[2024-06-20 19:15:40,482 INFO  L125   PetriNetUnfolderBase]: For 132955/132955 co-relation queries the response was YES.
[2024-06-20 19:15:40,497 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24857 conditions, 4081 events. 2592/4081 cut-off events. For 132955/132955 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 21746 event pairs, 649 based on Foata normal form. 1/4079 useless extension candidates. Maximal degree in co-relation 24802. Up to 3861 conditions per place. 
[2024-06-20 19:15:40,511 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 159 selfloop transitions, 16 changer transitions 0/181 dead transitions.
[2024-06-20 19:15:40,512 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 181 transitions, 2004 flow
[2024-06-20 19:15:40,512 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:15:40,512 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:15:40,512 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions.
[2024-06-20 19:15:40,513 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42063492063492064
[2024-06-20 19:15:40,513 INFO  L175             Difference]: Start difference. First operand has 133 places, 162 transitions, 1514 flow. Second operand 6 states and 106 transitions.
[2024-06-20 19:15:40,513 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 181 transitions, 2004 flow
[2024-06-20 19:15:40,592 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 181 transitions, 1964 flow, removed 2 selfloop flow, removed 5 redundant places.
[2024-06-20 19:15:40,595 INFO  L231             Difference]: Finished difference. Result has 134 places, 168 transitions, 1566 flow
[2024-06-20 19:15:40,595 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1474, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1566, PETRI_PLACES=134, PETRI_TRANSITIONS=168}
[2024-06-20 19:15:40,595 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 91 predicate places.
[2024-06-20 19:15:40,595 INFO  L495      AbstractCegarLoop]: Abstraction has has 134 places, 168 transitions, 1566 flow
[2024-06-20 19:15:40,595 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 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:15:40,595 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:15:40,596 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:15:40,596 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-20 19:15:40,596 INFO  L420      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:15:40,596 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:15:40,596 INFO  L85        PathProgramCache]: Analyzing trace with hash -1746097882, now seen corresponding path program 2 times
[2024-06-20 19:15:40,596 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:15:40,597 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496206769]
[2024-06-20 19:15:40,597 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:15:40,597 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:15:40,639 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:15:53,727 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:15:53,728 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:15:53,728 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496206769]
[2024-06-20 19:15:53,728 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496206769] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:15:53,728 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:15:53,728 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:15:53,728 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443011455]
[2024-06-20 19:15:53,728 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:15:53,729 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:15:53,729 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:15:53,729 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:15:53,729 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:15:53,835 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 19:15:53,836 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 168 transitions, 1566 flow. Second operand  has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 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:15:53,836 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:15:53,836 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 19:15:53,836 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:15:55,382 INFO  L124   PetriNetUnfolderBase]: 2589/4077 cut-off events.
[2024-06-20 19:15:55,382 INFO  L125   PetriNetUnfolderBase]: For 140331/140331 co-relation queries the response was YES.
[2024-06-20 19:15:55,397 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25371 conditions, 4077 events. 2589/4077 cut-off events. For 140331/140331 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 21730 event pairs, 648 based on Foata normal form. 1/4075 useless extension candidates. Maximal degree in co-relation 25315. Up to 3870 conditions per place. 
[2024-06-20 19:15:55,410 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 160 selfloop transitions, 11 changer transitions 0/177 dead transitions.
[2024-06-20 19:15:55,410 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 177 transitions, 1930 flow
[2024-06-20 19:15:55,411 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:15:55,411 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:15:55,411 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions.
[2024-06-20 19:15:55,412 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3968253968253968
[2024-06-20 19:15:55,412 INFO  L175             Difference]: Start difference. First operand has 134 places, 168 transitions, 1566 flow. Second operand 6 states and 100 transitions.
[2024-06-20 19:15:55,412 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 177 transitions, 1930 flow
[2024-06-20 19:15:55,490 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 177 transitions, 1890 flow, removed 16 selfloop flow, removed 2 redundant places.
[2024-06-20 19:15:55,492 INFO  L231             Difference]: Finished difference. Result has 138 places, 168 transitions, 1554 flow
[2024-06-20 19:15:55,492 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1526, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1554, PETRI_PLACES=138, PETRI_TRANSITIONS=168}
[2024-06-20 19:15:55,493 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 95 predicate places.
[2024-06-20 19:15:55,493 INFO  L495      AbstractCegarLoop]: Abstraction has has 138 places, 168 transitions, 1554 flow
[2024-06-20 19:15:55,493 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 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:15:55,493 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:15:55,493 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:15:55,493 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-20 19:15:55,493 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:15:55,494 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:15:55,494 INFO  L85        PathProgramCache]: Analyzing trace with hash 2061794500, now seen corresponding path program 1 times
[2024-06-20 19:15:55,494 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:15:55,494 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377620785]
[2024-06-20 19:15:55,494 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:15:55,494 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:15:55,526 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:16:12,388 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:16:12,389 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:16:12,389 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377620785]
[2024-06-20 19:16:12,389 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377620785] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:16:12,389 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:16:12,389 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:16:12,389 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413731932]
[2024-06-20 19:16:12,389 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:16:12,390 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:16:12,390 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:16:12,390 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:16:12,391 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:16:12,558 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-20 19:16:12,558 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 168 transitions, 1554 flow. Second operand  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:16:12,558 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:16:12,558 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-20 19:16:12,558 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:16:14,207 INFO  L124   PetriNetUnfolderBase]: 2728/4214 cut-off events.
[2024-06-20 19:16:14,208 INFO  L125   PetriNetUnfolderBase]: For 146331/146331 co-relation queries the response was YES.
[2024-06-20 19:16:14,223 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26231 conditions, 4214 events. 2728/4214 cut-off events. For 146331/146331 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 21857 event pairs, 687 based on Foata normal form. 2/4213 useless extension candidates. Maximal degree in co-relation 26173. Up to 4108 conditions per place. 
[2024-06-20 19:16:14,237 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 164 selfloop transitions, 14 changer transitions 0/182 dead transitions.
[2024-06-20 19:16:14,237 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 182 transitions, 1970 flow
[2024-06-20 19:16:14,237 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:16:14,237 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:16:14,240 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 108 transitions.
[2024-06-20 19:16:14,240 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3673469387755102
[2024-06-20 19:16:14,240 INFO  L175             Difference]: Start difference. First operand has 138 places, 168 transitions, 1554 flow. Second operand 7 states and 108 transitions.
[2024-06-20 19:16:14,240 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 182 transitions, 1970 flow
[2024-06-20 19:16:14,326 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 182 transitions, 1940 flow, removed 2 selfloop flow, removed 5 redundant places.
[2024-06-20 19:16:14,330 INFO  L231             Difference]: Finished difference. Result has 140 places, 171 transitions, 1598 flow
[2024-06-20 19:16:14,330 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1524, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1598, PETRI_PLACES=140, PETRI_TRANSITIONS=171}
[2024-06-20 19:16:14,331 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 97 predicate places.
[2024-06-20 19:16:14,331 INFO  L495      AbstractCegarLoop]: Abstraction has has 140 places, 171 transitions, 1598 flow
[2024-06-20 19:16:14,331 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:16:14,331 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:16:14,331 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:16:14,331 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-20 19:16:14,332 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:16:14,332 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:16:14,332 INFO  L85        PathProgramCache]: Analyzing trace with hash 778670382, now seen corresponding path program 1 times
[2024-06-20 19:16:14,332 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:16:14,332 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458615631]
[2024-06-20 19:16:14,332 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:16:14,333 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:16:14,385 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:16:26,925 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:16:26,925 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:16:26,925 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458615631]
[2024-06-20 19:16:26,925 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458615631] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:16:26,926 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:16:26,926 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:16:26,926 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320199262]
[2024-06-20 19:16:26,926 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:16:26,926 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:16:26,926 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:16:26,926 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:16:26,926 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:16:27,133 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-20 19:16:27,133 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 171 transitions, 1598 flow. Second operand  has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:16:27,133 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:16:27,133 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-20 19:16:27,133 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:16:29,274 INFO  L124   PetriNetUnfolderBase]: 2927/4498 cut-off events.
[2024-06-20 19:16:29,274 INFO  L125   PetriNetUnfolderBase]: For 187159/187159 co-relation queries the response was YES.
[2024-06-20 19:16:29,290 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29388 conditions, 4498 events. 2927/4498 cut-off events. For 187159/187159 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 23506 event pairs, 726 based on Foata normal form. 20/4515 useless extension candidates. Maximal degree in co-relation 29329. Up to 4132 conditions per place. 
[2024-06-20 19:16:29,306 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 195 selfloop transitions, 26 changer transitions 0/226 dead transitions.
[2024-06-20 19:16:29,306 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 226 transitions, 2236 flow
[2024-06-20 19:16:29,308 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-20 19:16:29,308 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-20 19:16:29,309 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions.
[2024-06-20 19:16:29,309 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41774891774891776
[2024-06-20 19:16:29,309 INFO  L175             Difference]: Start difference. First operand has 140 places, 171 transitions, 1598 flow. Second operand 11 states and 193 transitions.
[2024-06-20 19:16:29,309 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 226 transitions, 2236 flow
[2024-06-20 19:16:29,428 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 226 transitions, 2184 flow, removed 14 selfloop flow, removed 5 redundant places.
[2024-06-20 19:16:29,430 INFO  L231             Difference]: Finished difference. Result has 146 places, 174 transitions, 1664 flow
[2024-06-20 19:16:29,430 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1546, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1664, PETRI_PLACES=146, PETRI_TRANSITIONS=174}
[2024-06-20 19:16:29,431 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 103 predicate places.
[2024-06-20 19:16:29,431 INFO  L495      AbstractCegarLoop]: Abstraction has has 146 places, 174 transitions, 1664 flow
[2024-06-20 19:16:29,431 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:16:29,431 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:16:29,431 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:16:29,431 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-20 19:16:29,431 INFO  L420      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:16:29,432 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:16:29,432 INFO  L85        PathProgramCache]: Analyzing trace with hash -863871006, now seen corresponding path program 1 times
[2024-06-20 19:16:29,432 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:16:29,432 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819942007]
[2024-06-20 19:16:29,432 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:16:29,432 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:16:29,465 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:16:46,888 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:16:46,889 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:16:46,889 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819942007]
[2024-06-20 19:16:46,889 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819942007] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:16:46,889 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:16:46,889 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:16:46,889 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887489290]
[2024-06-20 19:16:46,889 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:16:46,889 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:16:46,889 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:16:46,889 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:16:46,890 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:16:47,016 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-20 19:16:47,017 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 174 transitions, 1664 flow. Second operand  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:16:47,017 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:16:47,017 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-20 19:16:47,017 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:16:49,097 INFO  L124   PetriNetUnfolderBase]: 2937/4512 cut-off events.
[2024-06-20 19:16:49,097 INFO  L125   PetriNetUnfolderBase]: For 188136/188136 co-relation queries the response was YES.
[2024-06-20 19:16:49,114 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29864 conditions, 4512 events. 2937/4512 cut-off events. For 188136/188136 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 23557 event pairs, 748 based on Foata normal form. 2/4511 useless extension candidates. Maximal degree in co-relation 29804. Up to 4320 conditions per place. 
[2024-06-20 19:16:49,128 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 174 selfloop transitions, 26 changer transitions 0/205 dead transitions.
[2024-06-20 19:16:49,129 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 205 transitions, 2266 flow
[2024-06-20 19:16:49,129 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:16:49,129 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:16:49,130 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions.
[2024-06-20 19:16:49,130 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42517006802721086
[2024-06-20 19:16:49,130 INFO  L175             Difference]: Start difference. First operand has 146 places, 174 transitions, 1664 flow. Second operand 7 states and 125 transitions.
[2024-06-20 19:16:49,130 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 205 transitions, 2266 flow
[2024-06-20 19:16:49,251 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 205 transitions, 2192 flow, removed 14 selfloop flow, removed 9 redundant places.
[2024-06-20 19:16:49,254 INFO  L231             Difference]: Finished difference. Result has 144 places, 180 transitions, 1723 flow
[2024-06-20 19:16:49,254 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1590, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1723, PETRI_PLACES=144, PETRI_TRANSITIONS=180}
[2024-06-20 19:16:49,254 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 101 predicate places.
[2024-06-20 19:16:49,254 INFO  L495      AbstractCegarLoop]: Abstraction has has 144 places, 180 transitions, 1723 flow
[2024-06-20 19:16:49,255 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:16:49,255 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:16:49,255 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:16:49,255 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-20 19:16:49,255 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:16:49,255 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:16:49,255 INFO  L85        PathProgramCache]: Analyzing trace with hash 57729356, now seen corresponding path program 2 times
[2024-06-20 19:16:49,255 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:16:49,256 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683444734]
[2024-06-20 19:16:49,256 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:16:49,256 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:16:49,297 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:17:01,185 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:17:01,185 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:17:01,185 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683444734]
[2024-06-20 19:17:01,185 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683444734] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:17:01,185 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:17:01,185 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:17:01,185 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077243741]
[2024-06-20 19:17:01,185 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:17:01,185 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:17:01,185 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:17:01,186 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:17:01,186 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:17:01,523 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-20 19:17:01,524 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 180 transitions, 1723 flow. Second operand  has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:17:01,524 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:17:01,524 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-20 19:17:01,524 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:17:03,750 INFO  L124   PetriNetUnfolderBase]: 3029/4664 cut-off events.
[2024-06-20 19:17:03,750 INFO  L125   PetriNetUnfolderBase]: For 208629/208629 co-relation queries the response was YES.
[2024-06-20 19:17:03,767 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31060 conditions, 4664 events. 3029/4664 cut-off events. For 208629/208629 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 24682 event pairs, 727 based on Foata normal form. 20/4681 useless extension candidates. Maximal degree in co-relation 30999. Up to 4121 conditions per place. 
[2024-06-20 19:17:03,784 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 173 selfloop transitions, 55 changer transitions 0/233 dead transitions.
[2024-06-20 19:17:03,784 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 233 transitions, 2385 flow
[2024-06-20 19:17:03,786 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-20 19:17:03,786 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-20 19:17:03,787 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 197 transitions.
[2024-06-20 19:17:03,787 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4264069264069264
[2024-06-20 19:17:03,787 INFO  L175             Difference]: Start difference. First operand has 144 places, 180 transitions, 1723 flow. Second operand 11 states and 197 transitions.
[2024-06-20 19:17:03,787 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 233 transitions, 2385 flow
[2024-06-20 19:17:03,889 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 233 transitions, 2333 flow, removed 17 selfloop flow, removed 3 redundant places.
[2024-06-20 19:17:03,892 INFO  L231             Difference]: Finished difference. Result has 152 places, 183 transitions, 1859 flow
[2024-06-20 19:17:03,892 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1671, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1859, PETRI_PLACES=152, PETRI_TRANSITIONS=183}
[2024-06-20 19:17:03,893 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 109 predicate places.
[2024-06-20 19:17:03,893 INFO  L495      AbstractCegarLoop]: Abstraction has has 152 places, 183 transitions, 1859 flow
[2024-06-20 19:17:03,893 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:17:03,893 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:17:03,893 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:17:03,893 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-20 19:17:03,893 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:17:03,894 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:17:03,894 INFO  L85        PathProgramCache]: Analyzing trace with hash -309447072, now seen corresponding path program 3 times
[2024-06-20 19:17:03,894 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:17:03,894 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402601395]
[2024-06-20 19:17:03,894 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:17:03,894 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:17:03,935 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:17:16,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:17:16,358 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:17:16,358 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402601395]
[2024-06-20 19:17:16,358 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402601395] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:17:16,358 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:17:16,358 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:17:16,358 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313526442]
[2024-06-20 19:17:16,358 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:17:16,358 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:17:16,358 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:17:16,359 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:17:16,359 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:17:16,533 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-20 19:17:16,533 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 183 transitions, 1859 flow. Second operand  has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:17:16,533 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:17:16,534 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-20 19:17:16,534 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:17:18,896 INFO  L124   PetriNetUnfolderBase]: 3096/4777 cut-off events.
[2024-06-20 19:17:18,897 INFO  L125   PetriNetUnfolderBase]: For 222010/222010 co-relation queries the response was YES.
[2024-06-20 19:17:18,915 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32196 conditions, 4777 events. 3096/4777 cut-off events. For 222010/222010 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 25502 event pairs, 725 based on Foata normal form. 20/4794 useless extension candidates. Maximal degree in co-relation 32133. Up to 4114 conditions per place. 
[2024-06-20 19:17:18,930 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 175 selfloop transitions, 56 changer transitions 0/236 dead transitions.
[2024-06-20 19:17:18,930 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 236 transitions, 2533 flow
[2024-06-20 19:17:18,932 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-20 19:17:18,932 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-20 19:17:18,932 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 196 transitions.
[2024-06-20 19:17:18,933 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42424242424242425
[2024-06-20 19:17:18,933 INFO  L175             Difference]: Start difference. First operand has 152 places, 183 transitions, 1859 flow. Second operand 11 states and 196 transitions.
[2024-06-20 19:17:18,933 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 236 transitions, 2533 flow
[2024-06-20 19:17:19,084 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 236 transitions, 2415 flow, removed 18 selfloop flow, removed 9 redundant places.
[2024-06-20 19:17:19,087 INFO  L231             Difference]: Finished difference. Result has 154 places, 186 transitions, 1939 flow
[2024-06-20 19:17:19,087 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1741, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1939, PETRI_PLACES=154, PETRI_TRANSITIONS=186}
[2024-06-20 19:17:19,099 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 111 predicate places.
[2024-06-20 19:17:19,100 INFO  L495      AbstractCegarLoop]: Abstraction has has 154 places, 186 transitions, 1939 flow
[2024-06-20 19:17:19,100 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:17:19,100 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:17:19,100 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:17:19,100 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-20 19:17:19,100 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:17:19,101 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:17:19,101 INFO  L85        PathProgramCache]: Analyzing trace with hash -1695643246, now seen corresponding path program 4 times
[2024-06-20 19:17:19,101 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:17:19,101 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175969670]
[2024-06-20 19:17:19,101 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:17:19,101 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:17:19,184 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:17:30,581 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:17:30,581 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:17:30,582 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175969670]
[2024-06-20 19:17:30,582 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175969670] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:17:30,582 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:17:30,582 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:17:30,582 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538696732]
[2024-06-20 19:17:30,582 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:17:30,582 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:17:30,582 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:17:30,583 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:17:30,583 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:17:30,879 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-20 19:17:30,879 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 186 transitions, 1939 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 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:17:30,879 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:17:30,879 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-20 19:17:30,880 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:17:33,109 INFO  L124   PetriNetUnfolderBase]: 3235/5008 cut-off events.
[2024-06-20 19:17:33,109 INFO  L125   PetriNetUnfolderBase]: For 239548/239548 co-relation queries the response was YES.
[2024-06-20 19:17:33,129 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33955 conditions, 5008 events. 3235/5008 cut-off events. For 239548/239548 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 27103 event pairs, 757 based on Foata normal form. 16/5021 useless extension candidates. Maximal degree in co-relation 33892. Up to 3688 conditions per place. 
[2024-06-20 19:17:33,144 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 173 selfloop transitions, 62 changer transitions 0/240 dead transitions.
[2024-06-20 19:17:33,144 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 240 transitions, 2781 flow
[2024-06-20 19:17:33,146 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:17:33,147 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:17:33,147 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions.
[2024-06-20 19:17:33,147 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4357142857142857
[2024-06-20 19:17:33,147 INFO  L175             Difference]: Start difference. First operand has 154 places, 186 transitions, 1939 flow. Second operand 10 states and 183 transitions.
[2024-06-20 19:17:33,147 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 240 transitions, 2781 flow
[2024-06-20 19:17:33,331 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 240 transitions, 2615 flow, removed 23 selfloop flow, removed 10 redundant places.
[2024-06-20 19:17:33,334 INFO  L231             Difference]: Finished difference. Result has 155 places, 189 transitions, 2019 flow
[2024-06-20 19:17:33,334 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1773, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2019, PETRI_PLACES=155, PETRI_TRANSITIONS=189}
[2024-06-20 19:17:33,335 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 112 predicate places.
[2024-06-20 19:17:33,335 INFO  L495      AbstractCegarLoop]: Abstraction has has 155 places, 189 transitions, 2019 flow
[2024-06-20 19:17:33,335 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 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:17:33,335 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:17:33,335 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:17:33,335 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-20 19:17:33,335 INFO  L420      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:17:33,336 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:17:33,336 INFO  L85        PathProgramCache]: Analyzing trace with hash -868288536, now seen corresponding path program 2 times
[2024-06-20 19:17:33,336 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:17:33,336 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404288608]
[2024-06-20 19:17:33,336 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:17:33,336 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:17:33,369 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:17:51,271 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:17:51,271 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:17:51,271 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404288608]
[2024-06-20 19:17:51,271 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404288608] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:17:51,271 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:17:51,271 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:17:51,272 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796424855]
[2024-06-20 19:17:51,272 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:17:51,272 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:17:51,272 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:17:51,272 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:17:51,272 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:17:51,396 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-20 19:17:51,396 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 189 transitions, 2019 flow. Second operand  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:17:51,396 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:17:51,396 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-20 19:17:51,396 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:17:53,853 INFO  L124   PetriNetUnfolderBase]: 3242/5019 cut-off events.
[2024-06-20 19:17:53,854 INFO  L125   PetriNetUnfolderBase]: For 239499/239499 co-relation queries the response was YES.
[2024-06-20 19:17:53,874 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34194 conditions, 5019 events. 3242/5019 cut-off events. For 239499/239499 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 27274 event pairs, 845 based on Foata normal form. 2/5018 useless extension candidates. Maximal degree in co-relation 34131. Up to 4823 conditions per place. 
[2024-06-20 19:17:53,890 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 185 selfloop transitions, 30 changer transitions 0/220 dead transitions.
[2024-06-20 19:17:53,890 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 220 transitions, 2633 flow
[2024-06-20 19:17:53,891 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:17:53,891 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:17:53,891 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions.
[2024-06-20 19:17:53,891 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3968253968253968
[2024-06-20 19:17:53,891 INFO  L175             Difference]: Start difference. First operand has 155 places, 189 transitions, 2019 flow. Second operand 9 states and 150 transitions.
[2024-06-20 19:17:53,891 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 220 transitions, 2633 flow
[2024-06-20 19:17:54,027 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 220 transitions, 2541 flow, removed 16 selfloop flow, removed 6 redundant places.
[2024-06-20 19:17:54,030 INFO  L231             Difference]: Finished difference. Result has 158 places, 192 transitions, 2027 flow
[2024-06-20 19:17:54,030 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1927, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2027, PETRI_PLACES=158, PETRI_TRANSITIONS=192}
[2024-06-20 19:17:54,030 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 115 predicate places.
[2024-06-20 19:17:54,030 INFO  L495      AbstractCegarLoop]: Abstraction has has 158 places, 192 transitions, 2027 flow
[2024-06-20 19:17:54,031 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:17:54,031 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:17:54,031 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:17:54,031 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-20 19:17:54,031 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:17:54,031 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:17:54,032 INFO  L85        PathProgramCache]: Analyzing trace with hash -863572104, now seen corresponding path program 1 times
[2024-06-20 19:17:54,032 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:17:54,032 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683555723]
[2024-06-20 19:17:54,032 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:17:54,032 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:17:54,067 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:18:11,257 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:18:11,257 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:18:11,258 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683555723]
[2024-06-20 19:18:11,258 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683555723] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:18:11,259 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:18:11,259 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:18:11,259 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274817086]
[2024-06-20 19:18:11,259 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:18:11,259 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:18:11,260 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:18:11,261 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:18:11,261 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:18:11,435 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-20 19:18:11,436 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 192 transitions, 2027 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:18:11,436 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:18:11,436 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-20 19:18:11,436 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:18:13,515 INFO  L124   PetriNetUnfolderBase]: 3389/5168 cut-off events.
[2024-06-20 19:18:13,515 INFO  L125   PetriNetUnfolderBase]: For 246201/246201 co-relation queries the response was YES.
[2024-06-20 19:18:13,535 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35050 conditions, 5168 events. 3389/5168 cut-off events. For 246201/246201 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 27487 event pairs, 884 based on Foata normal form. 1/5166 useless extension candidates. Maximal degree in co-relation 34985. Up to 5120 conditions per place. 
[2024-06-20 19:18:13,552 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 189 selfloop transitions, 25 changer transitions 0/217 dead transitions.
[2024-06-20 19:18:13,553 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 217 transitions, 2663 flow
[2024-06-20 19:18:13,553 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:18:13,553 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:18:13,553 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 132 transitions.
[2024-06-20 19:18:13,554 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3492063492063492
[2024-06-20 19:18:13,554 INFO  L175             Difference]: Start difference. First operand has 158 places, 192 transitions, 2027 flow. Second operand 9 states and 132 transitions.
[2024-06-20 19:18:13,554 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 217 transitions, 2663 flow
[2024-06-20 19:18:13,741 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 217 transitions, 2581 flow, removed 11 selfloop flow, removed 7 redundant places.
[2024-06-20 19:18:13,744 INFO  L231             Difference]: Finished difference. Result has 160 places, 198 transitions, 2091 flow
[2024-06-20 19:18:13,744 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1945, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2091, PETRI_PLACES=160, PETRI_TRANSITIONS=198}
[2024-06-20 19:18:13,745 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 117 predicate places.
[2024-06-20 19:18:13,745 INFO  L495      AbstractCegarLoop]: Abstraction has has 160 places, 198 transitions, 2091 flow
[2024-06-20 19:18:13,745 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:18:13,746 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:18:13,746 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:18:13,746 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-20 19:18:13,746 INFO  L420      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:18:13,746 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:18:13,746 INFO  L85        PathProgramCache]: Analyzing trace with hash -1526393478, now seen corresponding path program 5 times
[2024-06-20 19:18:13,746 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:18:13,746 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696019540]
[2024-06-20 19:18:13,747 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:18:13,747 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:18:13,791 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:18:25,737 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:18:25,737 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:18:25,737 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696019540]
[2024-06-20 19:18:25,737 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696019540] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:18:25,737 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:18:25,738 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:18:25,738 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137078345]
[2024-06-20 19:18:25,738 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:18:25,738 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:18:25,738 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:18:25,738 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:18:25,739 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:18:26,129 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-20 19:18:26,130 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 198 transitions, 2091 flow. Second operand  has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:18:26,130 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:18:26,130 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-20 19:18:26,130 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:18:28,528 INFO  L124   PetriNetUnfolderBase]: 3492/5425 cut-off events.
[2024-06-20 19:18:28,528 INFO  L125   PetriNetUnfolderBase]: For 280926/280935 co-relation queries the response was YES.
[2024-06-20 19:18:28,553 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37235 conditions, 5425 events. 3492/5425 cut-off events. For 280926/280935 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 30059 event pairs, 809 based on Foata normal form. 22/5442 useless extension candidates. Maximal degree in co-relation 37169. Up to 4499 conditions per place. 
[2024-06-20 19:18:28,577 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 189 selfloop transitions, 63 changer transitions 0/259 dead transitions.
[2024-06-20 19:18:28,577 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 259 transitions, 3024 flow
[2024-06-20 19:18:28,580 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-20 19:18:28,580 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-20 19:18:28,580 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 202 transitions.
[2024-06-20 19:18:28,580 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43722943722943725
[2024-06-20 19:18:28,580 INFO  L175             Difference]: Start difference. First operand has 160 places, 198 transitions, 2091 flow. Second operand 11 states and 202 transitions.
[2024-06-20 19:18:28,580 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 259 transitions, 3024 flow
[2024-06-20 19:18:28,813 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 259 transitions, 2956 flow, removed 22 selfloop flow, removed 5 redundant places.
[2024-06-20 19:18:28,816 INFO  L231             Difference]: Finished difference. Result has 168 places, 204 transitions, 2301 flow
[2024-06-20 19:18:28,816 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2023, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2301, PETRI_PLACES=168, PETRI_TRANSITIONS=204}
[2024-06-20 19:18:28,817 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 125 predicate places.
[2024-06-20 19:18:28,817 INFO  L495      AbstractCegarLoop]: Abstraction has has 168 places, 204 transitions, 2301 flow
[2024-06-20 19:18:28,817 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:18:28,817 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:18:28,817 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:18:28,817 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-20 19:18:28,817 INFO  L420      AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:18:28,818 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:18:28,818 INFO  L85        PathProgramCache]: Analyzing trace with hash 1243574876, now seen corresponding path program 6 times
[2024-06-20 19:18:28,818 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:18:28,818 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073506184]
[2024-06-20 19:18:28,818 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:18:28,818 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:18:28,860 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:18:40,745 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:18:40,746 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:18:40,746 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073506184]
[2024-06-20 19:18:40,746 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073506184] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:18:40,746 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:18:40,746 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:18:40,746 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629023731]
[2024-06-20 19:18:40,746 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:18:40,747 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:18:40,748 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:18:40,748 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:18:40,748 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:18:41,041 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-20 19:18:41,041 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 204 transitions, 2301 flow. Second operand  has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:18:41,041 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:18:41,041 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-20 19:18:41,041 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:18:43,694 INFO  L124   PetriNetUnfolderBase]: 3725/5810 cut-off events.
[2024-06-20 19:18:43,695 INFO  L125   PetriNetUnfolderBase]: For 309494/309503 co-relation queries the response was YES.
[2024-06-20 19:18:43,719 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40447 conditions, 5810 events. 3725/5810 cut-off events. For 309494/309503 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 32917 event pairs, 868 based on Foata normal form. 22/5827 useless extension candidates. Maximal degree in co-relation 40377. Up to 4884 conditions per place. 
[2024-06-20 19:18:43,740 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 192 selfloop transitions, 67 changer transitions 0/266 dead transitions.
[2024-06-20 19:18:43,740 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 266 transitions, 3270 flow
[2024-06-20 19:18:43,743 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-20 19:18:43,743 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-20 19:18:43,743 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 201 transitions.
[2024-06-20 19:18:43,744 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43506493506493504
[2024-06-20 19:18:43,745 INFO  L175             Difference]: Start difference. First operand has 168 places, 204 transitions, 2301 flow. Second operand 11 states and 201 transitions.
[2024-06-20 19:18:43,745 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 266 transitions, 3270 flow
[2024-06-20 19:18:43,945 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 266 transitions, 3169 flow, removed 20 selfloop flow, removed 6 redundant places.
[2024-06-20 19:18:43,969 INFO  L231             Difference]: Finished difference. Result has 175 places, 210 transitions, 2498 flow
[2024-06-20 19:18:43,969 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2200, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2498, PETRI_PLACES=175, PETRI_TRANSITIONS=210}
[2024-06-20 19:18:43,971 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 132 predicate places.
[2024-06-20 19:18:43,971 INFO  L495      AbstractCegarLoop]: Abstraction has has 175 places, 210 transitions, 2498 flow
[2024-06-20 19:18:43,971 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:18:43,971 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:18:43,971 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:18:43,971 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-20 19:18:43,972 INFO  L420      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:18:43,972 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:18:43,972 INFO  L85        PathProgramCache]: Analyzing trace with hash 1509272156, now seen corresponding path program 7 times
[2024-06-20 19:18:43,972 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:18:43,972 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303860242]
[2024-06-20 19:18:43,972 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:18:43,972 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:18:44,016 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:18:55,884 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:18:55,885 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:18:55,885 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303860242]
[2024-06-20 19:18:55,885 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303860242] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:18:55,885 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:18:55,885 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:18:55,885 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542162669]
[2024-06-20 19:18:55,885 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:18:55,886 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:18:55,886 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:18:55,886 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:18:55,886 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:18:56,251 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-20 19:18:56,251 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 210 transitions, 2498 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 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:18:56,251 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:18:56,251 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-20 19:18:56,251 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:18:58,777 INFO  L124   PetriNetUnfolderBase]: 3822/5975 cut-off events.
[2024-06-20 19:18:58,778 INFO  L125   PetriNetUnfolderBase]: For 332335/332344 co-relation queries the response was YES.
[2024-06-20 19:18:58,806 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42365 conditions, 5975 events. 3822/5975 cut-off events. For 332335/332344 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 33994 event pairs, 808 based on Foata normal form. 22/5992 useless extension candidates. Maximal degree in co-relation 42291. Up to 3081 conditions per place. 
[2024-06-20 19:18:58,827 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 149 selfloop transitions, 108 changer transitions 0/264 dead transitions.
[2024-06-20 19:18:58,827 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 264 transitions, 3428 flow
[2024-06-20 19:18:58,827 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:18:58,827 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:18:58,828 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 184 transitions.
[2024-06-20 19:18:58,828 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4380952380952381
[2024-06-20 19:18:58,828 INFO  L175             Difference]: Start difference. First operand has 175 places, 210 transitions, 2498 flow. Second operand 10 states and 184 transitions.
[2024-06-20 19:18:58,828 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 264 transitions, 3428 flow
[2024-06-20 19:18:59,146 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 264 transitions, 3311 flow, removed 24 selfloop flow, removed 6 redundant places.
[2024-06-20 19:18:59,150 INFO  L231             Difference]: Finished difference. Result has 180 places, 213 transitions, 2768 flow
[2024-06-20 19:18:59,150 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2381, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2768, PETRI_PLACES=180, PETRI_TRANSITIONS=213}
[2024-06-20 19:18:59,150 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 137 predicate places.
[2024-06-20 19:18:59,150 INFO  L495      AbstractCegarLoop]: Abstraction has has 180 places, 213 transitions, 2768 flow
[2024-06-20 19:18:59,151 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 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:18:59,151 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:18:59,151 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:18:59,151 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-20 19:18:59,151 INFO  L420      AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:18:59,151 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:18:59,152 INFO  L85        PathProgramCache]: Analyzing trace with hash 1500075386, now seen corresponding path program 8 times
[2024-06-20 19:18:59,152 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:18:59,152 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435787009]
[2024-06-20 19:18:59,152 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:18:59,152 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:18:59,194 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:19:10,996 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:19:10,996 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:19:10,996 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435787009]
[2024-06-20 19:19:10,996 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435787009] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:19:10,996 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:19:10,996 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:19:10,996 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714871681]
[2024-06-20 19:19:10,996 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:19:10,996 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:19:10,997 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:19:10,997 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:19:10,997 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:19:11,228 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-20 19:19:11,228 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 213 transitions, 2768 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 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:19:11,228 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:19:11,228 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-20 19:19:11,228 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:19:13,878 INFO  L124   PetriNetUnfolderBase]: 3791/5928 cut-off events.
[2024-06-20 19:19:13,879 INFO  L125   PetriNetUnfolderBase]: For 334346/334355 co-relation queries the response was YES.
[2024-06-20 19:19:13,906 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42573 conditions, 5928 events. 3791/5928 cut-off events. For 334346/334355 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 33859 event pairs, 850 based on Foata normal form. 22/5945 useless extension candidates. Maximal degree in co-relation 42496. Up to 4581 conditions per place. 
[2024-06-20 19:19:13,926 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 165 selfloop transitions, 92 changer transitions 0/264 dead transitions.
[2024-06-20 19:19:13,927 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 264 transitions, 3596 flow
[2024-06-20 19:19:13,929 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:19:13,929 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:19:13,929 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 186 transitions.
[2024-06-20 19:19:13,930 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44285714285714284
[2024-06-20 19:19:13,930 INFO  L175             Difference]: Start difference. First operand has 180 places, 213 transitions, 2768 flow. Second operand 10 states and 186 transitions.
[2024-06-20 19:19:13,930 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 264 transitions, 3596 flow
[2024-06-20 19:19:14,210 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 264 transitions, 3510 flow, removed 24 selfloop flow, removed 5 redundant places.
[2024-06-20 19:19:14,214 INFO  L231             Difference]: Finished difference. Result has 185 places, 213 transitions, 2874 flow
[2024-06-20 19:19:14,214 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2682, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2874, PETRI_PLACES=185, PETRI_TRANSITIONS=213}
[2024-06-20 19:19:14,214 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 142 predicate places.
[2024-06-20 19:19:14,214 INFO  L495      AbstractCegarLoop]: Abstraction has has 185 places, 213 transitions, 2874 flow
[2024-06-20 19:19:14,215 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 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:19:14,215 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:19:14,215 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:19:14,215 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-20 19:19:14,215 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:19:14,215 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:19:14,215 INFO  L85        PathProgramCache]: Analyzing trace with hash 1206656058, now seen corresponding path program 2 times
[2024-06-20 19:19:14,216 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:19:14,216 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167588448]
[2024-06-20 19:19:14,216 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:19:14,216 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:19:14,250 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:19:32,317 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:19:32,317 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:19:32,317 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167588448]
[2024-06-20 19:19:32,317 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167588448] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:19:32,317 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:19:32,317 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:19:32,318 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145330849]
[2024-06-20 19:19:32,318 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:19:32,318 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:19:32,318 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:19:32,318 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:19:32,318 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:19:32,483 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-20 19:19:32,483 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 213 transitions, 2874 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:19:32,484 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:19:32,484 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-20 19:19:32,484 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:19:34,974 INFO  L124   PetriNetUnfolderBase]: 3926/6065 cut-off events.
[2024-06-20 19:19:34,975 INFO  L125   PetriNetUnfolderBase]: For 333761/333770 co-relation queries the response was YES.
[2024-06-20 19:19:35,008 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43737 conditions, 6065 events. 3926/6065 cut-off events. For 333761/333770 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 34114 event pairs, 1055 based on Foata normal form. 7/6067 useless extension candidates. Maximal degree in co-relation 43658. Up to 6014 conditions per place. 
[2024-06-20 19:19:35,032 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 198 selfloop transitions, 28 changer transitions 0/229 dead transitions.
[2024-06-20 19:19:35,033 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 229 transitions, 3484 flow
[2024-06-20 19:19:35,033 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:19:35,033 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:19:35,033 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 127 transitions.
[2024-06-20 19:19:35,034 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.335978835978836
[2024-06-20 19:19:35,034 INFO  L175             Difference]: Start difference. First operand has 185 places, 213 transitions, 2874 flow. Second operand 9 states and 127 transitions.
[2024-06-20 19:19:35,034 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 229 transitions, 3484 flow
[2024-06-20 19:19:35,372 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 229 transitions, 3073 flow, removed 25 selfloop flow, removed 13 redundant places.
[2024-06-20 19:19:35,375 INFO  L231             Difference]: Finished difference. Result has 181 places, 216 transitions, 2567 flow
[2024-06-20 19:19:35,375 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2465, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2567, PETRI_PLACES=181, PETRI_TRANSITIONS=216}
[2024-06-20 19:19:35,375 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 138 predicate places.
[2024-06-20 19:19:35,375 INFO  L495      AbstractCegarLoop]: Abstraction has has 181 places, 216 transitions, 2567 flow
[2024-06-20 19:19:35,376 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:19:35,376 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:19:35,376 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:19:35,376 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-20 19:19:35,376 INFO  L420      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:19:35,376 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:19:35,376 INFO  L85        PathProgramCache]: Analyzing trace with hash 1206655686, now seen corresponding path program 3 times
[2024-06-20 19:19:35,377 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:19:35,377 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594431879]
[2024-06-20 19:19:35,377 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:19:35,377 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:19:35,410 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:19:53,055 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:19:53,055 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:19:53,055 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594431879]
[2024-06-20 19:19:53,055 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594431879] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:19:53,055 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:19:53,056 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:19:53,056 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202427453]
[2024-06-20 19:19:53,056 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:19:53,056 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:19:53,056 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:19:53,057 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:19:53,057 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:19:53,171 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-20 19:19:53,171 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 216 transitions, 2567 flow. Second operand  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:19:53,171 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:19:53,171 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-20 19:19:53,171 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:19:55,923 INFO  L124   PetriNetUnfolderBase]: 3790/5927 cut-off events.
[2024-06-20 19:19:55,923 INFO  L125   PetriNetUnfolderBase]: For 323569/323578 co-relation queries the response was YES.
[2024-06-20 19:19:55,951 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41329 conditions, 5927 events. 3790/5927 cut-off events. For 323569/323578 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 34004 event pairs, 1014 based on Foata normal form. 8/5930 useless extension candidates. Maximal degree in co-relation 41254. Up to 5728 conditions per place. 
[2024-06-20 19:19:55,974 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 198 selfloop transitions, 30 changer transitions 0/236 dead transitions.
[2024-06-20 19:19:55,974 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 236 transitions, 3075 flow
[2024-06-20 19:19:55,974 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:19:55,974 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:19:55,975 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions.
[2024-06-20 19:19:55,975 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.37566137566137564
[2024-06-20 19:19:55,975 INFO  L175             Difference]: Start difference. First operand has 181 places, 216 transitions, 2567 flow. Second operand 9 states and 142 transitions.
[2024-06-20 19:19:55,975 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 236 transitions, 3075 flow
[2024-06-20 19:19:56,214 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 236 transitions, 2975 flow, removed 22 selfloop flow, removed 7 redundant places.
[2024-06-20 19:19:56,217 INFO  L231             Difference]: Finished difference. Result has 183 places, 216 transitions, 2533 flow
[2024-06-20 19:19:56,217 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2467, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2533, PETRI_PLACES=183, PETRI_TRANSITIONS=216}
[2024-06-20 19:19:56,217 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 140 predicate places.
[2024-06-20 19:19:56,218 INFO  L495      AbstractCegarLoop]: Abstraction has has 183 places, 216 transitions, 2533 flow
[2024-06-20 19:19:56,218 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:19:56,218 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:19:56,218 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:19:56,218 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-20 19:19:56,218 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:19:56,218 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:19:56,219 INFO  L85        PathProgramCache]: Analyzing trace with hash -508893354, now seen corresponding path program 3 times
[2024-06-20 19:19:56,219 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:19:56,219 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780233003]
[2024-06-20 19:19:56,219 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:19:56,219 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:19:56,252 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:20:13,732 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:20:13,732 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:20:13,732 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780233003]
[2024-06-20 19:20:13,732 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780233003] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:20:13,732 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:20:13,733 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:20:13,733 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637678497]
[2024-06-20 19:20:13,733 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:20:13,733 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:20:13,733 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:20:13,733 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:20:13,734 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:20:13,867 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42
[2024-06-20 19:20:13,867 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 216 transitions, 2533 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:20:13,867 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:20:13,868 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42
[2024-06-20 19:20:13,868 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:20:16,303 INFO  L124   PetriNetUnfolderBase]: 3917/6053 cut-off events.
[2024-06-20 19:20:16,304 INFO  L125   PetriNetUnfolderBase]: For 332720/332726 co-relation queries the response was YES.
[2024-06-20 19:20:16,331 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42135 conditions, 6053 events. 3917/6053 cut-off events. For 332720/332726 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 34062 event pairs, 1054 based on Foata normal form. 5/6053 useless extension candidates. Maximal degree in co-relation 42059. Up to 6003 conditions per place. 
[2024-06-20 19:20:16,350 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 196 selfloop transitions, 27 changer transitions 0/226 dead transitions.
[2024-06-20 19:20:16,351 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 226 transitions, 3003 flow
[2024-06-20 19:20:16,351 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:20:16,351 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:20:16,351 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions.
[2024-06-20 19:20:16,352 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.35374149659863946
[2024-06-20 19:20:16,352 INFO  L175             Difference]: Start difference. First operand has 183 places, 216 transitions, 2533 flow. Second operand 7 states and 104 transitions.
[2024-06-20 19:20:16,352 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 226 transitions, 3003 flow
[2024-06-20 19:20:16,660 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 226 transitions, 2903 flow, removed 17 selfloop flow, removed 8 redundant places.
[2024-06-20 19:20:16,663 INFO  L231             Difference]: Finished difference. Result has 182 places, 216 transitions, 2493 flow
[2024-06-20 19:20:16,663 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2433, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2493, PETRI_PLACES=182, PETRI_TRANSITIONS=216}
[2024-06-20 19:20:16,663 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 139 predicate places.
[2024-06-20 19:20:16,663 INFO  L495      AbstractCegarLoop]: Abstraction has has 182 places, 216 transitions, 2493 flow
[2024-06-20 19:20:16,664 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:20:16,664 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:20:16,664 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:20:16,664 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-20 19:20:16,664 INFO  L420      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:20:16,664 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:20:16,665 INFO  L85        PathProgramCache]: Analyzing trace with hash -686376228, now seen corresponding path program 1 times
[2024-06-20 19:20:16,665 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:20:16,665 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049520788]
[2024-06-20 19:20:16,665 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:20:16,665 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:20:16,712 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:20:31,316 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:20:31,316 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:20:31,316 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049520788]
[2024-06-20 19:20:31,316 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049520788] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:20:31,316 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:20:31,317 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:20:31,317 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801292330]
[2024-06-20 19:20:31,317 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:20:31,317 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:20:31,317 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:20:31,318 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:20:31,318 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:20:31,523 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 19:20:31,524 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 216 transitions, 2493 flow. Second operand  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:20:31,524 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:20:31,524 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 19:20:31,524 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:20:33,679 INFO  L124   PetriNetUnfolderBase]: 3543/5652 cut-off events.
[2024-06-20 19:20:33,679 INFO  L125   PetriNetUnfolderBase]: For 305408/305408 co-relation queries the response was YES.
[2024-06-20 19:20:33,706 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38740 conditions, 5652 events. 3543/5652 cut-off events. For 305408/305408 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 33166 event pairs, 923 based on Foata normal form. 1/5650 useless extension candidates. Maximal degree in co-relation 38663. Up to 5429 conditions per place. 
[2024-06-20 19:20:33,725 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 212 selfloop transitions, 14 changer transitions 0/235 dead transitions.
[2024-06-20 19:20:33,725 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 235 transitions, 3037 flow
[2024-06-20 19:20:33,725 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:20:33,726 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:20:33,726 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions.
[2024-06-20 19:20:33,726 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40476190476190477
[2024-06-20 19:20:33,726 INFO  L175             Difference]: Start difference. First operand has 182 places, 216 transitions, 2493 flow. Second operand 7 states and 119 transitions.
[2024-06-20 19:20:33,726 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 235 transitions, 3037 flow
[2024-06-20 19:20:34,060 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 235 transitions, 2983 flow, removed 0 selfloop flow, removed 6 redundant places.
[2024-06-20 19:20:34,063 INFO  L231             Difference]: Finished difference. Result has 183 places, 219 transitions, 2531 flow
[2024-06-20 19:20:34,063 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2439, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2531, PETRI_PLACES=183, PETRI_TRANSITIONS=219}
[2024-06-20 19:20:34,063 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 140 predicate places.
[2024-06-20 19:20:34,063 INFO  L495      AbstractCegarLoop]: Abstraction has has 183 places, 219 transitions, 2531 flow
[2024-06-20 19:20:34,063 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:20:34,064 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:20:34,064 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:20:34,064 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-20 19:20:34,064 INFO  L420      AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:20:34,064 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:20:34,064 INFO  L85        PathProgramCache]: Analyzing trace with hash -686256258, now seen corresponding path program 2 times
[2024-06-20 19:20:34,064 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:20:34,064 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485357282]
[2024-06-20 19:20:34,065 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:20:34,065 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:20:34,118 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:20:48,735 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:20:48,736 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:20:48,736 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485357282]
[2024-06-20 19:20:48,736 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485357282] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:20:48,736 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:20:48,736 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:20:48,736 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85674067]
[2024-06-20 19:20:48,736 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:20:48,736 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:20:48,737 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:20:48,739 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:20:48,739 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:20:48,904 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 19:20:48,905 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 219 transitions, 2531 flow. Second operand  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:20:48,905 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:20:48,905 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 19:20:48,905 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:20:51,117 INFO  L124   PetriNetUnfolderBase]: 3548/5659 cut-off events.
[2024-06-20 19:20:51,118 INFO  L125   PetriNetUnfolderBase]: For 316737/316737 co-relation queries the response was YES.
[2024-06-20 19:20:51,144 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39317 conditions, 5659 events. 3548/5659 cut-off events. For 316737/316737 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 33199 event pairs, 924 based on Foata normal form. 1/5657 useless extension candidates. Maximal degree in co-relation 39239. Up to 5420 conditions per place. 
[2024-06-20 19:20:51,163 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 204 selfloop transitions, 26 changer transitions 0/239 dead transitions.
[2024-06-20 19:20:51,164 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 239 transitions, 3235 flow
[2024-06-20 19:20:51,164 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:20:51,164 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:20:51,164 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions.
[2024-06-20 19:20:51,165 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41156462585034015
[2024-06-20 19:20:51,165 INFO  L175             Difference]: Start difference. First operand has 183 places, 219 transitions, 2531 flow. Second operand 7 states and 121 transitions.
[2024-06-20 19:20:51,165 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 239 transitions, 3235 flow
[2024-06-20 19:20:51,574 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 239 transitions, 3165 flow, removed 23 selfloop flow, removed 5 redundant places.
[2024-06-20 19:20:51,577 INFO  L231             Difference]: Finished difference. Result has 185 places, 225 transitions, 2641 flow
[2024-06-20 19:20:51,577 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2461, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2641, PETRI_PLACES=185, PETRI_TRANSITIONS=225}
[2024-06-20 19:20:51,578 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 142 predicate places.
[2024-06-20 19:20:51,578 INFO  L495      AbstractCegarLoop]: Abstraction has has 185 places, 225 transitions, 2641 flow
[2024-06-20 19:20:51,578 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:20:51,578 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:20:51,578 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:20:51,578 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-20 19:20:51,579 INFO  L420      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:20:51,579 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:20:51,579 INFO  L85        PathProgramCache]: Analyzing trace with hash -515553642, now seen corresponding path program 1 times
[2024-06-20 19:20:51,579 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:20:51,579 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664902826]
[2024-06-20 19:20:51,579 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:20:51,580 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:20:51,626 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:21:06,578 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:21:06,578 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:21:06,578 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664902826]
[2024-06-20 19:21:06,578 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664902826] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:21:06,578 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:21:06,579 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:21:06,579 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265355233]
[2024-06-20 19:21:06,579 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:21:06,579 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:21:06,579 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:21:06,579 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:21:06,580 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:21:06,789 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-20 19:21:06,790 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 225 transitions, 2641 flow. Second operand  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:21:06,790 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:21:06,790 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-20 19:21:06,790 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:21:09,035 INFO  L124   PetriNetUnfolderBase]: 3683/5796 cut-off events.
[2024-06-20 19:21:09,036 INFO  L125   PetriNetUnfolderBase]: For 329188/329188 co-relation queries the response was YES.
[2024-06-20 19:21:09,065 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40504 conditions, 5796 events. 3683/5796 cut-off events. For 329188/329188 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 33379 event pairs, 963 based on Foata normal form. 1/5794 useless extension candidates. Maximal degree in co-relation 40425. Up to 5674 conditions per place. 
[2024-06-20 19:21:09,085 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 218 selfloop transitions, 24 changer transitions 0/246 dead transitions.
[2024-06-20 19:21:09,085 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 246 transitions, 3325 flow
[2024-06-20 19:21:09,086 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:21:09,086 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:21:09,086 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions.
[2024-06-20 19:21:09,086 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.375
[2024-06-20 19:21:09,086 INFO  L175             Difference]: Start difference. First operand has 185 places, 225 transitions, 2641 flow. Second operand 8 states and 126 transitions.
[2024-06-20 19:21:09,086 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 246 transitions, 3325 flow
[2024-06-20 19:21:09,539 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 246 transitions, 3253 flow, removed 28 selfloop flow, removed 3 redundant places.
[2024-06-20 19:21:09,542 INFO  L231             Difference]: Finished difference. Result has 190 places, 231 transitions, 2697 flow
[2024-06-20 19:21:09,542 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2569, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2697, PETRI_PLACES=190, PETRI_TRANSITIONS=231}
[2024-06-20 19:21:09,543 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 147 predicate places.
[2024-06-20 19:21:09,543 INFO  L495      AbstractCegarLoop]: Abstraction has has 190 places, 231 transitions, 2697 flow
[2024-06-20 19:21:09,543 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:21:09,543 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:21:09,543 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:21:09,543 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-20 19:21:09,543 INFO  L420      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:21:09,544 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:21:09,544 INFO  L85        PathProgramCache]: Analyzing trace with hash 1705779060, now seen corresponding path program 2 times
[2024-06-20 19:21:09,544 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:21:09,544 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233392456]
[2024-06-20 19:21:09,544 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:21:09,544 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:21:09,588 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:21:22,991 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:21:22,991 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:21:22,991 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233392456]
[2024-06-20 19:21:22,991 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233392456] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:21:22,991 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:21:22,991 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:21:22,992 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391481297]
[2024-06-20 19:21:22,992 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:21:22,992 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:21:22,992 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:21:22,992 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:21:22,992 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:21:23,155 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-20 19:21:23,156 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 231 transitions, 2697 flow. Second operand  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:21:23,156 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:21:23,156 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-20 19:21:23,156 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:21:25,404 INFO  L124   PetriNetUnfolderBase]: 3688/5803 cut-off events.
[2024-06-20 19:21:25,404 INFO  L125   PetriNetUnfolderBase]: For 341608/341608 co-relation queries the response was YES.
[2024-06-20 19:21:25,434 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41127 conditions, 5803 events. 3688/5803 cut-off events. For 341608/341608 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 33416 event pairs, 962 based on Foata normal form. 1/5801 useless extension candidates. Maximal degree in co-relation 41046. Up to 5702 conditions per place. 
[2024-06-20 19:21:25,452 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 226 selfloop transitions, 14 changer transitions 0/244 dead transitions.
[2024-06-20 19:21:25,453 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 244 transitions, 3241 flow
[2024-06-20 19:21:25,453 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:21:25,453 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:21:25,454 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions.
[2024-06-20 19:21:25,454 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.36394557823129253
[2024-06-20 19:21:25,454 INFO  L175             Difference]: Start difference. First operand has 190 places, 231 transitions, 2697 flow. Second operand 7 states and 107 transitions.
[2024-06-20 19:21:25,454 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 244 transitions, 3241 flow
[2024-06-20 19:21:25,856 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 244 transitions, 3193 flow, removed 16 selfloop flow, removed 4 redundant places.
[2024-06-20 19:21:25,859 INFO  L231             Difference]: Finished difference. Result has 193 places, 234 transitions, 2729 flow
[2024-06-20 19:21:25,859 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2651, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2729, PETRI_PLACES=193, PETRI_TRANSITIONS=234}
[2024-06-20 19:21:25,860 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 150 predicate places.
[2024-06-20 19:21:25,860 INFO  L495      AbstractCegarLoop]: Abstraction has has 193 places, 234 transitions, 2729 flow
[2024-06-20 19:21:25,860 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:21:25,860 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:21:25,860 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:21:25,860 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-20 19:21:25,860 INFO  L420      AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:21:25,861 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:21:25,861 INFO  L85        PathProgramCache]: Analyzing trace with hash -509124738, now seen corresponding path program 3 times
[2024-06-20 19:21:25,861 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:21:25,861 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556910741]
[2024-06-20 19:21:25,861 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:21:25,861 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:21:25,906 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:21:40,295 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:21:40,295 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:21:40,296 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556910741]
[2024-06-20 19:21:40,296 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556910741] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:21:40,296 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:21:40,296 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:21:40,296 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953284564]
[2024-06-20 19:21:40,296 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:21:40,296 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:21:40,297 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:21:40,297 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:21:40,297 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:21:40,504 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 19:21:40,504 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 234 transitions, 2729 flow. Second operand  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:21:40,504 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:21:40,504 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 19:21:40,504 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:21:42,696 INFO  L124   PetriNetUnfolderBase]: 3567/5681 cut-off events.
[2024-06-20 19:21:42,697 INFO  L125   PetriNetUnfolderBase]: For 352855/352855 co-relation queries the response was YES.
[2024-06-20 19:21:42,728 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40692 conditions, 5681 events. 3567/5681 cut-off events. For 352855/352855 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 33241 event pairs, 926 based on Foata normal form. 1/5679 useless extension candidates. Maximal degree in co-relation 40609. Up to 5466 conditions per place. 
[2024-06-20 19:21:42,748 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 218 selfloop transitions, 14 changer transitions 0/244 dead transitions.
[2024-06-20 19:21:42,749 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 244 transitions, 3217 flow
[2024-06-20 19:21:42,749 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:21:42,749 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:21:42,750 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions.
[2024-06-20 19:21:42,750 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3843537414965986
[2024-06-20 19:21:42,750 INFO  L175             Difference]: Start difference. First operand has 193 places, 234 transitions, 2729 flow. Second operand 7 states and 113 transitions.
[2024-06-20 19:21:42,750 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 244 transitions, 3217 flow
[2024-06-20 19:21:43,171 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 244 transitions, 3127 flow, removed 33 selfloop flow, removed 5 redundant places.
[2024-06-20 19:21:43,174 INFO  L231             Difference]: Finished difference. Result has 195 places, 234 transitions, 2673 flow
[2024-06-20 19:21:43,175 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2639, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2673, PETRI_PLACES=195, PETRI_TRANSITIONS=234}
[2024-06-20 19:21:43,175 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 152 predicate places.
[2024-06-20 19:21:43,175 INFO  L495      AbstractCegarLoop]: Abstraction has has 195 places, 234 transitions, 2673 flow
[2024-06-20 19:21:43,176 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:21:43,176 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:21:43,176 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:21:43,176 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-20 19:21:43,176 INFO  L420      AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:21:43,177 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:21:43,177 INFO  L85        PathProgramCache]: Analyzing trace with hash -509124552, now seen corresponding path program 3 times
[2024-06-20 19:21:43,177 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:21:43,177 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262475255]
[2024-06-20 19:21:43,177 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:21:43,177 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:21:43,246 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:21:57,774 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:21:57,775 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:21:57,775 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262475255]
[2024-06-20 19:21:57,775 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262475255] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:21:57,775 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:21:57,775 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:21:57,775 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042264260]
[2024-06-20 19:21:57,775 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:21:57,776 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:21:57,776 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:21:57,776 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:21:57,777 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:21:57,967 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-20 19:21:57,968 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 234 transitions, 2673 flow. Second operand  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:21:57,968 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:21:57,968 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-20 19:21:57,968 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:22:00,189 INFO  L124   PetriNetUnfolderBase]: 3682/5795 cut-off events.
[2024-06-20 19:22:00,189 INFO  L125   PetriNetUnfolderBase]: For 362270/362270 co-relation queries the response was YES.
[2024-06-20 19:22:00,219 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41397 conditions, 5795 events. 3682/5795 cut-off events. For 362270/362270 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 33377 event pairs, 962 based on Foata normal form. 1/5793 useless extension candidates. Maximal degree in co-relation 41313. Up to 5688 conditions per place. 
[2024-06-20 19:22:00,238 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 221 selfloop transitions, 20 changer transitions 0/245 dead transitions.
[2024-06-20 19:22:00,238 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 245 transitions, 3181 flow
[2024-06-20 19:22:00,239 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:22:00,239 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:22:00,239 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 120 transitions.
[2024-06-20 19:22:00,239 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.35714285714285715
[2024-06-20 19:22:00,239 INFO  L175             Difference]: Start difference. First operand has 195 places, 234 transitions, 2673 flow. Second operand 8 states and 120 transitions.
[2024-06-20 19:22:00,240 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 245 transitions, 3181 flow
[2024-06-20 19:22:00,563 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 245 transitions, 3121 flow, removed 12 selfloop flow, removed 6 redundant places.
[2024-06-20 19:22:00,566 INFO  L231             Difference]: Finished difference. Result has 197 places, 234 transitions, 2659 flow
[2024-06-20 19:22:00,567 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2613, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2659, PETRI_PLACES=197, PETRI_TRANSITIONS=234}
[2024-06-20 19:22:00,567 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 154 predicate places.
[2024-06-20 19:22:00,567 INFO  L495      AbstractCegarLoop]: Abstraction has has 197 places, 234 transitions, 2659 flow
[2024-06-20 19:22:00,567 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:22:00,567 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:22:00,568 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:22:00,568 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-20 19:22:00,568 INFO  L420      AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:22:00,568 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:22:00,568 INFO  L85        PathProgramCache]: Analyzing trace with hash -86360761, now seen corresponding path program 1 times
[2024-06-20 19:22:00,569 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:22:00,573 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257734529]
[2024-06-20 19:22:00,573 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:22:00,573 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:22:00,672 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:22:13,939 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:22:13,940 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:22:13,940 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257734529]
[2024-06-20 19:22:13,940 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257734529] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:22:13,940 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:22:13,940 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-06-20 19:22:13,940 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616916644]
[2024-06-20 19:22:13,940 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:22:13,941 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-06-20 19:22:13,941 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:22:13,941 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-06-20 19:22:13,941 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132
[2024-06-20 19:22:14,196 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-20 19:22:14,196 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 234 transitions, 2659 flow. Second operand  has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:22:14,196 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:22:14,196 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-20 19:22:14,196 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
Killed by 15