./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix016_power.opt_rmo.opt.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/mix016_power.opt_rmo.opt.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/mix016_power.opt_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix016_power.opt_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --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 18:33:14,261 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-20 18:33:14,322 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-20 18:33:14,326 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-20 18:33:14,327 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-20 18:33:14,351 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-20 18:33:14,353 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-20 18:33:14,354 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-20 18:33:14,354 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-20 18:33:14,357 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-20 18:33:14,357 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-20 18:33:14,358 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-20 18:33:14,358 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-20 18:33:14,359 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-20 18:33:14,359 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-20 18:33:14,360 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-20 18:33:14,360 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-20 18:33:14,360 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-20 18:33:14,360 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-20 18:33:14,361 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-20 18:33:14,362 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-20 18:33:14,362 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-20 18:33:14,362 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-20 18:33:14,362 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-20 18:33:14,363 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-20 18:33:14,363 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-20 18:33:14,363 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-20 18:33:14,363 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-20 18:33:14,364 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-20 18:33:14,364 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-20 18:33:14,365 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-20 18:33:14,365 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-20 18:33:14,365 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-20 18:33:14,365 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-20 18:33:14,365 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-20 18:33:14,365 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-20 18:33:14,366 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-20 18:33:14,366 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-20 18:33:14,366 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-20 18:33:14,366 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-20 18:33:14,366 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-20 18:33:14,367 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-20 18:33:14,367 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-20 18:33:14,367 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 18:33:14,641 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-20 18:33:14,661 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-20 18:33:14,663 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-20 18:33:14,665 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-20 18:33:14,666 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-20 18:33:14,667 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/mix016_power.opt_rmo.opt.yml/witness.yml
[2024-06-20 18:33:14,869 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-20 18:33:14,870 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-20 18:33:14,870 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_power.opt_rmo.opt.i
[2024-06-20 18:33:15,917 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-20 18:33:16,153 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-20 18:33:16,153 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_power.opt_rmo.opt.i
[2024-06-20 18:33:16,173 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec0873ac0/45787e53614b487d8c354c1b9ad27fa3/FLAGb49a7fb4f
[2024-06-20 18:33:16,186 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec0873ac0/45787e53614b487d8c354c1b9ad27fa3
[2024-06-20 18:33:16,187 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-20 18:33:16,188 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-20 18:33:16,191 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-20 18:33:16,191 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-20 18:33:16,196 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-20 18:33:16,196 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 06:33:14" (1/2) ...
[2024-06-20 18:33:16,197 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56a7ada and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:33:16, skipping insertion in model container
[2024-06-20 18:33:16,197 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 06:33:14" (1/2) ...
[2024-06-20 18:33:16,198 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@325dfad1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:33:16, skipping insertion in model container
[2024-06-20 18:33:16,198 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 06:33:16" (2/2) ...
[2024-06-20 18:33:16,198 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56a7ada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:33:16, skipping insertion in model container
[2024-06-20 18:33:16,198 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 06:33:16" (2/2) ...
[2024-06-20 18:33:16,199 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-20 18:33:16,271 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-20 18:33:16,272 INFO  L97    edCorrectnessWitness]: Location invariant before [L841-L841] ((((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((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_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_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_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_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_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$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) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )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 )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$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$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$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_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_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_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_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_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_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_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$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$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 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 )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) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 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 )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )z >= 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_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (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 )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 || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && 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) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)
[2024-06-20 18:33:16,273 INFO  L97    edCorrectnessWitness]: Location invariant before [L842-L842] ((((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((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_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_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_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_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_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$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) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )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 )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$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$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$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_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_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_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_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_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_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_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$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$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 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 )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) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 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 )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )z >= 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_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (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 )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 || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && 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) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)
[2024-06-20 18:33:16,274 INFO  L97    edCorrectnessWitness]: Location invariant before [L839-L839] ((((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((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_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_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_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_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_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$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) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )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 )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$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$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$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_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_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_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_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_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_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_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$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$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 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 )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) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 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 )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )z >= 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_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (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 )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 || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && 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) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)
[2024-06-20 18:33:16,274 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-20 18:33:16,274 INFO  L106   edCorrectnessWitness]: ghost_update [L837-L837] multithreaded = 1;
[2024-06-20 18:33:16,310 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-20 18:33:16,623 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-20 18:33:16,634 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-20 18:33:17,034 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-20 18:33:17,065 INFO  L206         MainTranslator]: Completed translation
[2024-06-20 18:33:17,066 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:33:17 WrapperNode
[2024-06-20 18:33:17,066 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-20 18:33:17,067 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-20 18:33:17,067 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-20 18:33:17,067 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-20 18:33:17,072 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:33:17" (1/1) ...
[2024-06-20 18:33:17,113 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:33:17" (1/1) ...
[2024-06-20 18:33:17,316 INFO  L138                Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 127
[2024-06-20 18:33:17,317 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-20 18:33:17,318 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-20 18:33:17,318 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-20 18:33:17,319 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-20 18:33:17,328 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:33:17" (1/1) ...
[2024-06-20 18:33:17,328 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:33:17" (1/1) ...
[2024-06-20 18:33:17,378 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:33:17" (1/1) ...
[2024-06-20 18:33:17,434 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 18:33:17,435 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:33:17" (1/1) ...
[2024-06-20 18:33:17,435 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:33:17" (1/1) ...
[2024-06-20 18:33:17,487 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:33:17" (1/1) ...
[2024-06-20 18:33:17,489 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:33:17" (1/1) ...
[2024-06-20 18:33:17,508 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:33:17" (1/1) ...
[2024-06-20 18:33:17,512 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:33:17" (1/1) ...
[2024-06-20 18:33:17,542 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-20 18:33:17,543 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-20 18:33:17,544 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-20 18:33:17,544 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-20 18:33:17,544 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:33:17" (1/1) ...
[2024-06-20 18:33:17,549 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-20 18:33:17,555 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-20 18:33:17,570 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 18:33:17,607 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 18:33:17,621 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-20 18:33:17,621 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-20 18:33:17,621 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-20 18:33:17,621 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-20 18:33:17,621 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-20 18:33:17,622 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-20 18:33:17,622 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-20 18:33:17,622 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-20 18:33:17,622 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-20 18:33:17,622 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-20 18:33:17,623 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-20 18:33:17,623 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-20 18:33:17,624 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 18:33:17,745 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-20 18:33:17,746 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-20 18:33:18,842 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-20 18:33:18,844 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-20 18:33:19,152 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-20 18:33:19,152 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-20 18:33:19,153 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 06:33:19 BoogieIcfgContainer
[2024-06-20 18:33:19,153 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-20 18:33:19,156 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-20 18:33:19,156 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-20 18:33:19,158 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-20 18:33:19,159 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 06:33:14" (1/4) ...
[2024-06-20 18:33:19,159 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5beeddf8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 06:33:19, skipping insertion in model container
[2024-06-20 18:33:19,159 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.06 06:33:16" (2/4) ...
[2024-06-20 18:33:19,160 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5beeddf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 06:33:19, skipping insertion in model container
[2024-06-20 18:33:19,160 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:33:17" (3/4) ...
[2024-06-20 18:33:19,160 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5beeddf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 06:33:19, skipping insertion in model container
[2024-06-20 18:33:19,161 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 06:33:19" (4/4) ...
[2024-06-20 18:33:19,161 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix016_power.opt_rmo.opt.i
[2024-06-20 18:33:19,175 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-20 18:33:19,175 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-20 18:33:19,176 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-20 18:33:19,296 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-20 18:33:19,326 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 94 flow
[2024-06-20 18:33:19,380 INFO  L124   PetriNetUnfolderBase]: 0/38 cut-off events.
[2024-06-20 18:33:19,381 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-20 18:33:19,382 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-20 18:33:19,382 INFO  L82        GeneralOperation]: Start removeDead. Operand has 51 places, 41 transitions, 94 flow
[2024-06-20 18:33:19,386 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow
[2024-06-20 18:33:19,398 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-20 18:33:19,405 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;@296dc3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-20 18:33:19,405 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-20 18:33:19,413 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-20 18:33:19,414 INFO  L124   PetriNetUnfolderBase]: 0/5 cut-off events.
[2024-06-20 18:33:19,414 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-20 18:33:19,414 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:33:19,415 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1]
[2024-06-20 18:33:19,415 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 18:33:19,421 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:33:19,422 INFO  L85        PathProgramCache]: Analyzing trace with hash 365436942, now seen corresponding path program 1 times
[2024-06-20 18:33:19,429 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:33:19,430 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959851394]
[2024-06-20 18:33:19,430 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:33:19,430 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:33:19,692 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:33:24,588 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:33:24,589 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:33:24,589 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959851394]
[2024-06-20 18:33:24,590 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959851394] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:33:24,590 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:33:24,590 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-20 18:33:24,591 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889174993]
[2024-06-20 18:33:24,592 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:33:24,598 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-20 18:33:24,601 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:33:24,618 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-20 18:33:24,618 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-20 18:33:24,682 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41
[2024-06-20 18:33:24,684 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand  has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 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 18:33:24,684 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:33:24,684 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41
[2024-06-20 18:33:24,685 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:33:25,323 INFO  L124   PetriNetUnfolderBase]: 946/1551 cut-off events.
[2024-06-20 18:33:25,323 INFO  L125   PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES.
[2024-06-20 18:33:25,328 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3057 conditions, 1551 events. 946/1551 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7745 event pairs, 638 based on Foata normal form. 1/1490 useless extension candidates. Maximal degree in co-relation 3045. Up to 1431 conditions per place. 
[2024-06-20 18:33:25,335 INFO  L140   encePairwiseOnDemand]: 34/41 looper letters, 30 selfloop transitions, 4 changer transitions 0/42 dead transitions.
[2024-06-20 18:33:25,335 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 167 flow
[2024-06-20 18:33:25,336 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-20 18:33:25,338 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-20 18:33:25,343 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions.
[2024-06-20 18:33:25,344 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6422764227642277
[2024-06-20 18:33:25,345 INFO  L175             Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 3 states and 79 transitions.
[2024-06-20 18:33:25,346 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 167 flow
[2024-06-20 18:33:25,348 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 162 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-20 18:33:25,349 INFO  L231             Difference]: Finished difference. Result has 42 places, 35 transitions, 100 flow
[2024-06-20 18:33:25,350 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=42, PETRI_TRANSITIONS=35}
[2024-06-20 18:33:25,353 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places.
[2024-06-20 18:33:25,353 INFO  L495      AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 100 flow
[2024-06-20 18:33:25,353 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 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 18:33:25,353 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:33:25,353 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:33:25,354 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-20 18:33:25,354 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 18:33:25,354 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:33:25,354 INFO  L85        PathProgramCache]: Analyzing trace with hash -1002400659, now seen corresponding path program 1 times
[2024-06-20 18:33:25,355 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:33:25,355 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607338760]
[2024-06-20 18:33:25,355 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:33:25,355 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:33:25,418 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:33:29,685 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 18:33:29,685 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:33:29,685 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607338760]
[2024-06-20 18:33:29,686 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607338760] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:33:29,686 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:33:29,686 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-20 18:33:29,686 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109989157]
[2024-06-20 18:33:29,686 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:33:29,687 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-20 18:33:29,688 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:33:29,688 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-20 18:33:29,688 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-06-20 18:33:29,773 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41
[2024-06-20 18:33:29,773 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 100 flow. Second operand  has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 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 18:33:29,773 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:33:29,773 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41
[2024-06-20 18:33:29,773 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:33:30,509 INFO  L124   PetriNetUnfolderBase]: 1110/1752 cut-off events.
[2024-06-20 18:33:30,509 INFO  L125   PetriNetUnfolderBase]: For 339/339 co-relation queries the response was YES.
[2024-06-20 18:33:30,513 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3973 conditions, 1752 events. 1110/1752 cut-off events. For 339/339 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8522 event pairs, 641 based on Foata normal form. 3/1752 useless extension candidates. Maximal degree in co-relation 3961. Up to 1652 conditions per place. 
[2024-06-20 18:33:30,520 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 38 selfloop transitions, 7 changer transitions 0/52 dead transitions.
[2024-06-20 18:33:30,520 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 236 flow
[2024-06-20 18:33:30,521 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-20 18:33:30,522 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-20 18:33:30,524 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions.
[2024-06-20 18:33:30,524 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6097560975609756
[2024-06-20 18:33:30,524 INFO  L175             Difference]: Start difference. First operand has 42 places, 35 transitions, 100 flow. Second operand 4 states and 100 transitions.
[2024-06-20 18:33:30,524 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 236 flow
[2024-06-20 18:33:30,525 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 232 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-20 18:33:30,528 INFO  L231             Difference]: Finished difference. Result has 45 places, 38 transitions, 136 flow
[2024-06-20 18:33:30,528 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=45, PETRI_TRANSITIONS=38}
[2024-06-20 18:33:30,528 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places.
[2024-06-20 18:33:30,529 INFO  L495      AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 136 flow
[2024-06-20 18:33:30,529 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 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 18:33:30,529 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:33:30,530 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:33:30,532 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-20 18:33:30,532 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 18:33:30,532 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:33:30,533 INFO  L85        PathProgramCache]: Analyzing trace with hash -1009648785, now seen corresponding path program 1 times
[2024-06-20 18:33:30,533 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:33:30,538 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026450521]
[2024-06-20 18:33:30,538 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:33:30,538 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:33:30,658 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:33:35,047 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 18:33:35,047 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:33:35,047 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026450521]
[2024-06-20 18:33:35,048 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026450521] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:33:35,048 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:33:35,048 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-20 18:33:35,048 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269376122]
[2024-06-20 18:33:35,048 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:33:35,048 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-20 18:33:35,049 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:33:35,049 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-20 18:33:35,049 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2024-06-20 18:33:35,193 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41
[2024-06-20 18:33:35,193 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 136 flow. Second operand  has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:33:35,193 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:33:35,193 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41
[2024-06-20 18:33:35,193 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:33:35,992 INFO  L124   PetriNetUnfolderBase]: 1104/1745 cut-off events.
[2024-06-20 18:33:35,992 INFO  L125   PetriNetUnfolderBase]: For 954/954 co-relation queries the response was YES.
[2024-06-20 18:33:35,996 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4419 conditions, 1745 events. 1104/1745 cut-off events. For 954/954 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8500 event pairs, 517 based on Foata normal form. 3/1745 useless extension candidates. Maximal degree in co-relation 4405. Up to 1628 conditions per place. 
[2024-06-20 18:33:36,004 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 45 selfloop transitions, 10 changer transitions 0/62 dead transitions.
[2024-06-20 18:33:36,004 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 62 transitions, 314 flow
[2024-06-20 18:33:36,005 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 18:33:36,005 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 18:33:36,006 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions.
[2024-06-20 18:33:36,006 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6
[2024-06-20 18:33:36,006 INFO  L175             Difference]: Start difference. First operand has 45 places, 38 transitions, 136 flow. Second operand 5 states and 123 transitions.
[2024-06-20 18:33:36,006 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 62 transitions, 314 flow
[2024-06-20 18:33:36,008 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 62 transitions, 300 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-06-20 18:33:36,009 INFO  L231             Difference]: Finished difference. Result has 48 places, 41 transitions, 172 flow
[2024-06-20 18:33:36,009 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=172, PETRI_PLACES=48, PETRI_TRANSITIONS=41}
[2024-06-20 18:33:36,010 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places.
[2024-06-20 18:33:36,010 INFO  L495      AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 172 flow
[2024-06-20 18:33:36,010 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:33:36,010 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:33:36,010 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:33:36,010 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-20 18:33:36,011 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 18:33:36,011 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:33:36,011 INFO  L85        PathProgramCache]: Analyzing trace with hash -471107276, now seen corresponding path program 1 times
[2024-06-20 18:33:36,011 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:33:36,011 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510852415]
[2024-06-20 18:33:36,012 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:33:36,012 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:33:36,082 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:33:41,187 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 18:33:41,189 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:33:41,192 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510852415]
[2024-06-20 18:33:41,192 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510852415] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:33:41,193 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:33:41,196 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-20 18:33:41,196 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657836297]
[2024-06-20 18:33:41,196 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:33:41,197 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-20 18:33:41,197 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:33:41,198 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-20 18:33:41,199 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-06-20 18:33:41,367 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41
[2024-06-20 18:33:41,367 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 172 flow. Second operand  has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 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 18:33:41,367 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:33:41,367 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41
[2024-06-20 18:33:41,367 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:33:42,360 INFO  L124   PetriNetUnfolderBase]: 1095/1728 cut-off events.
[2024-06-20 18:33:42,361 INFO  L125   PetriNetUnfolderBase]: For 1758/1758 co-relation queries the response was YES.
[2024-06-20 18:33:42,365 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4812 conditions, 1728 events. 1095/1728 cut-off events. For 1758/1758 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8424 event pairs, 375 based on Foata normal form. 6/1731 useless extension candidates. Maximal degree in co-relation 4797. Up to 1583 conditions per place. 
[2024-06-20 18:33:42,373 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 49 selfloop transitions, 12 changer transitions 0/68 dead transitions.
[2024-06-20 18:33:42,373 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 68 transitions, 368 flow
[2024-06-20 18:33:42,374 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 18:33:42,374 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 18:33:42,376 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions.
[2024-06-20 18:33:42,377 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5772357723577236
[2024-06-20 18:33:42,377 INFO  L175             Difference]: Start difference. First operand has 48 places, 41 transitions, 172 flow. Second operand 6 states and 142 transitions.
[2024-06-20 18:33:42,378 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 68 transitions, 368 flow
[2024-06-20 18:33:42,381 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 68 transitions, 344 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-06-20 18:33:42,383 INFO  L231             Difference]: Finished difference. Result has 50 places, 42 transitions, 191 flow
[2024-06-20 18:33:42,383 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=191, PETRI_PLACES=50, PETRI_TRANSITIONS=42}
[2024-06-20 18:33:42,384 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places.
[2024-06-20 18:33:42,385 INFO  L495      AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 191 flow
[2024-06-20 18:33:42,385 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 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 18:33:42,385 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:33:42,385 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:33:42,385 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-20 18:33:42,385 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 18:33:42,386 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:33:42,386 INFO  L85        PathProgramCache]: Analyzing trace with hash 292940758, now seen corresponding path program 1 times
[2024-06-20 18:33:42,386 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:33:42,386 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725289862]
[2024-06-20 18:33:42,386 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:33:42,387 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:33:42,441 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:33:49,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 18:33:49,562 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:33:49,562 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725289862]
[2024-06-20 18:33:49,562 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725289862] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:33:49,562 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:33:49,563 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-20 18:33:49,563 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823974643]
[2024-06-20 18:33:49,563 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:33:49,563 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-20 18:33:49,564 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:33:49,564 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-20 18:33:49,564 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-06-20 18:33:49,678 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41
[2024-06-20 18:33:49,678 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 191 flow. Second operand  has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 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 18:33:49,678 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:33:49,678 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41
[2024-06-20 18:33:49,678 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:33:50,329 INFO  L124   PetriNetUnfolderBase]: 920/1574 cut-off events.
[2024-06-20 18:33:50,329 INFO  L125   PetriNetUnfolderBase]: For 2263/2263 co-relation queries the response was YES.
[2024-06-20 18:33:50,334 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4511 conditions, 1574 events. 920/1574 cut-off events. For 2263/2263 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8157 event pairs, 378 based on Foata normal form. 2/1567 useless extension candidates. Maximal degree in co-relation 4494. Up to 1382 conditions per place. 
[2024-06-20 18:33:50,340 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 41 selfloop transitions, 8 changer transitions 0/56 dead transitions.
[2024-06-20 18:33:50,340 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 56 transitions, 333 flow
[2024-06-20 18:33:50,340 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 18:33:50,341 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 18:33:50,342 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions.
[2024-06-20 18:33:50,342 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5024390243902439
[2024-06-20 18:33:50,342 INFO  L175             Difference]: Start difference. First operand has 50 places, 42 transitions, 191 flow. Second operand 5 states and 103 transitions.
[2024-06-20 18:33:50,343 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 56 transitions, 333 flow
[2024-06-20 18:33:50,349 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 56 transitions, 300 flow, removed 6 selfloop flow, removed 4 redundant places.
[2024-06-20 18:33:50,350 INFO  L231             Difference]: Finished difference. Result has 51 places, 45 transitions, 204 flow
[2024-06-20 18:33:50,350 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=204, PETRI_PLACES=51, PETRI_TRANSITIONS=45}
[2024-06-20 18:33:50,352 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places.
[2024-06-20 18:33:50,352 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 204 flow
[2024-06-20 18:33:50,353 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 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 18:33:50,354 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:33:50,354 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:33:50,354 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-20 18:33:50,354 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 18:33:50,354 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:33:50,355 INFO  L85        PathProgramCache]: Analyzing trace with hash -1398131329, now seen corresponding path program 1 times
[2024-06-20 18:33:50,355 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:33:50,355 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755650241]
[2024-06-20 18:33:50,355 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:33:50,355 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:33:50,398 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:33:59,023 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 18:33:59,024 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:33:59,024 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755650241]
[2024-06-20 18:33:59,024 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755650241] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:33:59,024 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:33:59,024 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 18:33:59,024 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669915689]
[2024-06-20 18:33:59,024 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:33:59,024 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 18:33:59,024 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:33:59,025 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 18:33:59,025 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-20 18:33:59,166 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41
[2024-06-20 18:33:59,167 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 204 flow. Second operand  has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:33:59,167 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:33:59,167 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41
[2024-06-20 18:33:59,167 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:34:00,118 INFO  L124   PetriNetUnfolderBase]: 1112/1777 cut-off events.
[2024-06-20 18:34:00,118 INFO  L125   PetriNetUnfolderBase]: For 3805/3805 co-relation queries the response was YES.
[2024-06-20 18:34:00,121 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5607 conditions, 1777 events. 1112/1777 cut-off events. For 3805/3805 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8721 event pairs, 448 based on Foata normal form. 4/1778 useless extension candidates. Maximal degree in co-relation 5588. Up to 1635 conditions per place. 
[2024-06-20 18:34:00,127 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 50 selfloop transitions, 11 changer transitions 0/67 dead transitions.
[2024-06-20 18:34:00,127 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 67 transitions, 396 flow
[2024-06-20 18:34:00,127 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 18:34:00,127 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 18:34:00,128 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions.
[2024-06-20 18:34:00,128 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.491869918699187
[2024-06-20 18:34:00,128 INFO  L175             Difference]: Start difference. First operand has 51 places, 45 transitions, 204 flow. Second operand 6 states and 121 transitions.
[2024-06-20 18:34:00,128 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 67 transitions, 396 flow
[2024-06-20 18:34:00,131 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 67 transitions, 374 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-06-20 18:34:00,131 INFO  L231             Difference]: Finished difference. Result has 54 places, 48 transitions, 238 flow
[2024-06-20 18:34:00,132 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=54, PETRI_TRANSITIONS=48}
[2024-06-20 18:34:00,134 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places.
[2024-06-20 18:34:00,134 INFO  L495      AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 238 flow
[2024-06-20 18:34:00,134 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:34:00,135 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:34:00,135 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:34:00,135 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-20 18:34:00,135 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 18:34:00,135 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:34:00,136 INFO  L85        PathProgramCache]: Analyzing trace with hash -1951734667, now seen corresponding path program 2 times
[2024-06-20 18:34:00,136 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:34:00,139 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820536450]
[2024-06-20 18:34:00,139 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:34:00,139 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:34:00,175 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:34:07,707 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 18:34:07,707 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:34:07,708 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820536450]
[2024-06-20 18:34:07,708 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820536450] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:34:07,708 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:34:07,708 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 18:34:07,724 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580057129]
[2024-06-20 18:34:07,724 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:34:07,725 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 18:34:07,725 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:34:07,725 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 18:34:07,725 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-20 18:34:07,897 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41
[2024-06-20 18:34:07,897 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 238 flow. Second operand  has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:34:07,898 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:34:07,898 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41
[2024-06-20 18:34:07,898 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:34:08,640 INFO  L124   PetriNetUnfolderBase]: 1118/1802 cut-off events.
[2024-06-20 18:34:08,640 INFO  L125   PetriNetUnfolderBase]: For 5239/5251 co-relation queries the response was YES.
[2024-06-20 18:34:08,644 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6111 conditions, 1802 events. 1118/1802 cut-off events. For 5239/5251 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8924 event pairs, 449 based on Foata normal form. 12/1809 useless extension candidates. Maximal degree in co-relation 6091. Up to 1617 conditions per place. 
[2024-06-20 18:34:08,651 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 46 selfloop transitions, 16 changer transitions 0/68 dead transitions.
[2024-06-20 18:34:08,651 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 68 transitions, 434 flow
[2024-06-20 18:34:08,652 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 18:34:08,652 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 18:34:08,652 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions.
[2024-06-20 18:34:08,652 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.491869918699187
[2024-06-20 18:34:08,653 INFO  L175             Difference]: Start difference. First operand has 54 places, 48 transitions, 238 flow. Second operand 6 states and 121 transitions.
[2024-06-20 18:34:08,653 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 68 transitions, 434 flow
[2024-06-20 18:34:08,654 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 68 transitions, 404 flow, removed 6 selfloop flow, removed 4 redundant places.
[2024-06-20 18:34:08,655 INFO  L231             Difference]: Finished difference. Result has 56 places, 51 transitions, 280 flow
[2024-06-20 18:34:08,656 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=280, PETRI_PLACES=56, PETRI_TRANSITIONS=51}
[2024-06-20 18:34:08,656 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places.
[2024-06-20 18:34:08,656 INFO  L495      AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 280 flow
[2024-06-20 18:34:08,656 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:34:08,656 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:34:08,657 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:34:08,657 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-20 18:34:08,657 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 18:34:08,657 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:34:08,657 INFO  L85        PathProgramCache]: Analyzing trace with hash -1951726731, now seen corresponding path program 1 times
[2024-06-20 18:34:08,657 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:34:08,657 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149976002]
[2024-06-20 18:34:08,658 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:34:08,658 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:34:08,690 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:34:17,280 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 18:34:17,281 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:34:17,281 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149976002]
[2024-06-20 18:34:17,281 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149976002] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:34:17,281 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:34:17,281 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 18:34:17,281 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570266445]
[2024-06-20 18:34:17,281 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:34:17,281 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 18:34:17,281 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:34:17,282 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 18:34:17,282 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-20 18:34:17,505 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41
[2024-06-20 18:34:17,505 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 280 flow. Second operand  has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:34:17,505 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:34:17,505 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41
[2024-06-20 18:34:17,505 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:34:18,460 INFO  L124   PetriNetUnfolderBase]: 1172/1960 cut-off events.
[2024-06-20 18:34:18,460 INFO  L125   PetriNetUnfolderBase]: For 6654/6654 co-relation queries the response was YES.
[2024-06-20 18:34:18,465 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6840 conditions, 1960 events. 1172/1960 cut-off events. For 6654/6654 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 10114 event pairs, 444 based on Foata normal form. 2/1949 useless extension candidates. Maximal degree in co-relation 6819. Up to 1733 conditions per place. 
[2024-06-20 18:34:18,475 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 56 selfloop transitions, 14 changer transitions 0/76 dead transitions.
[2024-06-20 18:34:18,475 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 76 transitions, 507 flow
[2024-06-20 18:34:18,476 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 18:34:18,476 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 18:34:18,476 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions.
[2024-06-20 18:34:18,477 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47038327526132406
[2024-06-20 18:34:18,477 INFO  L175             Difference]: Start difference. First operand has 56 places, 51 transitions, 280 flow. Second operand 7 states and 135 transitions.
[2024-06-20 18:34:18,477 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 76 transitions, 507 flow
[2024-06-20 18:34:18,481 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 76 transitions, 458 flow, removed 9 selfloop flow, removed 4 redundant places.
[2024-06-20 18:34:18,482 INFO  L231             Difference]: Finished difference. Result has 60 places, 57 transitions, 318 flow
[2024-06-20 18:34:18,482 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=318, PETRI_PLACES=60, PETRI_TRANSITIONS=57}
[2024-06-20 18:34:18,483 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places.
[2024-06-20 18:34:18,483 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 57 transitions, 318 flow
[2024-06-20 18:34:18,483 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:34:18,483 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:34:18,483 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:34:18,483 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-20 18:34:18,484 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 18:34:18,484 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:34:18,484 INFO  L85        PathProgramCache]: Analyzing trace with hash -392516947, now seen corresponding path program 1 times
[2024-06-20 18:34:18,484 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:34:18,484 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500703343]
[2024-06-20 18:34:18,484 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:34:18,485 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:34:18,570 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:34:27,051 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 18:34:27,051 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:34:27,052 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500703343]
[2024-06-20 18:34:27,052 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500703343] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:34:27,052 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:34:27,052 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 18:34:27,052 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595176008]
[2024-06-20 18:34:27,052 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:34:27,052 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 18:34:27,053 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:34:27,053 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 18:34:27,054 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 18:34:27,197 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41
[2024-06-20 18:34:27,198 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 57 transitions, 318 flow. Second operand  has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:34:27,198 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:34:27,198 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41
[2024-06-20 18:34:27,198 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:34:28,164 INFO  L124   PetriNetUnfolderBase]: 1272/2034 cut-off events.
[2024-06-20 18:34:28,165 INFO  L125   PetriNetUnfolderBase]: For 9226/9226 co-relation queries the response was YES.
[2024-06-20 18:34:28,168 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7822 conditions, 2034 events. 1272/2034 cut-off events. For 9226/9226 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 10193 event pairs, 478 based on Foata normal form. 2/2023 useless extension candidates. Maximal degree in co-relation 7799. Up to 1861 conditions per place. 
[2024-06-20 18:34:28,179 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 64 selfloop transitions, 14 changer transitions 0/85 dead transitions.
[2024-06-20 18:34:28,179 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 85 transitions, 572 flow
[2024-06-20 18:34:28,179 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 18:34:28,179 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 18:34:28,180 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions.
[2024-06-20 18:34:28,180 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4912891986062718
[2024-06-20 18:34:28,180 INFO  L175             Difference]: Start difference. First operand has 60 places, 57 transitions, 318 flow. Second operand 7 states and 141 transitions.
[2024-06-20 18:34:28,180 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 85 transitions, 572 flow
[2024-06-20 18:34:28,183 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 85 transitions, 532 flow, removed 9 selfloop flow, removed 4 redundant places.
[2024-06-20 18:34:28,187 INFO  L231             Difference]: Finished difference. Result has 63 places, 60 transitions, 354 flow
[2024-06-20 18:34:28,188 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=354, PETRI_PLACES=63, PETRI_TRANSITIONS=60}
[2024-06-20 18:34:28,188 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places.
[2024-06-20 18:34:28,189 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 60 transitions, 354 flow
[2024-06-20 18:34:28,189 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:34:28,189 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:34:28,189 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:34:28,189 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-20 18:34:28,189 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 18:34:28,190 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:34:28,190 INFO  L85        PathProgramCache]: Analyzing trace with hash -373985007, now seen corresponding path program 1 times
[2024-06-20 18:34:28,192 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:34:28,193 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802771734]
[2024-06-20 18:34:28,193 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:34:28,193 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:34:28,233 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:34:37,077 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 18:34:37,078 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:34:37,078 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802771734]
[2024-06-20 18:34:37,078 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802771734] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:34:37,078 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:34:37,078 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 18:34:37,078 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768610828]
[2024-06-20 18:34:37,078 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:34:37,079 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 18:34:37,079 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:34:37,079 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 18:34:37,079 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-20 18:34:37,409 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41
[2024-06-20 18:34:37,409 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 60 transitions, 354 flow. Second operand  has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 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 18:34:37,410 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:34:37,410 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41
[2024-06-20 18:34:37,410 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:34:38,338 INFO  L124   PetriNetUnfolderBase]: 1154/1921 cut-off events.
[2024-06-20 18:34:38,338 INFO  L125   PetriNetUnfolderBase]: For 9892/9892 co-relation queries the response was YES.
[2024-06-20 18:34:38,342 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7442 conditions, 1921 events. 1154/1921 cut-off events. For 9892/9892 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 9798 event pairs, 410 based on Foata normal form. 4/1908 useless extension candidates. Maximal degree in co-relation 7418. Up to 1689 conditions per place. 
[2024-06-20 18:34:38,347 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 64 selfloop transitions, 16 changer transitions 0/86 dead transitions.
[2024-06-20 18:34:38,348 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 86 transitions, 602 flow
[2024-06-20 18:34:38,348 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 18:34:38,348 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 18:34:38,350 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions.
[2024-06-20 18:34:38,350 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46646341463414637
[2024-06-20 18:34:38,350 INFO  L175             Difference]: Start difference. First operand has 63 places, 60 transitions, 354 flow. Second operand 8 states and 153 transitions.
[2024-06-20 18:34:38,350 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 86 transitions, 602 flow
[2024-06-20 18:34:38,355 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 86 transitions, 550 flow, removed 14 selfloop flow, removed 5 redundant places.
[2024-06-20 18:34:38,356 INFO  L231             Difference]: Finished difference. Result has 66 places, 62 transitions, 373 flow
[2024-06-20 18:34:38,356 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=373, PETRI_PLACES=66, PETRI_TRANSITIONS=62}
[2024-06-20 18:34:38,357 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places.
[2024-06-20 18:34:38,357 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 62 transitions, 373 flow
[2024-06-20 18:34:38,357 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 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 18:34:38,357 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:34:38,357 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:34:38,357 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-20 18:34:38,357 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:34:38,358 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:34:38,358 INFO  L85        PathProgramCache]: Analyzing trace with hash -1304265577, now seen corresponding path program 1 times
[2024-06-20 18:34:38,358 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:34:38,358 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28968418]
[2024-06-20 18:34:38,358 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:34:38,358 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:34:38,387 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:34:49,432 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:34:49,433 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:34:49,433 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28968418]
[2024-06-20 18:34:49,433 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28968418] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:34:49,433 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:34:49,433 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-20 18:34:49,433 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479401761]
[2024-06-20 18:34:49,433 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:34:49,433 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-20 18:34:49,434 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:34:49,436 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-20 18:34:49,436 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-06-20 18:34:49,581 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:34:49,581 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 62 transitions, 373 flow. Second operand  has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 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 18:34:49,581 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:34:49,581 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:34:49,582 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:34:50,399 INFO  L124   PetriNetUnfolderBase]: 1358/2138 cut-off events.
[2024-06-20 18:34:50,400 INFO  L125   PetriNetUnfolderBase]: For 13649/13649 co-relation queries the response was YES.
[2024-06-20 18:34:50,404 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8762 conditions, 2138 events. 1358/2138 cut-off events. For 13649/13649 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10455 event pairs, 514 based on Foata normal form. 1/2136 useless extension candidates. Maximal degree in co-relation 8737. Up to 2024 conditions per place. 
[2024-06-20 18:34:50,412 INFO  L140   encePairwiseOnDemand]: 34/41 looper letters, 60 selfloop transitions, 8 changer transitions 0/73 dead transitions.
[2024-06-20 18:34:50,412 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 73 transitions, 551 flow
[2024-06-20 18:34:50,412 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 18:34:50,413 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 18:34:50,413 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions.
[2024-06-20 18:34:50,413 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44390243902439025
[2024-06-20 18:34:50,413 INFO  L175             Difference]: Start difference. First operand has 66 places, 62 transitions, 373 flow. Second operand 5 states and 91 transitions.
[2024-06-20 18:34:50,413 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 73 transitions, 551 flow
[2024-06-20 18:34:50,452 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 73 transitions, 498 flow, removed 12 selfloop flow, removed 6 redundant places.
[2024-06-20 18:34:50,454 INFO  L231             Difference]: Finished difference. Result has 65 places, 65 transitions, 370 flow
[2024-06-20 18:34:50,454 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=370, PETRI_PLACES=65, PETRI_TRANSITIONS=65}
[2024-06-20 18:34:50,454 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 23 predicate places.
[2024-06-20 18:34:50,454 INFO  L495      AbstractCegarLoop]: Abstraction has has 65 places, 65 transitions, 370 flow
[2024-06-20 18:34:50,454 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 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 18:34:50,454 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:34:50,454 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:34:50,455 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-20 18:34:50,455 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 18:34:50,455 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:34:50,455 INFO  L85        PathProgramCache]: Analyzing trace with hash 720602846, now seen corresponding path program 1 times
[2024-06-20 18:34:50,455 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:34:50,455 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563328937]
[2024-06-20 18:34:50,455 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:34:50,455 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:34:50,506 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:34:58,418 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 18:34:58,419 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:34:58,419 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563328937]
[2024-06-20 18:34:58,419 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563328937] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:34:58,419 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:34:58,419 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 18:34:58,419 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365740702]
[2024-06-20 18:34:58,419 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:34:58,419 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 18:34:58,419 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:34:58,420 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 18:34:58,420 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 18:34:58,634 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:34:58,634 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 65 transitions, 370 flow. Second operand  has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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 18:34:58,634 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:34:58,634 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:34:58,634 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:34:59,592 INFO  L124   PetriNetUnfolderBase]: 1449/2248 cut-off events.
[2024-06-20 18:34:59,592 INFO  L125   PetriNetUnfolderBase]: For 18465/18465 co-relation queries the response was YES.
[2024-06-20 18:34:59,597 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9842 conditions, 2248 events. 1449/2248 cut-off events. For 18465/18465 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10924 event pairs, 509 based on Foata normal form. 2/2247 useless extension candidates. Maximal degree in co-relation 9816. Up to 2082 conditions per place. 
[2024-06-20 18:34:59,605 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 77 selfloop transitions, 17 changer transitions 0/100 dead transitions.
[2024-06-20 18:34:59,605 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 100 transitions, 682 flow
[2024-06-20 18:34:59,607 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 18:34:59,607 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 18:34:59,607 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions.
[2024-06-20 18:34:59,607 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45426829268292684
[2024-06-20 18:34:59,608 INFO  L175             Difference]: Start difference. First operand has 65 places, 65 transitions, 370 flow. Second operand 8 states and 149 transitions.
[2024-06-20 18:34:59,608 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 100 transitions, 682 flow
[2024-06-20 18:34:59,614 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 100 transitions, 654 flow, removed 8 selfloop flow, removed 3 redundant places.
[2024-06-20 18:34:59,615 INFO  L231             Difference]: Finished difference. Result has 72 places, 74 transitions, 462 flow
[2024-06-20 18:34:59,615 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=462, PETRI_PLACES=72, PETRI_TRANSITIONS=74}
[2024-06-20 18:34:59,615 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 30 predicate places.
[2024-06-20 18:34:59,615 INFO  L495      AbstractCegarLoop]: Abstraction has has 72 places, 74 transitions, 462 flow
[2024-06-20 18:34:59,616 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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 18:34:59,616 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:34:59,616 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:34:59,616 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-20 18:34:59,616 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:34:59,616 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:34:59,617 INFO  L85        PathProgramCache]: Analyzing trace with hash -1330130658, now seen corresponding path program 2 times
[2024-06-20 18:34:59,617 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:34:59,617 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753533212]
[2024-06-20 18:34:59,617 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:34:59,617 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:34:59,647 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:35:08,207 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 18:35:08,207 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:35:08,207 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753533212]
[2024-06-20 18:35:08,207 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753533212] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:35:08,207 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:35:08,207 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 18:35:08,207 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894807376]
[2024-06-20 18:35:08,208 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:35:08,208 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 18:35:08,208 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:35:08,208 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 18:35:08,208 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 18:35:08,411 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:35:08,412 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 74 transitions, 462 flow. Second operand  has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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 18:35:08,413 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:35:08,413 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:35:08,413 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:35:09,361 INFO  L124   PetriNetUnfolderBase]: 1471/2282 cut-off events.
[2024-06-20 18:35:09,362 INFO  L125   PetriNetUnfolderBase]: For 21759/21771 co-relation queries the response was YES.
[2024-06-20 18:35:09,367 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10653 conditions, 2282 events. 1471/2282 cut-off events. For 21759/21771 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 11086 event pairs, 516 based on Foata normal form. 10/2287 useless extension candidates. Maximal degree in co-relation 10624. Up to 2069 conditions per place. 
[2024-06-20 18:35:09,374 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 73 selfloop transitions, 30 changer transitions 0/109 dead transitions.
[2024-06-20 18:35:09,375 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 109 transitions, 812 flow
[2024-06-20 18:35:09,392 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 18:35:09,392 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 18:35:09,393 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions.
[2024-06-20 18:35:09,393 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45426829268292684
[2024-06-20 18:35:09,393 INFO  L175             Difference]: Start difference. First operand has 72 places, 74 transitions, 462 flow. Second operand 8 states and 149 transitions.
[2024-06-20 18:35:09,394 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 109 transitions, 812 flow
[2024-06-20 18:35:09,402 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 109 transitions, 768 flow, removed 17 selfloop flow, removed 3 redundant places.
[2024-06-20 18:35:09,404 INFO  L231             Difference]: Finished difference. Result has 78 places, 86 transitions, 594 flow
[2024-06-20 18:35:09,404 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=594, PETRI_PLACES=78, PETRI_TRANSITIONS=86}
[2024-06-20 18:35:09,405 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 36 predicate places.
[2024-06-20 18:35:09,405 INFO  L495      AbstractCegarLoop]: Abstraction has has 78 places, 86 transitions, 594 flow
[2024-06-20 18:35:09,405 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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 18:35:09,405 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:35:09,405 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:35:09,406 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-20 18:35:09,406 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 18:35:09,406 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:35:09,407 INFO  L85        PathProgramCache]: Analyzing trace with hash 1291358292, now seen corresponding path program 3 times
[2024-06-20 18:35:09,407 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:35:09,407 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158888098]
[2024-06-20 18:35:09,407 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:35:09,407 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:35:09,443 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:35:18,708 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 18:35:18,708 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:35:18,708 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158888098]
[2024-06-20 18:35:18,708 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158888098] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:35:18,708 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:35:18,708 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 18:35:18,708 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589807135]
[2024-06-20 18:35:18,708 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:35:18,708 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 18:35:18,709 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:35:18,709 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 18:35:18,709 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 18:35:18,972 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:35:18,972 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 86 transitions, 594 flow. Second operand  has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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 18:35:18,972 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:35:18,972 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:35:18,972 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:35:20,050 INFO  L124   PetriNetUnfolderBase]: 1520/2353 cut-off events.
[2024-06-20 18:35:20,051 INFO  L125   PetriNetUnfolderBase]: For 26240/26252 co-relation queries the response was YES.
[2024-06-20 18:35:20,056 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11744 conditions, 2353 events. 1520/2353 cut-off events. For 26240/26252 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 11436 event pairs, 516 based on Foata normal form. 12/2360 useless extension candidates. Maximal degree in co-relation 11712. Up to 2022 conditions per place. 
[2024-06-20 18:35:20,064 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 72 selfloop transitions, 53 changer transitions 0/131 dead transitions.
[2024-06-20 18:35:20,064 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 131 transitions, 1120 flow
[2024-06-20 18:35:20,064 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 18:35:20,064 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 18:35:20,065 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions.
[2024-06-20 18:35:20,065 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4715447154471545
[2024-06-20 18:35:20,065 INFO  L175             Difference]: Start difference. First operand has 78 places, 86 transitions, 594 flow. Second operand 9 states and 174 transitions.
[2024-06-20 18:35:20,065 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 131 transitions, 1120 flow
[2024-06-20 18:35:20,074 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 131 transitions, 1056 flow, removed 28 selfloop flow, removed 2 redundant places.
[2024-06-20 18:35:20,075 INFO  L231             Difference]: Finished difference. Result has 86 places, 102 transitions, 827 flow
[2024-06-20 18:35:20,075 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=827, PETRI_PLACES=86, PETRI_TRANSITIONS=102}
[2024-06-20 18:35:20,076 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 44 predicate places.
[2024-06-20 18:35:20,076 INFO  L495      AbstractCegarLoop]: Abstraction has has 86 places, 102 transitions, 827 flow
[2024-06-20 18:35:20,076 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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 18:35:20,076 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:35:20,076 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:35:20,076 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-20 18:35:20,076 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 18:35:20,077 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:35:20,077 INFO  L85        PathProgramCache]: Analyzing trace with hash 864493376, now seen corresponding path program 4 times
[2024-06-20 18:35:20,077 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:35:20,077 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346264970]
[2024-06-20 18:35:20,077 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:35:20,077 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:35:20,119 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:35:27,313 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 18:35:27,314 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:35:27,314 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346264970]
[2024-06-20 18:35:27,314 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346264970] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:35:27,314 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:35:27,314 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 18:35:27,314 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391483266]
[2024-06-20 18:35:27,314 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:35:27,315 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 18:35:27,315 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:35:27,315 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 18:35:27,315 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 18:35:27,431 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:35:27,431 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 102 transitions, 827 flow. Second operand  has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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 18:35:27,431 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:35:27,431 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:35:27,431 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:35:28,442 INFO  L124   PetriNetUnfolderBase]: 1526/2367 cut-off events.
[2024-06-20 18:35:28,442 INFO  L125   PetriNetUnfolderBase]: For 30156/30168 co-relation queries the response was YES.
[2024-06-20 18:35:28,448 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12487 conditions, 2367 events. 1526/2367 cut-off events. For 30156/30168 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 11519 event pairs, 516 based on Foata normal form. 12/2374 useless extension candidates. Maximal degree in co-relation 12452. Up to 2085 conditions per place. 
[2024-06-20 18:35:28,457 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 84 selfloop transitions, 39 changer transitions 0/129 dead transitions.
[2024-06-20 18:35:28,457 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 129 transitions, 1188 flow
[2024-06-20 18:35:28,459 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 18:35:28,459 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 18:35:28,459 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions.
[2024-06-20 18:35:28,460 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4695121951219512
[2024-06-20 18:35:28,460 INFO  L175             Difference]: Start difference. First operand has 86 places, 102 transitions, 827 flow. Second operand 8 states and 154 transitions.
[2024-06-20 18:35:28,460 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 129 transitions, 1188 flow
[2024-06-20 18:35:28,477 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 129 transitions, 1128 flow, removed 26 selfloop flow, removed 2 redundant places.
[2024-06-20 18:35:28,500 INFO  L231             Difference]: Finished difference. Result has 93 places, 106 transitions, 932 flow
[2024-06-20 18:35:28,500 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=932, PETRI_PLACES=93, PETRI_TRANSITIONS=106}
[2024-06-20 18:35:28,502 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 51 predicate places.
[2024-06-20 18:35:28,502 INFO  L495      AbstractCegarLoop]: Abstraction has has 93 places, 106 transitions, 932 flow
[2024-06-20 18:35:28,502 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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 18:35:28,502 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:35:28,502 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:35:28,502 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-20 18:35:28,503 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:35:28,503 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:35:28,503 INFO  L85        PathProgramCache]: Analyzing trace with hash -1777525919, now seen corresponding path program 1 times
[2024-06-20 18:35:28,503 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:35:28,503 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294283682]
[2024-06-20 18:35:28,503 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:35:28,503 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:35:28,552 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:35:41,146 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:35:41,146 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:35:41,146 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294283682]
[2024-06-20 18:35:41,146 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294283682] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:35:41,146 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:35:41,146 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 18:35:41,146 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944236530]
[2024-06-20 18:35:41,146 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:35:41,146 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 18:35:41,147 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:35:41,147 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 18:35:41,147 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-20 18:35:41,276 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:35:41,277 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 106 transitions, 932 flow. Second operand  has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 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 18:35:41,277 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:35:41,277 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:35:41,277 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:35:42,251 INFO  L124   PetriNetUnfolderBase]: 1440/2262 cut-off events.
[2024-06-20 18:35:42,251 INFO  L125   PetriNetUnfolderBase]: For 26581/26581 co-relation queries the response was YES.
[2024-06-20 18:35:42,257 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11612 conditions, 2262 events. 1440/2262 cut-off events. For 26581/26581 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 11039 event pairs, 474 based on Foata normal form. 2/2261 useless extension candidates. Maximal degree in co-relation 11574. Up to 2138 conditions per place. 
[2024-06-20 18:35:42,264 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 103 selfloop transitions, 11 changer transitions 0/119 dead transitions.
[2024-06-20 18:35:42,264 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 119 transitions, 1210 flow
[2024-06-20 18:35:42,264 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 18:35:42,264 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 18:35:42,265 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions.
[2024-06-20 18:35:42,265 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43089430894308944
[2024-06-20 18:35:42,265 INFO  L175             Difference]: Start difference. First operand has 93 places, 106 transitions, 932 flow. Second operand 6 states and 106 transitions.
[2024-06-20 18:35:42,265 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 119 transitions, 1210 flow
[2024-06-20 18:35:42,279 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 119 transitions, 1088 flow, removed 23 selfloop flow, removed 7 redundant places.
[2024-06-20 18:35:42,281 INFO  L231             Difference]: Finished difference. Result has 92 places, 109 transitions, 870 flow
[2024-06-20 18:35:42,281 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=870, PETRI_PLACES=92, PETRI_TRANSITIONS=109}
[2024-06-20 18:35:42,281 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 50 predicate places.
[2024-06-20 18:35:42,282 INFO  L495      AbstractCegarLoop]: Abstraction has has 92 places, 109 transitions, 870 flow
[2024-06-20 18:35:42,282 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 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 18:35:42,282 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:35:42,282 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:35:42,282 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-20 18:35:42,282 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 18:35:42,283 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:35:42,283 INFO  L85        PathProgramCache]: Analyzing trace with hash -1696771466, now seen corresponding path program 1 times
[2024-06-20 18:35:42,283 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:35:42,283 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020322433]
[2024-06-20 18:35:42,283 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:35:42,283 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:35:42,336 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:35:50,467 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 18:35:50,468 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:35:50,468 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020322433]
[2024-06-20 18:35:50,468 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020322433] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:35:50,468 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:35:50,468 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 18:35:50,468 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654175520]
[2024-06-20 18:35:50,469 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:35:50,469 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 18:35:50,469 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:35:50,469 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 18:35:50,469 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 18:35:50,683 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41
[2024-06-20 18:35:50,684 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 109 transitions, 870 flow. Second operand  has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 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 18:35:50,684 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:35:50,684 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41
[2024-06-20 18:35:50,684 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:35:51,891 INFO  L124   PetriNetUnfolderBase]: 1482/2326 cut-off events.
[2024-06-20 18:35:51,892 INFO  L125   PetriNetUnfolderBase]: For 34507/34507 co-relation queries the response was YES.
[2024-06-20 18:35:51,897 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12796 conditions, 2326 events. 1482/2326 cut-off events. For 34507/34507 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11764 event pairs, 327 based on Foata normal form. 4/2321 useless extension candidates. Maximal degree in co-relation 12759. Up to 2082 conditions per place. 
[2024-06-20 18:35:51,904 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 115 selfloop transitions, 15 changer transitions 0/142 dead transitions.
[2024-06-20 18:35:51,904 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 142 transitions, 1246 flow
[2024-06-20 18:35:51,906 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 18:35:51,906 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 18:35:51,907 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions.
[2024-06-20 18:35:51,907 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4847560975609756
[2024-06-20 18:35:51,907 INFO  L175             Difference]: Start difference. First operand has 92 places, 109 transitions, 870 flow. Second operand 8 states and 159 transitions.
[2024-06-20 18:35:51,907 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 142 transitions, 1246 flow
[2024-06-20 18:35:51,917 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 142 transitions, 1208 flow, removed 10 selfloop flow, removed 4 redundant places.
[2024-06-20 18:35:51,919 INFO  L231             Difference]: Finished difference. Result has 96 places, 111 transitions, 911 flow
[2024-06-20 18:35:51,919 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=832, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=911, PETRI_PLACES=96, PETRI_TRANSITIONS=111}
[2024-06-20 18:35:51,920 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 54 predicate places.
[2024-06-20 18:35:51,920 INFO  L495      AbstractCegarLoop]: Abstraction has has 96 places, 111 transitions, 911 flow
[2024-06-20 18:35:51,920 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 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 18:35:51,920 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:35:51,920 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:35:51,920 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-20 18:35:51,920 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 18:35:51,921 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:35:51,921 INFO  L85        PathProgramCache]: Analyzing trace with hash -1693914506, now seen corresponding path program 2 times
[2024-06-20 18:35:51,921 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:35:51,921 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246397246]
[2024-06-20 18:35:51,921 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:35:51,921 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:35:51,973 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:36:00,636 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 18:36:00,637 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:36:00,637 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246397246]
[2024-06-20 18:36:00,637 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246397246] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:36:00,637 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:36:00,637 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 18:36:00,637 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16431805]
[2024-06-20 18:36:00,637 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:36:00,637 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 18:36:00,637 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:36:00,638 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 18:36:00,638 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 18:36:00,802 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41
[2024-06-20 18:36:00,803 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 111 transitions, 911 flow. Second operand  has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 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 18:36:00,803 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:36:00,803 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41
[2024-06-20 18:36:00,803 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:36:01,886 INFO  L124   PetriNetUnfolderBase]: 1474/2327 cut-off events.
[2024-06-20 18:36:01,886 INFO  L125   PetriNetUnfolderBase]: For 37947/37947 co-relation queries the response was YES.
[2024-06-20 18:36:01,893 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13088 conditions, 2327 events. 1474/2327 cut-off events. For 37947/37947 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 11794 event pairs, 424 based on Foata normal form. 4/2321 useless extension candidates. Maximal degree in co-relation 13050. Up to 2096 conditions per place. 
[2024-06-20 18:36:01,901 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 115 selfloop transitions, 16 changer transitions 0/143 dead transitions.
[2024-06-20 18:36:01,901 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 143 transitions, 1291 flow
[2024-06-20 18:36:01,903 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 18:36:01,903 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 18:36:01,903 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions.
[2024-06-20 18:36:01,904 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4847560975609756
[2024-06-20 18:36:01,904 INFO  L175             Difference]: Start difference. First operand has 96 places, 111 transitions, 911 flow. Second operand 8 states and 159 transitions.
[2024-06-20 18:36:01,904 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 143 transitions, 1291 flow
[2024-06-20 18:36:01,920 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 143 transitions, 1230 flow, removed 17 selfloop flow, removed 6 redundant places.
[2024-06-20 18:36:01,921 INFO  L231             Difference]: Finished difference. Result has 98 places, 113 transitions, 935 flow
[2024-06-20 18:36:01,922 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=935, PETRI_PLACES=98, PETRI_TRANSITIONS=113}
[2024-06-20 18:36:01,922 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 56 predicate places.
[2024-06-20 18:36:01,922 INFO  L495      AbstractCegarLoop]: Abstraction has has 98 places, 113 transitions, 935 flow
[2024-06-20 18:36:01,922 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 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 18:36:01,922 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:36:01,923 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:36:01,923 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-20 18:36:01,923 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:36:01,923 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:36:01,923 INFO  L85        PathProgramCache]: Analyzing trace with hash -1693909546, now seen corresponding path program 1 times
[2024-06-20 18:36:01,923 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:36:01,923 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394830445]
[2024-06-20 18:36:01,924 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:36:01,924 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:36:01,983 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:36:11,439 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:36:11,439 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:36:11,439 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394830445]
[2024-06-20 18:36:11,439 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394830445] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:36:11,440 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:36:11,440 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 18:36:11,440 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474487506]
[2024-06-20 18:36:11,440 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:36:11,441 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 18:36:11,442 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:36:11,443 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 18:36:11,443 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 18:36:11,593 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:36:11,594 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 113 transitions, 935 flow. Second operand  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:36:11,594 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:36:11,594 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:36:11,594 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:36:12,737 INFO  L124   PetriNetUnfolderBase]: 1604/2490 cut-off events.
[2024-06-20 18:36:12,737 INFO  L125   PetriNetUnfolderBase]: For 43460/43460 co-relation queries the response was YES.
[2024-06-20 18:36:12,745 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13939 conditions, 2490 events. 1604/2490 cut-off events. For 43460/43460 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12263 event pairs, 439 based on Foata normal form. 2/2489 useless extension candidates. Maximal degree in co-relation 13900. Up to 2299 conditions per place. 
[2024-06-20 18:36:12,754 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 126 selfloop transitions, 20 changer transitions 0/152 dead transitions.
[2024-06-20 18:36:12,754 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 152 transitions, 1382 flow
[2024-06-20 18:36:12,756 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 18:36:12,757 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 18:36:12,757 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions.
[2024-06-20 18:36:12,757 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45799457994579945
[2024-06-20 18:36:12,757 INFO  L175             Difference]: Start difference. First operand has 98 places, 113 transitions, 935 flow. Second operand 9 states and 169 transitions.
[2024-06-20 18:36:12,757 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 152 transitions, 1382 flow
[2024-06-20 18:36:12,776 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 152 transitions, 1312 flow, removed 19 selfloop flow, removed 6 redundant places.
[2024-06-20 18:36:12,778 INFO  L231             Difference]: Finished difference. Result has 102 places, 119 transitions, 996 flow
[2024-06-20 18:36:12,778 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=996, PETRI_PLACES=102, PETRI_TRANSITIONS=119}
[2024-06-20 18:36:12,779 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 60 predicate places.
[2024-06-20 18:36:12,779 INFO  L495      AbstractCegarLoop]: Abstraction has has 102 places, 119 transitions, 996 flow
[2024-06-20 18:36:12,779 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:36:12,779 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:36:12,779 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:36:12,779 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-20 18:36:12,779 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 18:36:12,780 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:36:12,780 INFO  L85        PathProgramCache]: Analyzing trace with hash -1578623336, now seen corresponding path program 3 times
[2024-06-20 18:36:12,780 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:36:12,780 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624052183]
[2024-06-20 18:36:12,780 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:36:12,780 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:36:12,832 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:36:20,956 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 18:36:20,956 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:36:20,956 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624052183]
[2024-06-20 18:36:20,957 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624052183] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:36:20,957 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:36:20,957 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 18:36:20,957 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071073587]
[2024-06-20 18:36:20,957 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:36:20,957 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 18:36:20,957 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:36:20,958 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 18:36:20,958 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 18:36:21,124 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41
[2024-06-20 18:36:21,126 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 119 transitions, 996 flow. Second operand  has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 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 18:36:21,126 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:36:21,126 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41
[2024-06-20 18:36:21,126 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:36:22,211 INFO  L124   PetriNetUnfolderBase]: 1540/2446 cut-off events.
[2024-06-20 18:36:22,211 INFO  L125   PetriNetUnfolderBase]: For 49830/49830 co-relation queries the response was YES.
[2024-06-20 18:36:22,219 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14448 conditions, 2446 events. 1540/2446 cut-off events. For 49830/49830 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 12467 event pairs, 397 based on Foata normal form. 8/2451 useless extension candidates. Maximal degree in co-relation 14407. Up to 2177 conditions per place. 
[2024-06-20 18:36:22,227 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 115 selfloop transitions, 20 changer transitions 0/148 dead transitions.
[2024-06-20 18:36:22,228 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 148 transitions, 1382 flow
[2024-06-20 18:36:22,228 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 18:36:22,228 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 18:36:22,229 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions.
[2024-06-20 18:36:22,229 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47560975609756095
[2024-06-20 18:36:22,230 INFO  L175             Difference]: Start difference. First operand has 102 places, 119 transitions, 996 flow. Second operand 8 states and 156 transitions.
[2024-06-20 18:36:22,230 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 148 transitions, 1382 flow
[2024-06-20 18:36:22,249 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 148 transitions, 1298 flow, removed 25 selfloop flow, removed 6 redundant places.
[2024-06-20 18:36:22,251 INFO  L231             Difference]: Finished difference. Result has 104 places, 121 transitions, 1012 flow
[2024-06-20 18:36:22,251 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=912, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1012, PETRI_PLACES=104, PETRI_TRANSITIONS=121}
[2024-06-20 18:36:22,251 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 62 predicate places.
[2024-06-20 18:36:22,252 INFO  L495      AbstractCegarLoop]: Abstraction has has 104 places, 121 transitions, 1012 flow
[2024-06-20 18:36:22,252 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 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 18:36:22,252 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:36:22,252 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:36:22,252 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-20 18:36:22,253 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 18:36:22,253 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:36:22,253 INFO  L85        PathProgramCache]: Analyzing trace with hash -1578618376, now seen corresponding path program 2 times
[2024-06-20 18:36:22,253 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:36:22,253 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823259187]
[2024-06-20 18:36:22,254 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:36:22,254 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:36:22,356 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:36:31,564 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 18:36:31,564 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:36:31,564 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823259187]
[2024-06-20 18:36:31,564 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823259187] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:36:31,564 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:36:31,565 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 18:36:31,565 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849145332]
[2024-06-20 18:36:31,565 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:36:31,565 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 18:36:31,565 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:36:31,566 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 18:36:31,566 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 18:36:31,749 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-20 18:36:31,749 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 121 transitions, 1012 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 18:36:31,749 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:36:31,749 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-20 18:36:31,749 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:36:33,065 INFO  L124   PetriNetUnfolderBase]: 1660/2581 cut-off events.
[2024-06-20 18:36:33,065 INFO  L125   PetriNetUnfolderBase]: For 53957/53957 co-relation queries the response was YES.
[2024-06-20 18:36:33,073 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15217 conditions, 2581 events. 1660/2581 cut-off events. For 53957/53957 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 12791 event pairs, 434 based on Foata normal form. 2/2580 useless extension candidates. Maximal degree in co-relation 15175. Up to 2373 conditions per place. 
[2024-06-20 18:36:33,083 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 126 selfloop transitions, 25 changer transitions 0/157 dead transitions.
[2024-06-20 18:36:33,083 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 157 transitions, 1475 flow
[2024-06-20 18:36:33,085 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 18:36:33,085 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 18:36:33,086 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions.
[2024-06-20 18:36:33,086 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43089430894308944
[2024-06-20 18:36:33,086 INFO  L175             Difference]: Start difference. First operand has 104 places, 121 transitions, 1012 flow. Second operand 9 states and 159 transitions.
[2024-06-20 18:36:33,086 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 157 transitions, 1475 flow
[2024-06-20 18:36:33,111 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 157 transitions, 1374 flow, removed 27 selfloop flow, removed 7 redundant places.
[2024-06-20 18:36:33,113 INFO  L231             Difference]: Finished difference. Result has 106 places, 127 transitions, 1060 flow
[2024-06-20 18:36:33,113 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=920, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1060, PETRI_PLACES=106, PETRI_TRANSITIONS=127}
[2024-06-20 18:36:33,113 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 64 predicate places.
[2024-06-20 18:36:33,113 INFO  L495      AbstractCegarLoop]: Abstraction has has 106 places, 127 transitions, 1060 flow
[2024-06-20 18:36:33,114 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 18:36:33,114 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:36:33,114 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:36:33,114 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-20 18:36:33,114 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 18:36:33,114 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:36:33,114 INFO  L85        PathProgramCache]: Analyzing trace with hash -1578438886, now seen corresponding path program 3 times
[2024-06-20 18:36:33,115 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:36:33,115 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496905767]
[2024-06-20 18:36:33,115 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:36:33,115 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:36:33,190 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:36:41,993 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 18:36:41,994 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:36:41,994 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496905767]
[2024-06-20 18:36:41,994 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496905767] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:36:41,994 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:36:41,994 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 18:36:41,994 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435802387]
[2024-06-20 18:36:41,994 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:36:41,995 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 18:36:42,008 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:36:42,009 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 18:36:42,009 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-20 18:36:42,152 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:36:42,152 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 127 transitions, 1060 flow. Second operand  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:36:42,152 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:36:42,152 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:36:42,152 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:36:43,422 INFO  L124   PetriNetUnfolderBase]: 1671/2602 cut-off events.
[2024-06-20 18:36:43,423 INFO  L125   PetriNetUnfolderBase]: For 57283/57283 co-relation queries the response was YES.
[2024-06-20 18:36:43,430 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15385 conditions, 2602 events. 1671/2602 cut-off events. For 57283/57283 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 12946 event pairs, 434 based on Foata normal form. 2/2601 useless extension candidates. Maximal degree in co-relation 15343. Up to 2318 conditions per place. 
[2024-06-20 18:36:43,438 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 112 selfloop transitions, 44 changer transitions 0/162 dead transitions.
[2024-06-20 18:36:43,439 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 162 transitions, 1594 flow
[2024-06-20 18:36:43,441 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 18:36:43,441 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 18:36:43,441 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions.
[2024-06-20 18:36:43,441 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46612466124661245
[2024-06-20 18:36:43,441 INFO  L175             Difference]: Start difference. First operand has 106 places, 127 transitions, 1060 flow. Second operand 9 states and 172 transitions.
[2024-06-20 18:36:43,442 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 162 transitions, 1594 flow
[2024-06-20 18:36:43,467 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 162 transitions, 1490 flow, removed 24 selfloop flow, removed 7 redundant places.
[2024-06-20 18:36:43,476 INFO  L231             Difference]: Finished difference. Result has 108 places, 130 transitions, 1120 flow
[2024-06-20 18:36:43,477 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=956, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1120, PETRI_PLACES=108, PETRI_TRANSITIONS=130}
[2024-06-20 18:36:43,477 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 66 predicate places.
[2024-06-20 18:36:43,477 INFO  L495      AbstractCegarLoop]: Abstraction has has 108 places, 130 transitions, 1120 flow
[2024-06-20 18:36:43,477 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:36:43,478 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:36:43,478 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:36:43,478 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-20 18:36:43,478 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 18:36:43,478 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:36:43,478 INFO  L85        PathProgramCache]: Analyzing trace with hash -1578438638, now seen corresponding path program 1 times
[2024-06-20 18:36:43,478 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:36:43,478 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214429625]
[2024-06-20 18:36:43,479 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:36:43,479 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:36:43,522 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:36:53,079 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 18:36:53,079 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:36:53,079 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214429625]
[2024-06-20 18:36:53,079 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214429625] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:36:53,079 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:36:53,080 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 18:36:53,080 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691559421]
[2024-06-20 18:36:53,080 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:36:53,082 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 18:36:53,082 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:36:53,083 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 18:36:53,083 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-20 18:36:53,267 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:36:53,267 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 130 transitions, 1120 flow. Second operand  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:36:53,268 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:36:53,268 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:36:53,268 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:36:54,563 INFO  L124   PetriNetUnfolderBase]: 1764/2753 cut-off events.
[2024-06-20 18:36:54,564 INFO  L125   PetriNetUnfolderBase]: For 70063/70063 co-relation queries the response was YES.
[2024-06-20 18:36:54,572 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16624 conditions, 2753 events. 1764/2753 cut-off events. For 70063/70063 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 13867 event pairs, 446 based on Foata normal form. 22/2769 useless extension candidates. Maximal degree in co-relation 16582. Up to 2371 conditions per place. 
[2024-06-20 18:36:54,582 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 129 selfloop transitions, 33 changer transitions 0/168 dead transitions.
[2024-06-20 18:36:54,582 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 168 transitions, 1606 flow
[2024-06-20 18:36:54,584 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 18:36:54,584 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 18:36:54,584 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions.
[2024-06-20 18:36:54,584 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4742547425474255
[2024-06-20 18:36:54,585 INFO  L175             Difference]: Start difference. First operand has 108 places, 130 transitions, 1120 flow. Second operand 9 states and 175 transitions.
[2024-06-20 18:36:54,585 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 168 transitions, 1606 flow
[2024-06-20 18:36:54,622 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 168 transitions, 1466 flow, removed 48 selfloop flow, removed 4 redundant places.
[2024-06-20 18:36:54,624 INFO  L231             Difference]: Finished difference. Result has 114 places, 133 transitions, 1130 flow
[2024-06-20 18:36:54,624 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=980, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1130, PETRI_PLACES=114, PETRI_TRANSITIONS=133}
[2024-06-20 18:36:54,624 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 72 predicate places.
[2024-06-20 18:36:54,624 INFO  L495      AbstractCegarLoop]: Abstraction has has 114 places, 133 transitions, 1130 flow
[2024-06-20 18:36:54,625 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:36:54,625 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:36:54,625 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:36:54,625 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-20 18:36:54,625 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:36:54,625 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:36:54,626 INFO  L85        PathProgramCache]: Analyzing trace with hash 719830966, now seen corresponding path program 1 times
[2024-06-20 18:36:54,626 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:36:54,626 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734035274]
[2024-06-20 18:36:54,626 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:36:54,626 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:36:54,654 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:37:07,396 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 18:37:07,396 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:37:07,396 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734035274]
[2024-06-20 18:37:07,396 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734035274] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:37:07,396 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:37:07,396 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 18:37:07,396 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020877578]
[2024-06-20 18:37:07,396 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:37:07,397 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 18:37:07,397 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:37:07,397 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 18:37:07,397 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-20 18:37:07,483 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-20 18:37:07,483 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 133 transitions, 1130 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 18:37:07,483 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:37:07,483 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-20 18:37:07,483 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:37:08,729 INFO  L124   PetriNetUnfolderBase]: 1887/2882 cut-off events.
[2024-06-20 18:37:08,730 INFO  L125   PetriNetUnfolderBase]: For 75524/75524 co-relation queries the response was YES.
[2024-06-20 18:37:08,738 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17812 conditions, 2882 events. 1887/2882 cut-off events. For 75524/75524 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 14227 event pairs, 486 based on Foata normal form. 2/2881 useless extension candidates. Maximal degree in co-relation 17768. Up to 2775 conditions per place. 
[2024-06-20 18:37:08,747 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 135 selfloop transitions, 18 changer transitions 0/157 dead transitions.
[2024-06-20 18:37:08,747 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 157 transitions, 1608 flow
[2024-06-20 18:37:08,748 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 18:37:08,748 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 18:37:08,748 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions.
[2024-06-20 18:37:08,748 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45121951219512196
[2024-06-20 18:37:08,748 INFO  L175             Difference]: Start difference. First operand has 114 places, 133 transitions, 1130 flow. Second operand 6 states and 111 transitions.
[2024-06-20 18:37:08,748 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 157 transitions, 1608 flow
[2024-06-20 18:37:08,808 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 157 transitions, 1475 flow, removed 11 selfloop flow, removed 9 redundant places.
[2024-06-20 18:37:08,826 INFO  L231             Difference]: Finished difference. Result has 111 places, 139 transitions, 1116 flow
[2024-06-20 18:37:08,826 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=999, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1116, PETRI_PLACES=111, PETRI_TRANSITIONS=139}
[2024-06-20 18:37:08,827 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 69 predicate places.
[2024-06-20 18:37:08,827 INFO  L495      AbstractCegarLoop]: Abstraction has has 111 places, 139 transitions, 1116 flow
[2024-06-20 18:37:08,827 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 18:37:08,827 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:37:08,827 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:37:08,827 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-20 18:37:08,828 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 18:37:08,828 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:37:08,828 INFO  L85        PathProgramCache]: Analyzing trace with hash 1141042840, now seen corresponding path program 4 times
[2024-06-20 18:37:08,828 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:37:08,828 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981547296]
[2024-06-20 18:37:08,828 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:37:08,829 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:37:08,967 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:37:17,978 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 18:37:17,978 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:37:17,978 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981547296]
[2024-06-20 18:37:17,978 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981547296] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:37:17,978 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:37:17,978 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 18:37:17,978 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978566756]
[2024-06-20 18:37:17,979 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:37:17,979 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 18:37:17,979 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:37:17,979 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 18:37:17,979 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-20 18:37:18,128 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41
[2024-06-20 18:37:18,128 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 139 transitions, 1116 flow. Second operand  has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 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 18:37:18,128 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:37:18,128 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41
[2024-06-20 18:37:18,128 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:37:19,271 INFO  L124   PetriNetUnfolderBase]: 1661/2645 cut-off events.
[2024-06-20 18:37:19,272 INFO  L125   PetriNetUnfolderBase]: For 74841/74853 co-relation queries the response was YES.
[2024-06-20 18:37:19,281 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16722 conditions, 2645 events. 1661/2645 cut-off events. For 74841/74853 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 13858 event pairs, 408 based on Foata normal form. 16/2651 useless extension candidates. Maximal degree in co-relation 16677. Up to 2297 conditions per place. 
[2024-06-20 18:37:19,291 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 109 selfloop transitions, 41 changer transitions 0/165 dead transitions.
[2024-06-20 18:37:19,291 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 165 transitions, 1532 flow
[2024-06-20 18:37:19,293 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 18:37:19,293 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 18:37:19,294 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions.
[2024-06-20 18:37:19,294 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47560975609756095
[2024-06-20 18:37:19,294 INFO  L175             Difference]: Start difference. First operand has 111 places, 139 transitions, 1116 flow. Second operand 8 states and 156 transitions.
[2024-06-20 18:37:19,294 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 165 transitions, 1532 flow
[2024-06-20 18:37:19,334 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 165 transitions, 1500 flow, removed 12 selfloop flow, removed 2 redundant places.
[2024-06-20 18:37:19,335 INFO  L231             Difference]: Finished difference. Result has 117 places, 141 transitions, 1235 flow
[2024-06-20 18:37:19,336 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1084, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1235, PETRI_PLACES=117, PETRI_TRANSITIONS=141}
[2024-06-20 18:37:19,336 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 75 predicate places.
[2024-06-20 18:37:19,336 INFO  L495      AbstractCegarLoop]: Abstraction has has 117 places, 141 transitions, 1235 flow
[2024-06-20 18:37:19,336 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 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 18:37:19,337 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:37:19,337 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:37:19,337 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-20 18:37:19,337 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 18:37:19,337 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:37:19,337 INFO  L85        PathProgramCache]: Analyzing trace with hash 1369128688, now seen corresponding path program 2 times
[2024-06-20 18:37:19,337 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:37:19,338 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051334675]
[2024-06-20 18:37:19,338 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:37:19,338 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:37:19,372 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:37:28,217 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 18:37:28,218 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:37:28,218 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051334675]
[2024-06-20 18:37:28,218 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051334675] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:37:28,218 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:37:28,218 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 18:37:28,218 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263686123]
[2024-06-20 18:37:28,218 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:37:28,218 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 18:37:28,218 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:37:28,218 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 18:37:28,219 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 18:37:28,446 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:37:28,447 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 141 transitions, 1235 flow. Second operand  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:37:28,447 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:37:28,447 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:37:28,447 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:37:29,659 INFO  L124   PetriNetUnfolderBase]: 1784/2783 cut-off events.
[2024-06-20 18:37:29,660 INFO  L125   PetriNetUnfolderBase]: For 80270/80282 co-relation queries the response was YES.
[2024-06-20 18:37:29,670 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17613 conditions, 2783 events. 1784/2783 cut-off events. For 80270/80282 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 14173 event pairs, 450 based on Foata normal form. 12/2790 useless extension candidates. Maximal degree in co-relation 17566. Up to 2528 conditions per place. 
[2024-06-20 18:37:29,681 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 131 selfloop transitions, 32 changer transitions 0/171 dead transitions.
[2024-06-20 18:37:29,681 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 171 transitions, 1681 flow
[2024-06-20 18:37:29,683 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 18:37:29,683 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 18:37:29,684 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions.
[2024-06-20 18:37:29,684 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44986449864498645
[2024-06-20 18:37:29,684 INFO  L175             Difference]: Start difference. First operand has 117 places, 141 transitions, 1235 flow. Second operand 9 states and 166 transitions.
[2024-06-20 18:37:29,684 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 171 transitions, 1681 flow
[2024-06-20 18:37:29,730 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 171 transitions, 1547 flow, removed 33 selfloop flow, removed 5 redundant places.
[2024-06-20 18:37:29,732 INFO  L231             Difference]: Finished difference. Result has 121 places, 143 transitions, 1226 flow
[2024-06-20 18:37:29,733 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1101, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1226, PETRI_PLACES=121, PETRI_TRANSITIONS=143}
[2024-06-20 18:37:29,733 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 79 predicate places.
[2024-06-20 18:37:29,733 INFO  L495      AbstractCegarLoop]: Abstraction has has 121 places, 143 transitions, 1226 flow
[2024-06-20 18:37:29,733 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:37:29,733 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:37:29,734 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:37:29,734 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-20 18:37:29,734 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:37:29,734 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:37:29,734 INFO  L85        PathProgramCache]: Analyzing trace with hash 1141227538, now seen corresponding path program 3 times
[2024-06-20 18:37:29,734 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:37:29,734 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557573422]
[2024-06-20 18:37:29,734 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:37:29,735 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:37:29,769 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:37:38,813 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 18:37:38,814 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:37:38,814 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557573422]
[2024-06-20 18:37:38,814 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557573422] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:37:38,814 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:37:38,814 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 18:37:38,814 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857970097]
[2024-06-20 18:37:38,814 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:37:38,814 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 18:37:38,814 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:37:38,814 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 18:37:38,815 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 18:37:39,108 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:37:39,108 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 143 transitions, 1226 flow. Second operand  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:37:39,108 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:37:39,108 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:37:39,108 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:37:40,292 INFO  L124   PetriNetUnfolderBase]: 1801/2810 cut-off events.
[2024-06-20 18:37:40,292 INFO  L125   PetriNetUnfolderBase]: For 84871/84883 co-relation queries the response was YES.
[2024-06-20 18:37:40,302 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17867 conditions, 2810 events. 1801/2810 cut-off events. For 84871/84883 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 14288 event pairs, 460 based on Foata normal form. 12/2817 useless extension candidates. Maximal degree in co-relation 17820. Up to 2555 conditions per place. 
[2024-06-20 18:37:40,312 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 136 selfloop transitions, 31 changer transitions 0/175 dead transitions.
[2024-06-20 18:37:40,312 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 175 transitions, 1694 flow
[2024-06-20 18:37:40,314 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 18:37:40,314 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 18:37:40,315 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions.
[2024-06-20 18:37:40,315 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45257452574525747
[2024-06-20 18:37:40,315 INFO  L175             Difference]: Start difference. First operand has 121 places, 143 transitions, 1226 flow. Second operand 9 states and 167 transitions.
[2024-06-20 18:37:40,315 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 175 transitions, 1694 flow
[2024-06-20 18:37:40,363 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 175 transitions, 1587 flow, removed 23 selfloop flow, removed 7 redundant places.
[2024-06-20 18:37:40,365 INFO  L231             Difference]: Finished difference. Result has 124 places, 147 transitions, 1264 flow
[2024-06-20 18:37:40,365 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1119, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1264, PETRI_PLACES=124, PETRI_TRANSITIONS=147}
[2024-06-20 18:37:40,365 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 82 predicate places.
[2024-06-20 18:37:40,365 INFO  L495      AbstractCegarLoop]: Abstraction has has 124 places, 147 transitions, 1264 flow
[2024-06-20 18:37:40,366 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:37:40,366 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:37:40,366 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:37:40,366 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-20 18:37:40,366 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 18:37:40,366 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:37:40,366 INFO  L85        PathProgramCache]: Analyzing trace with hash 1035748252, now seen corresponding path program 4 times
[2024-06-20 18:37:40,367 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:37:40,367 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758293457]
[2024-06-20 18:37:40,367 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:37:40,367 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:37:40,448 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:37:50,746 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 18:37:50,746 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:37:50,746 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758293457]
[2024-06-20 18:37:50,746 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758293457] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:37:50,746 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:37:50,746 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 18:37:50,746 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019262890]
[2024-06-20 18:37:50,746 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:37:50,747 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 18:37:50,747 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:37:50,747 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 18:37:50,747 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 18:37:50,995 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:37:50,995 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 147 transitions, 1264 flow. Second operand  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:37:50,996 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:37:50,996 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:37:50,996 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:37:52,377 INFO  L124   PetriNetUnfolderBase]: 1812/2823 cut-off events.
[2024-06-20 18:37:52,378 INFO  L125   PetriNetUnfolderBase]: For 89861/89867 co-relation queries the response was YES.
[2024-06-20 18:37:52,386 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18280 conditions, 2823 events. 1812/2823 cut-off events. For 89861/89867 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 14334 event pairs, 467 based on Foata normal form. 3/2819 useless extension candidates. Maximal degree in co-relation 18231. Up to 2479 conditions per place. 
[2024-06-20 18:37:52,395 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 114 selfloop transitions, 57 changer transitions 0/179 dead transitions.
[2024-06-20 18:37:52,395 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 179 transitions, 1766 flow
[2024-06-20 18:37:52,397 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 18:37:52,397 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 18:37:52,398 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions.
[2024-06-20 18:37:52,398 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4634146341463415
[2024-06-20 18:37:52,398 INFO  L175             Difference]: Start difference. First operand has 124 places, 147 transitions, 1264 flow. Second operand 9 states and 171 transitions.
[2024-06-20 18:37:52,398 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 179 transitions, 1766 flow
[2024-06-20 18:37:52,447 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 179 transitions, 1651 flow, removed 25 selfloop flow, removed 6 redundant places.
[2024-06-20 18:37:52,449 INFO  L231             Difference]: Finished difference. Result has 128 places, 152 transitions, 1381 flow
[2024-06-20 18:37:52,449 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1149, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1381, PETRI_PLACES=128, PETRI_TRANSITIONS=152}
[2024-06-20 18:37:52,449 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 86 predicate places.
[2024-06-20 18:37:52,449 INFO  L495      AbstractCegarLoop]: Abstraction has has 128 places, 152 transitions, 1381 flow
[2024-06-20 18:37:52,450 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:37:52,450 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:37:52,450 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:37:52,450 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-20 18:37:52,450 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 18:37:52,450 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:37:52,450 INFO  L85        PathProgramCache]: Analyzing trace with hash 1141227290, now seen corresponding path program 5 times
[2024-06-20 18:37:52,451 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:37:52,451 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49164220]
[2024-06-20 18:37:52,451 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:37:52,451 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:37:52,525 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:38:02,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 18:38:02,388 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:38:02,389 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49164220]
[2024-06-20 18:38:02,389 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49164220] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:38:02,389 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:38:02,389 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 18:38:02,389 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069540060]
[2024-06-20 18:38:02,389 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:38:02,389 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 18:38:02,389 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:38:02,390 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 18:38:02,390 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 18:38:02,578 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:38:02,578 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 152 transitions, 1381 flow. Second operand  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:38:02,578 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:38:02,578 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:38:02,578 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:38:03,884 INFO  L124   PetriNetUnfolderBase]: 1823/2844 cut-off events.
[2024-06-20 18:38:03,884 INFO  L125   PetriNetUnfolderBase]: For 97114/97120 co-relation queries the response was YES.
[2024-06-20 18:38:03,893 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18935 conditions, 2844 events. 1823/2844 cut-off events. For 97114/97120 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 14520 event pairs, 467 based on Foata normal form. 3/2840 useless extension candidates. Maximal degree in co-relation 18884. Up to 2495 conditions per place. 
[2024-06-20 18:38:03,902 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 120 selfloop transitions, 54 changer transitions 0/182 dead transitions.
[2024-06-20 18:38:03,903 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 182 transitions, 1881 flow
[2024-06-20 18:38:03,905 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 18:38:03,905 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 18:38:03,905 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions.
[2024-06-20 18:38:03,905 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46612466124661245
[2024-06-20 18:38:03,905 INFO  L175             Difference]: Start difference. First operand has 128 places, 152 transitions, 1381 flow. Second operand 9 states and 172 transitions.
[2024-06-20 18:38:03,905 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 182 transitions, 1881 flow
[2024-06-20 18:38:03,948 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 182 transitions, 1707 flow, removed 36 selfloop flow, removed 6 redundant places.
[2024-06-20 18:38:03,950 INFO  L231             Difference]: Finished difference. Result has 131 places, 155 transitions, 1413 flow
[2024-06-20 18:38:03,951 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1207, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1413, PETRI_PLACES=131, PETRI_TRANSITIONS=155}
[2024-06-20 18:38:03,951 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 89 predicate places.
[2024-06-20 18:38:03,952 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 155 transitions, 1413 flow
[2024-06-20 18:38:03,952 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:38:03,952 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:38:03,952 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:38:03,952 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-20 18:38:03,952 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 18:38:03,953 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:38:03,953 INFO  L85        PathProgramCache]: Analyzing trace with hash 1377411268, now seen corresponding path program 4 times
[2024-06-20 18:38:03,953 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:38:03,953 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260590202]
[2024-06-20 18:38:03,953 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:38:03,953 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:38:03,987 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:38:13,823 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 18:38:13,823 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:38:13,823 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260590202]
[2024-06-20 18:38:13,823 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260590202] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:38:13,824 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:38:13,824 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 18:38:13,824 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701902086]
[2024-06-20 18:38:13,824 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:38:13,824 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 18:38:13,824 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:38:13,825 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 18:38:13,825 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 18:38:14,084 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:38:14,084 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 155 transitions, 1413 flow. Second operand  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:38:14,084 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:38:14,084 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:38:14,085 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:38:15,448 INFO  L124   PetriNetUnfolderBase]: 1967/3087 cut-off events.
[2024-06-20 18:38:15,449 INFO  L125   PetriNetUnfolderBase]: For 117401/117413 co-relation queries the response was YES.
[2024-06-20 18:38:15,461 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21463 conditions, 3087 events. 1967/3087 cut-off events. For 117401/117413 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 16166 event pairs, 464 based on Foata normal form. 12/3094 useless extension candidates. Maximal degree in co-relation 21411. Up to 2355 conditions per place. 
[2024-06-20 18:38:15,475 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 109 selfloop transitions, 77 changer transitions 0/194 dead transitions.
[2024-06-20 18:38:15,476 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 194 transitions, 2163 flow
[2024-06-20 18:38:15,478 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 18:38:15,478 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 18:38:15,478 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions.
[2024-06-20 18:38:15,479 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47696476964769646
[2024-06-20 18:38:15,479 INFO  L175             Difference]: Start difference. First operand has 131 places, 155 transitions, 1413 flow. Second operand 9 states and 176 transitions.
[2024-06-20 18:38:15,479 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 194 transitions, 2163 flow
[2024-06-20 18:38:15,541 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 194 transitions, 1981 flow, removed 39 selfloop flow, removed 7 redundant places.
[2024-06-20 18:38:15,543 INFO  L231             Difference]: Finished difference. Result has 134 places, 160 transitions, 1571 flow
[2024-06-20 18:38:15,544 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1231, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1571, PETRI_PLACES=134, PETRI_TRANSITIONS=160}
[2024-06-20 18:38:15,544 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 92 predicate places.
[2024-06-20 18:38:15,544 INFO  L495      AbstractCegarLoop]: Abstraction has has 134 places, 160 transitions, 1571 flow
[2024-06-20 18:38:15,544 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:38:15,544 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:38:15,545 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:38:15,545 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-20 18:38:15,545 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 18:38:15,545 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:38:15,545 INFO  L85        PathProgramCache]: Analyzing trace with hash 1147714040, now seen corresponding path program 6 times
[2024-06-20 18:38:15,545 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:38:15,545 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851040656]
[2024-06-20 18:38:15,546 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:38:15,546 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:38:15,627 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:38:24,941 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 18:38:24,942 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:38:24,942 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851040656]
[2024-06-20 18:38:24,942 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851040656] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:38:24,942 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:38:24,942 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 18:38:24,942 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751583016]
[2024-06-20 18:38:24,942 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:38:24,943 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 18:38:24,943 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:38:24,943 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 18:38:24,943 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-20 18:38:25,208 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:38:25,208 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 160 transitions, 1571 flow. Second operand  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:38:25,208 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:38:25,209 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:38:25,209 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:38:26,639 INFO  L124   PetriNetUnfolderBase]: 1962/3077 cut-off events.
[2024-06-20 18:38:26,639 INFO  L125   PetriNetUnfolderBase]: For 124329/124335 co-relation queries the response was YES.
[2024-06-20 18:38:26,651 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21866 conditions, 3077 events. 1962/3077 cut-off events. For 124329/124335 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 16098 event pairs, 503 based on Foata normal form. 3/3073 useless extension candidates. Maximal degree in co-relation 21812. Up to 2629 conditions per place. 
[2024-06-20 18:38:26,666 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 96 selfloop transitions, 86 changer transitions 0/190 dead transitions.
[2024-06-20 18:38:26,666 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 190 transitions, 2095 flow
[2024-06-20 18:38:26,669 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 18:38:26,669 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 18:38:26,669 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions.
[2024-06-20 18:38:26,670 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4634146341463415
[2024-06-20 18:38:26,670 INFO  L175             Difference]: Start difference. First operand has 134 places, 160 transitions, 1571 flow. Second operand 9 states and 171 transitions.
[2024-06-20 18:38:26,670 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 190 transitions, 2095 flow
[2024-06-20 18:38:26,743 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 190 transitions, 1956 flow, removed 29 selfloop flow, removed 5 redundant places.
[2024-06-20 18:38:26,746 INFO  L231             Difference]: Finished difference. Result has 138 places, 163 transitions, 1710 flow
[2024-06-20 18:38:26,746 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1432, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1710, PETRI_PLACES=138, PETRI_TRANSITIONS=163}
[2024-06-20 18:38:26,747 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 96 predicate places.
[2024-06-20 18:38:26,747 INFO  L495      AbstractCegarLoop]: Abstraction has has 138 places, 163 transitions, 1710 flow
[2024-06-20 18:38:26,747 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:38:26,747 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:38:26,747 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:38:26,747 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-20 18:38:26,748 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 18:38:26,748 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:38:26,748 INFO  L85        PathProgramCache]: Analyzing trace with hash 1377402898, now seen corresponding path program 5 times
[2024-06-20 18:38:26,748 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:38:26,748 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780163989]
[2024-06-20 18:38:26,748 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:38:26,748 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:38:26,785 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:38:37,319 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 18:38:37,319 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:38:37,319 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780163989]
[2024-06-20 18:38:37,319 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780163989] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:38:37,319 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:38:37,320 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 18:38:37,320 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175085699]
[2024-06-20 18:38:37,320 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:38:37,320 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 18:38:37,320 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:38:37,320 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 18:38:37,320 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 18:38:37,495 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:38:37,495 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 163 transitions, 1710 flow. Second operand  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:38:37,496 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:38:37,496 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:38:37,496 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:38:38,829 INFO  L124   PetriNetUnfolderBase]: 1954/3068 cut-off events.
[2024-06-20 18:38:38,830 INFO  L125   PetriNetUnfolderBase]: For 131114/131126 co-relation queries the response was YES.
[2024-06-20 18:38:38,843 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22272 conditions, 3068 events. 1954/3068 cut-off events. For 131114/131126 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 16042 event pairs, 494 based on Foata normal form. 12/3075 useless extension candidates. Maximal degree in co-relation 22216. Up to 2677 conditions per place. 
[2024-06-20 18:38:38,857 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 116 selfloop transitions, 68 changer transitions 0/192 dead transitions.
[2024-06-20 18:38:38,857 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 192 transitions, 2201 flow
[2024-06-20 18:38:38,859 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 18:38:38,859 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 18:38:38,861 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions.
[2024-06-20 18:38:38,861 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46070460704607047
[2024-06-20 18:38:38,861 INFO  L175             Difference]: Start difference. First operand has 138 places, 163 transitions, 1710 flow. Second operand 9 states and 170 transitions.
[2024-06-20 18:38:38,861 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 192 transitions, 2201 flow
[2024-06-20 18:38:38,929 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 192 transitions, 1899 flow, removed 48 selfloop flow, removed 9 redundant places.
[2024-06-20 18:38:38,931 INFO  L231             Difference]: Finished difference. Result has 138 places, 164 transitions, 1606 flow
[2024-06-20 18:38:38,931 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1408, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1606, PETRI_PLACES=138, PETRI_TRANSITIONS=164}
[2024-06-20 18:38:38,932 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 96 predicate places.
[2024-06-20 18:38:38,933 INFO  L495      AbstractCegarLoop]: Abstraction has has 138 places, 164 transitions, 1606 flow
[2024-06-20 18:38:38,933 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:38:38,933 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:38:38,933 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:38:38,933 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-20 18:38:38,933 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 18:38:38,933 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:38:38,934 INFO  L85        PathProgramCache]: Analyzing trace with hash 731258806, now seen corresponding path program 2 times
[2024-06-20 18:38:38,934 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:38:38,934 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570153597]
[2024-06-20 18:38:38,934 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:38:38,934 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:38:38,966 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:38:51,445 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 18:38:51,445 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:38:51,445 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570153597]
[2024-06-20 18:38:51,445 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570153597] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:38:51,445 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:38:51,445 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 18:38:51,445 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960519474]
[2024-06-20 18:38:51,446 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:38:51,446 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 18:38:51,446 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:38:51,446 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 18:38:51,446 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-20 18:38:51,573 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-20 18:38:51,574 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 164 transitions, 1606 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 18:38:51,574 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:38:51,574 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-20 18:38:51,574 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:38:52,833 INFO  L124   PetriNetUnfolderBase]: 2052/3161 cut-off events.
[2024-06-20 18:38:52,833 INFO  L125   PetriNetUnfolderBase]: For 133614/133620 co-relation queries the response was YES.
[2024-06-20 18:38:52,845 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22657 conditions, 3161 events. 2052/3161 cut-off events. For 133614/133620 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 16077 event pairs, 538 based on Foata normal form. 3/3157 useless extension candidates. Maximal degree in co-relation 22602. Up to 3053 conditions per place. 
[2024-06-20 18:38:52,856 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 153 selfloop transitions, 18 changer transitions 0/175 dead transitions.
[2024-06-20 18:38:52,856 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 175 transitions, 1998 flow
[2024-06-20 18:38:52,856 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 18:38:52,857 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 18:38:52,857 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions.
[2024-06-20 18:38:52,857 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4268292682926829
[2024-06-20 18:38:52,857 INFO  L175             Difference]: Start difference. First operand has 138 places, 164 transitions, 1606 flow. Second operand 6 states and 105 transitions.
[2024-06-20 18:38:52,857 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 175 transitions, 1998 flow
[2024-06-20 18:38:52,933 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 175 transitions, 1787 flow, removed 39 selfloop flow, removed 7 redundant places.
[2024-06-20 18:38:52,935 INFO  L231             Difference]: Finished difference. Result has 137 places, 164 transitions, 1437 flow
[2024-06-20 18:38:52,935 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1395, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1437, PETRI_PLACES=137, PETRI_TRANSITIONS=164}
[2024-06-20 18:38:52,935 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 95 predicate places.
[2024-06-20 18:38:52,936 INFO  L495      AbstractCegarLoop]: Abstraction has has 137 places, 164 transitions, 1437 flow
[2024-06-20 18:38:52,936 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 18:38:52,936 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:38:52,936 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:38:52,936 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-20 18:38:52,937 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 18:38:52,937 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:38:52,937 INFO  L85        PathProgramCache]: Analyzing trace with hash 2033041946, now seen corresponding path program 1 times
[2024-06-20 18:38:52,937 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:38:52,937 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681870119]
[2024-06-20 18:38:52,937 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:38:52,937 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:38:52,970 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:39:02,685 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 18:39:02,686 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:39:02,686 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681870119]
[2024-06-20 18:39:02,686 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681870119] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:39:02,686 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:39:02,686 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 18:39:02,686 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118421466]
[2024-06-20 18:39:02,687 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:39:02,687 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 18:39:02,687 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:39:02,688 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 18:39:02,688 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-20 18:39:02,836 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:39:02,836 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 164 transitions, 1437 flow. Second operand  has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 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 18:39:02,836 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:39:02,837 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:39:02,837 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:39:03,837 INFO  L124   PetriNetUnfolderBase]: 1853/2944 cut-off events.
[2024-06-20 18:39:03,837 INFO  L125   PetriNetUnfolderBase]: For 117509/117509 co-relation queries the response was YES.
[2024-06-20 18:39:03,847 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20268 conditions, 2944 events. 1853/2944 cut-off events. For 117509/117509 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 15449 event pairs, 450 based on Foata normal form. 1/2942 useless extension candidates. Maximal degree in co-relation 20212. Up to 2795 conditions per place. 
[2024-06-20 18:39:03,858 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 162 selfloop transitions, 16 changer transitions 0/183 dead transitions.
[2024-06-20 18:39:03,858 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 183 transitions, 1943 flow
[2024-06-20 18:39:03,858 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 18:39:03,858 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 18:39:03,859 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions.
[2024-06-20 18:39:03,859 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45121951219512196
[2024-06-20 18:39:03,859 INFO  L175             Difference]: Start difference. First operand has 137 places, 164 transitions, 1437 flow. Second operand 6 states and 111 transitions.
[2024-06-20 18:39:03,859 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 183 transitions, 1943 flow
[2024-06-20 18:39:03,916 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 183 transitions, 1897 flow, removed 2 selfloop flow, removed 5 redundant places.
[2024-06-20 18:39:03,918 INFO  L231             Difference]: Finished difference. Result has 138 places, 170 transitions, 1487 flow
[2024-06-20 18:39:03,918 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1391, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1487, PETRI_PLACES=138, PETRI_TRANSITIONS=170}
[2024-06-20 18:39:03,918 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 96 predicate places.
[2024-06-20 18:39:03,918 INFO  L495      AbstractCegarLoop]: Abstraction has has 138 places, 170 transitions, 1487 flow
[2024-06-20 18:39:03,919 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 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 18:39:03,919 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:39:03,919 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:39:03,919 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-20 18:39:03,919 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 18:39:03,919 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:39:03,919 INFO  L85        PathProgramCache]: Analyzing trace with hash 2074735706, now seen corresponding path program 2 times
[2024-06-20 18:39:03,920 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:39:03,920 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540536858]
[2024-06-20 18:39:03,920 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:39:03,920 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:39:03,953 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:39:13,843 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 18:39:13,843 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:39:13,843 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540536858]
[2024-06-20 18:39:13,844 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540536858] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:39:13,844 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:39:13,844 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 18:39:13,844 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164726769]
[2024-06-20 18:39:13,844 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:39:13,844 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 18:39:13,845 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:39:13,845 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 18:39:13,845 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-20 18:39:13,936 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:39:13,937 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 170 transitions, 1487 flow. Second operand  has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 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 18:39:13,937 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:39:13,937 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:39:13,937 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:39:15,140 INFO  L124   PetriNetUnfolderBase]: 1850/2940 cut-off events.
[2024-06-20 18:39:15,140 INFO  L125   PetriNetUnfolderBase]: For 122738/122738 co-relation queries the response was YES.
[2024-06-20 18:39:15,151 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20626 conditions, 2940 events. 1850/2940 cut-off events. For 122738/122738 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 15414 event pairs, 449 based on Foata normal form. 1/2938 useless extension candidates. Maximal degree in co-relation 20569. Up to 2804 conditions per place. 
[2024-06-20 18:39:15,164 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 163 selfloop transitions, 11 changer transitions 0/179 dead transitions.
[2024-06-20 18:39:15,164 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 179 transitions, 1857 flow
[2024-06-20 18:39:15,165 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 18:39:15,165 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 18:39:15,165 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions.
[2024-06-20 18:39:15,165 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4268292682926829
[2024-06-20 18:39:15,165 INFO  L175             Difference]: Start difference. First operand has 138 places, 170 transitions, 1487 flow. Second operand 6 states and 105 transitions.
[2024-06-20 18:39:15,165 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 179 transitions, 1857 flow
[2024-06-20 18:39:15,229 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 179 transitions, 1813 flow, removed 18 selfloop flow, removed 2 redundant places.
[2024-06-20 18:39:15,231 INFO  L231             Difference]: Finished difference. Result has 142 places, 170 transitions, 1471 flow
[2024-06-20 18:39:15,231 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1443, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1471, PETRI_PLACES=142, PETRI_TRANSITIONS=170}
[2024-06-20 18:39:15,232 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 100 predicate places.
[2024-06-20 18:39:15,232 INFO  L495      AbstractCegarLoop]: Abstraction has has 142 places, 170 transitions, 1471 flow
[2024-06-20 18:39:15,232 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 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 18:39:15,232 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:39:15,232 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:39:15,232 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-20 18:39:15,233 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:39:15,233 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:39:15,233 INFO  L85        PathProgramCache]: Analyzing trace with hash 475179938, now seen corresponding path program 1 times
[2024-06-20 18:39:15,233 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:39:15,233 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59240451]
[2024-06-20 18:39:15,233 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:39:15,233 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:39:15,291 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:39:25,739 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:39:25,739 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:39:25,739 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59240451]
[2024-06-20 18:39:25,739 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59240451] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:39:25,739 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:39:25,739 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 18:39:25,739 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595239066]
[2024-06-20 18:39:25,739 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:39:25,740 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 18:39:25,740 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:39:25,740 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 18:39:25,740 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-20 18:39:25,971 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:39:25,972 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 170 transitions, 1471 flow. Second operand  has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:39:25,972 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:39:25,972 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:39:25,972 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:39:27,489 INFO  L124   PetriNetUnfolderBase]: 2019/3168 cut-off events.
[2024-06-20 18:39:27,490 INFO  L125   PetriNetUnfolderBase]: For 162126/162126 co-relation queries the response was YES.
[2024-06-20 18:39:27,502 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23397 conditions, 3168 events. 2019/3168 cut-off events. For 162126/162126 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 16676 event pairs, 496 based on Foata normal form. 16/3176 useless extension candidates. Maximal degree in co-relation 23338. Up to 2869 conditions per place. 
[2024-06-20 18:39:27,512 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 181 selfloop transitions, 21 changer transitions 0/212 dead transitions.
[2024-06-20 18:39:27,512 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 212 transitions, 2071 flow
[2024-06-20 18:39:27,514 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 18:39:27,515 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 18:39:27,515 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions.
[2024-06-20 18:39:27,515 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4585365853658537
[2024-06-20 18:39:27,515 INFO  L175             Difference]: Start difference. First operand has 142 places, 170 transitions, 1471 flow. Second operand 10 states and 188 transitions.
[2024-06-20 18:39:27,515 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 212 transitions, 2071 flow
[2024-06-20 18:39:27,603 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 212 transitions, 2041 flow, removed 2 selfloop flow, removed 5 redundant places.
[2024-06-20 18:39:27,605 INFO  L231             Difference]: Finished difference. Result has 147 places, 171 transitions, 1546 flow
[2024-06-20 18:39:27,606 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1441, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1546, PETRI_PLACES=147, PETRI_TRANSITIONS=171}
[2024-06-20 18:39:27,606 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 105 predicate places.
[2024-06-20 18:39:27,606 INFO  L495      AbstractCegarLoop]: Abstraction has has 147 places, 171 transitions, 1546 flow
[2024-06-20 18:39:27,606 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:39:27,606 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:39:27,606 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:39:27,607 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-20 18:39:27,607 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 18:39:27,607 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:39:27,607 INFO  L85        PathProgramCache]: Analyzing trace with hash -1686963700, now seen corresponding path program 2 times
[2024-06-20 18:39:27,607 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:39:27,607 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695002950]
[2024-06-20 18:39:27,607 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:39:27,608 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:39:27,672 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:39:38,127 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 18:39:38,127 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:39:38,127 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695002950]
[2024-06-20 18:39:38,127 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695002950] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:39:38,128 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:39:38,128 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 18:39:38,128 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247928035]
[2024-06-20 18:39:38,128 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:39:38,130 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 18:39:38,130 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:39:38,130 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 18:39:38,130 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-20 18:39:38,343 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:39:38,343 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 171 transitions, 1546 flow. Second operand  has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:39:38,343 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:39:38,343 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:39:38,344 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:39:39,762 INFO  L124   PetriNetUnfolderBase]: 2077/3278 cut-off events.
[2024-06-20 18:39:39,762 INFO  L125   PetriNetUnfolderBase]: For 175063/175063 co-relation queries the response was YES.
[2024-06-20 18:39:39,775 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24566 conditions, 3278 events. 2077/3278 cut-off events. For 175063/175063 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 17518 event pairs, 518 based on Foata normal form. 16/3291 useless extension candidates. Maximal degree in co-relation 24506. Up to 2886 conditions per place. 
[2024-06-20 18:39:39,787 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 155 selfloop transitions, 45 changer transitions 0/210 dead transitions.
[2024-06-20 18:39:39,787 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 210 transitions, 2136 flow
[2024-06-20 18:39:39,789 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 18:39:39,789 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 18:39:39,792 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions.
[2024-06-20 18:39:39,792 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4609756097560976
[2024-06-20 18:39:39,792 INFO  L175             Difference]: Start difference. First operand has 147 places, 171 transitions, 1546 flow. Second operand 10 states and 189 transitions.
[2024-06-20 18:39:39,792 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 210 transitions, 2136 flow
[2024-06-20 18:39:39,890 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 210 transitions, 2071 flow, removed 13 selfloop flow, removed 8 redundant places.
[2024-06-20 18:39:39,892 INFO  L231             Difference]: Finished difference. Result has 149 places, 172 transitions, 1636 flow
[2024-06-20 18:39:39,893 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1481, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1636, PETRI_PLACES=149, PETRI_TRANSITIONS=172}
[2024-06-20 18:39:39,893 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 107 predicate places.
[2024-06-20 18:39:39,894 INFO  L495      AbstractCegarLoop]: Abstraction has has 149 places, 172 transitions, 1636 flow
[2024-06-20 18:39:39,894 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:39:39,894 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:39:39,894 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:39:39,894 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-20 18:39:39,894 INFO  L420      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:39:39,895 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:39:39,895 INFO  L85        PathProgramCache]: Analyzing trace with hash -1686956260, now seen corresponding path program 3 times
[2024-06-20 18:39:39,895 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:39:39,895 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453823474]
[2024-06-20 18:39:39,895 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:39:39,896 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:39:39,955 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:39:48,723 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 18:39:48,723 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:39:48,723 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453823474]
[2024-06-20 18:39:48,724 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453823474] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:39:48,724 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:39:48,724 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 18:39:48,724 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418962951]
[2024-06-20 18:39:48,724 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:39:48,724 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 18:39:48,724 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:39:48,724 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 18:39:48,724 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-20 18:39:49,043 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:39:49,043 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 172 transitions, 1636 flow. Second operand  has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:39:49,043 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:39:49,043 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:39:49,043 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:39:50,679 INFO  L124   PetriNetUnfolderBase]: 2125/3358 cut-off events.
[2024-06-20 18:39:50,680 INFO  L125   PetriNetUnfolderBase]: For 184659/184659 co-relation queries the response was YES.
[2024-06-20 18:39:50,696 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25414 conditions, 3358 events. 2125/3358 cut-off events. For 184659/184659 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 18122 event pairs, 509 based on Foata normal form. 12/3359 useless extension candidates. Maximal degree in co-relation 25353. Up to 2687 conditions per place. 
[2024-06-20 18:39:50,713 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 156 selfloop transitions, 48 changer transitions 0/214 dead transitions.
[2024-06-20 18:39:50,713 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 214 transitions, 2264 flow
[2024-06-20 18:39:50,715 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 18:39:50,716 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 18:39:50,716 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions.
[2024-06-20 18:39:50,716 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4658536585365854
[2024-06-20 18:39:50,716 INFO  L175             Difference]: Start difference. First operand has 149 places, 172 transitions, 1636 flow. Second operand 10 states and 191 transitions.
[2024-06-20 18:39:50,716 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 214 transitions, 2264 flow
[2024-06-20 18:39:50,843 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 214 transitions, 2149 flow, removed 14 selfloop flow, removed 8 redundant places.
[2024-06-20 18:39:50,846 INFO  L231             Difference]: Finished difference. Result has 151 places, 173 transitions, 1683 flow
[2024-06-20 18:39:50,846 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1521, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1683, PETRI_PLACES=151, PETRI_TRANSITIONS=173}
[2024-06-20 18:39:50,847 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 109 predicate places.
[2024-06-20 18:39:50,847 INFO  L495      AbstractCegarLoop]: Abstraction has has 151 places, 173 transitions, 1683 flow
[2024-06-20 18:39:50,847 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:39:50,847 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:39:50,847 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:39:50,847 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-20 18:39:50,847 INFO  L420      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:39:50,848 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:39:50,848 INFO  L85        PathProgramCache]: Analyzing trace with hash 839924770, now seen corresponding path program 1 times
[2024-06-20 18:39:50,848 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:39:50,848 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418097590]
[2024-06-20 18:39:50,848 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:39:50,848 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:39:50,881 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:40:05,770 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:40:05,770 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:40:05,770 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418097590]
[2024-06-20 18:40:05,770 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418097590] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:40:05,770 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:40:05,770 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 18:40:05,771 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601235201]
[2024-06-20 18:40:05,771 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:40:05,771 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 18:40:05,771 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:40:05,771 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 18:40:05,771 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-06-20 18:40:05,884 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-20 18:40:05,884 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 173 transitions, 1683 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 18:40:05,884 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:40:05,884 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-20 18:40:05,884 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:40:07,321 INFO  L124   PetriNetUnfolderBase]: 2221/3458 cut-off events.
[2024-06-20 18:40:07,321 INFO  L125   PetriNetUnfolderBase]: For 181999/181999 co-relation queries the response was YES.
[2024-06-20 18:40:07,337 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26017 conditions, 3458 events. 2221/3458 cut-off events. For 181999/181999 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 18301 event pairs, 564 based on Foata normal form. 2/3457 useless extension candidates. Maximal degree in co-relation 25955. Up to 3313 conditions per place. 
[2024-06-20 18:40:07,354 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 173 selfloop transitions, 25 changer transitions 0/202 dead transitions.
[2024-06-20 18:40:07,354 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 202 transitions, 2333 flow
[2024-06-20 18:40:07,354 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 18:40:07,354 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 18:40:07,355 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions.
[2024-06-20 18:40:07,355 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4425087108013937
[2024-06-20 18:40:07,355 INFO  L175             Difference]: Start difference. First operand has 151 places, 173 transitions, 1683 flow. Second operand 7 states and 127 transitions.
[2024-06-20 18:40:07,355 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 202 transitions, 2333 flow
[2024-06-20 18:40:07,501 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 202 transitions, 2214 flow, removed 19 selfloop flow, removed 7 redundant places.
[2024-06-20 18:40:07,504 INFO  L231             Difference]: Finished difference. Result has 152 places, 182 transitions, 1732 flow
[2024-06-20 18:40:07,504 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1564, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1732, PETRI_PLACES=152, PETRI_TRANSITIONS=182}
[2024-06-20 18:40:07,505 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 110 predicate places.
[2024-06-20 18:40:07,505 INFO  L495      AbstractCegarLoop]: Abstraction has has 152 places, 182 transitions, 1732 flow
[2024-06-20 18:40:07,505 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 18:40:07,505 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:40:07,506 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:40:07,506 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-20 18:40:07,506 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 18:40:07,506 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:40:07,506 INFO  L85        PathProgramCache]: Analyzing trace with hash 2043426250, now seen corresponding path program 4 times
[2024-06-20 18:40:07,506 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:40:07,506 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348165483]
[2024-06-20 18:40:07,506 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:40:07,507 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:40:07,621 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:40:17,595 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 18:40:17,595 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:40:17,595 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348165483]
[2024-06-20 18:40:17,596 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348165483] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:40:17,596 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:40:17,596 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 18:40:17,596 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270056089]
[2024-06-20 18:40:17,596 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:40:17,596 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 18:40:17,596 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:40:17,596 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 18:40:17,596 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-20 18:40:17,751 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:40:17,751 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 182 transitions, 1732 flow. Second operand  has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:40:17,751 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:40:17,752 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:40:17,752 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:40:19,383 INFO  L124   PetriNetUnfolderBase]: 2162/3428 cut-off events.
[2024-06-20 18:40:19,384 INFO  L125   PetriNetUnfolderBase]: For 195632/195635 co-relation queries the response was YES.
[2024-06-20 18:40:19,400 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26258 conditions, 3428 events. 2162/3428 cut-off events. For 195632/195635 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 18725 event pairs, 541 based on Foata normal form. 8/3429 useless extension candidates. Maximal degree in co-relation 26194. Up to 3022 conditions per place. 
[2024-06-20 18:40:19,416 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 148 selfloop transitions, 60 changer transitions 0/218 dead transitions.
[2024-06-20 18:40:19,416 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 218 transitions, 2336 flow
[2024-06-20 18:40:19,419 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 18:40:19,419 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 18:40:19,419 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions.
[2024-06-20 18:40:19,419 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4634146341463415
[2024-06-20 18:40:19,420 INFO  L175             Difference]: Start difference. First operand has 152 places, 182 transitions, 1732 flow. Second operand 10 states and 190 transitions.
[2024-06-20 18:40:19,420 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 218 transitions, 2336 flow
[2024-06-20 18:40:19,647 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 218 transitions, 2297 flow, removed 16 selfloop flow, removed 2 redundant places.
[2024-06-20 18:40:19,651 INFO  L231             Difference]: Finished difference. Result has 160 places, 185 transitions, 1934 flow
[2024-06-20 18:40:19,651 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1693, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1934, PETRI_PLACES=160, PETRI_TRANSITIONS=185}
[2024-06-20 18:40:19,663 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 118 predicate places.
[2024-06-20 18:40:19,663 INFO  L495      AbstractCegarLoop]: Abstraction has has 160 places, 185 transitions, 1934 flow
[2024-06-20 18:40:19,664 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:40:19,664 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:40:19,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 18:40:19,664 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-20 18:40:19,664 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 18:40:19,665 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:40:19,665 INFO  L85        PathProgramCache]: Analyzing trace with hash 1644739942, now seen corresponding path program 5 times
[2024-06-20 18:40:19,665 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:40:19,666 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555102481]
[2024-06-20 18:40:19,666 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:40:19,666 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:40:19,767 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:40:32,918 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 18:40:32,918 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:40:32,918 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555102481]
[2024-06-20 18:40:32,918 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555102481] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:40:32,919 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:40:32,919 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 18:40:32,919 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421163971]
[2024-06-20 18:40:32,919 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:40:32,919 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 18:40:32,919 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:40:32,919 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 18:40:32,919 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2024-06-20 18:40:33,205 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:40:33,206 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 185 transitions, 1934 flow. Second operand  has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:40:33,206 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:40:33,206 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:40:33,206 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:40:34,994 INFO  L124   PetriNetUnfolderBase]: 2367/3784 cut-off events.
[2024-06-20 18:40:34,994 INFO  L125   PetriNetUnfolderBase]: For 241460/241469 co-relation queries the response was YES.
[2024-06-20 18:40:35,011 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30948 conditions, 3784 events. 2367/3784 cut-off events. For 241460/241469 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 21317 event pairs, 585 based on Foata normal form. 18/3797 useless extension candidates. Maximal degree in co-relation 30881. Up to 3050 conditions per place. 
[2024-06-20 18:40:35,028 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 165 selfloop transitions, 55 changer transitions 0/230 dead transitions.
[2024-06-20 18:40:35,029 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 230 transitions, 2875 flow
[2024-06-20 18:40:35,031 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 18:40:35,031 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 18:40:35,031 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 194 transitions.
[2024-06-20 18:40:35,031 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47317073170731705
[2024-06-20 18:40:35,031 INFO  L175             Difference]: Start difference. First operand has 160 places, 185 transitions, 1934 flow. Second operand 10 states and 194 transitions.
[2024-06-20 18:40:35,031 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 230 transitions, 2875 flow
[2024-06-20 18:40:35,189 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 230 transitions, 2660 flow, removed 50 selfloop flow, removed 8 redundant places.
[2024-06-20 18:40:35,192 INFO  L231             Difference]: Finished difference. Result has 163 places, 189 transitions, 2036 flow
[2024-06-20 18:40:35,192 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1719, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2036, PETRI_PLACES=163, PETRI_TRANSITIONS=189}
[2024-06-20 18:40:35,193 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 121 predicate places.
[2024-06-20 18:40:35,193 INFO  L495      AbstractCegarLoop]: Abstraction has has 163 places, 189 transitions, 2036 flow
[2024-06-20 18:40:35,193 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:40:35,193 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:40:35,193 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:40:35,193 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-20 18:40:35,193 INFO  L420      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:40:35,194 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:40:35,194 INFO  L85        PathProgramCache]: Analyzing trace with hash -506891620, now seen corresponding path program 6 times
[2024-06-20 18:40:35,194 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:40:35,194 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252392720]
[2024-06-20 18:40:35,194 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:40:35,194 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:40:35,255 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:40:44,440 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 18:40:44,440 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:40:44,440 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252392720]
[2024-06-20 18:40:44,441 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252392720] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:40:44,441 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:40:44,441 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 18:40:44,442 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397278832]
[2024-06-20 18:40:44,442 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:40:44,442 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 18:40:44,442 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:40:44,442 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 18:40:44,442 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-20 18:40:44,661 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:40:44,661 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 189 transitions, 2036 flow. Second operand  has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:40:44,661 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:40:44,661 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:40:44,661 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:40:46,411 INFO  L124   PetriNetUnfolderBase]: 2351/3760 cut-off events.
[2024-06-20 18:40:46,411 INFO  L125   PetriNetUnfolderBase]: For 243880/243889 co-relation queries the response was YES.
[2024-06-20 18:40:46,431 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30347 conditions, 3760 events. 2351/3760 cut-off events. For 243880/243889 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 21206 event pairs, 587 based on Foata normal form. 14/3769 useless extension candidates. Maximal degree in co-relation 30278. Up to 3392 conditions per place. 
[2024-06-20 18:40:46,448 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 168 selfloop transitions, 47 changer transitions 0/225 dead transitions.
[2024-06-20 18:40:46,448 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 225 transitions, 2656 flow
[2024-06-20 18:40:46,450 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 18:40:46,450 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 18:40:46,450 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions.
[2024-06-20 18:40:46,451 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4560975609756098
[2024-06-20 18:40:46,451 INFO  L175             Difference]: Start difference. First operand has 163 places, 189 transitions, 2036 flow. Second operand 10 states and 187 transitions.
[2024-06-20 18:40:46,451 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 225 transitions, 2656 flow
[2024-06-20 18:40:46,583 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 225 transitions, 2559 flow, removed 19 selfloop flow, removed 6 redundant places.
[2024-06-20 18:40:46,586 INFO  L231             Difference]: Finished difference. Result has 167 places, 192 transitions, 2156 flow
[2024-06-20 18:40:46,586 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1939, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2156, PETRI_PLACES=167, PETRI_TRANSITIONS=192}
[2024-06-20 18:40:46,586 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 125 predicate places.
[2024-06-20 18:40:46,587 INFO  L495      AbstractCegarLoop]: Abstraction has has 167 places, 192 transitions, 2156 flow
[2024-06-20 18:40:46,587 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:40:46,588 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:40:46,588 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:40:46,588 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-20 18:40:46,588 INFO  L420      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:40:46,588 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:40:46,588 INFO  L85        PathProgramCache]: Analyzing trace with hash 2050583530, now seen corresponding path program 7 times
[2024-06-20 18:40:46,588 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:40:46,588 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140923705]
[2024-06-20 18:40:46,589 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:40:46,589 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:40:46,656 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:40:55,641 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:40:55,642 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:40:55,642 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140923705]
[2024-06-20 18:40:55,642 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140923705] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:40:55,642 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:40:55,642 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 18:40:55,642 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049104216]
[2024-06-20 18:40:55,642 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:40:55,642 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 18:40:55,643 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:40:55,643 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 18:40:55,643 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-20 18:40:55,882 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:40:55,883 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 192 transitions, 2156 flow. Second operand  has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:40:55,883 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:40:55,883 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:40:55,883 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:40:57,752 INFO  L124   PetriNetUnfolderBase]: 2478/3980 cut-off events.
[2024-06-20 18:40:57,752 INFO  L125   PetriNetUnfolderBase]: For 275374/275377 co-relation queries the response was YES.
[2024-06-20 18:40:57,772 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33552 conditions, 3980 events. 2478/3980 cut-off events. For 275374/275377 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 22921 event pairs, 629 based on Foata normal form. 12/3985 useless extension candidates. Maximal degree in co-relation 33481. Up to 3276 conditions per place. 
[2024-06-20 18:40:57,791 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 135 selfloop transitions, 89 changer transitions 0/234 dead transitions.
[2024-06-20 18:40:57,791 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 234 transitions, 3060 flow
[2024-06-20 18:40:57,794 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 18:40:57,794 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 18:40:57,794 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 195 transitions.
[2024-06-20 18:40:57,794 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47560975609756095
[2024-06-20 18:40:57,795 INFO  L175             Difference]: Start difference. First operand has 167 places, 192 transitions, 2156 flow. Second operand 10 states and 195 transitions.
[2024-06-20 18:40:57,795 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 234 transitions, 3060 flow
[2024-06-20 18:40:57,985 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 234 transitions, 2865 flow, removed 50 selfloop flow, removed 8 redundant places.
[2024-06-20 18:40:57,989 INFO  L231             Difference]: Finished difference. Result has 169 places, 194 transitions, 2275 flow
[2024-06-20 18:40:57,989 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1961, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2275, PETRI_PLACES=169, PETRI_TRANSITIONS=194}
[2024-06-20 18:40:57,990 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 127 predicate places.
[2024-06-20 18:40:57,990 INFO  L495      AbstractCegarLoop]: Abstraction has has 169 places, 194 transitions, 2275 flow
[2024-06-20 18:40:57,990 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:40:57,990 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:40:57,990 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:40:57,991 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-20 18:40:57,991 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 18:40:57,991 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:40:57,991 INFO  L85        PathProgramCache]: Analyzing trace with hash 1901233012, now seen corresponding path program 8 times
[2024-06-20 18:40:57,991 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:40:57,991 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481140267]
[2024-06-20 18:40:57,992 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:40:57,992 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:40:58,059 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:41:07,981 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 18:41:07,982 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:41:07,982 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481140267]
[2024-06-20 18:41:07,982 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481140267] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:41:07,982 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:41:07,982 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 18:41:07,982 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908190249]
[2024-06-20 18:41:07,982 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:41:07,983 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 18:41:07,983 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:41:07,984 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 18:41:07,984 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-20 18:41:08,246 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:41:08,246 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 194 transitions, 2275 flow. Second operand  has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:41:08,246 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:41:08,246 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:41:08,246 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:41:09,937 INFO  L124   PetriNetUnfolderBase]: 2450/3936 cut-off events.
[2024-06-20 18:41:09,937 INFO  L125   PetriNetUnfolderBase]: For 278898/278901 co-relation queries the response was YES.
[2024-06-20 18:41:09,957 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32501 conditions, 3936 events. 2450/3936 cut-off events. For 278898/278901 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 22581 event pairs, 629 based on Foata normal form. 16/3945 useless extension candidates. Maximal degree in co-relation 32429. Up to 3355 conditions per place. 
[2024-06-20 18:41:09,976 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 132 selfloop transitions, 87 changer transitions 0/229 dead transitions.
[2024-06-20 18:41:09,976 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 229 transitions, 2849 flow
[2024-06-20 18:41:09,978 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 18:41:09,978 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 18:41:09,979 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions.
[2024-06-20 18:41:09,979 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4634146341463415
[2024-06-20 18:41:09,979 INFO  L175             Difference]: Start difference. First operand has 169 places, 194 transitions, 2275 flow. Second operand 10 states and 190 transitions.
[2024-06-20 18:41:09,979 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 229 transitions, 2849 flow
[2024-06-20 18:41:10,221 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 229 transitions, 2672 flow, removed 36 selfloop flow, removed 6 redundant places.
[2024-06-20 18:41:10,224 INFO  L231             Difference]: Finished difference. Result has 173 places, 194 transitions, 2279 flow
[2024-06-20 18:41:10,225 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2098, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2279, PETRI_PLACES=173, PETRI_TRANSITIONS=194}
[2024-06-20 18:41:10,225 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 131 predicate places.
[2024-06-20 18:41:10,225 INFO  L495      AbstractCegarLoop]: Abstraction has has 173 places, 194 transitions, 2279 flow
[2024-06-20 18:41:10,225 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:41:10,226 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:41:10,226 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:41:10,226 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-20 18:41:10,226 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 18:41:10,226 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:41:10,226 INFO  L85        PathProgramCache]: Analyzing trace with hash 1910437222, now seen corresponding path program 9 times
[2024-06-20 18:41:10,226 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:41:10,226 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462221906]
[2024-06-20 18:41:10,227 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:41:10,227 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:41:10,293 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:41:21,947 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 18:41:21,948 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:41:21,948 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462221906]
[2024-06-20 18:41:21,948 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462221906] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:41:21,948 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:41:21,948 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 18:41:21,948 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248579756]
[2024-06-20 18:41:21,948 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:41:21,949 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 18:41:21,954 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:41:21,955 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 18:41:21,955 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-20 18:41:22,311 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:41:22,312 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 194 transitions, 2279 flow. Second operand  has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:41:22,312 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:41:22,312 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:41:22,312 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:41:24,277 INFO  L124   PetriNetUnfolderBase]: 2588/4184 cut-off events.
[2024-06-20 18:41:24,277 INFO  L125   PetriNetUnfolderBase]: For 307574/307577 co-relation queries the response was YES.
[2024-06-20 18:41:24,297 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35462 conditions, 4184 events. 2588/4184 cut-off events. For 307574/307577 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 24422 event pairs, 617 based on Foata normal form. 12/4189 useless extension candidates. Maximal degree in co-relation 35388. Up to 2436 conditions per place. 
[2024-06-20 18:41:24,313 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 123 selfloop transitions, 105 changer transitions 0/238 dead transitions.
[2024-06-20 18:41:24,313 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 238 transitions, 3270 flow
[2024-06-20 18:41:24,314 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 18:41:24,314 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 18:41:24,314 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 195 transitions.
[2024-06-20 18:41:24,315 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47560975609756095
[2024-06-20 18:41:24,315 INFO  L175             Difference]: Start difference. First operand has 173 places, 194 transitions, 2279 flow. Second operand 10 states and 195 transitions.
[2024-06-20 18:41:24,315 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 238 transitions, 3270 flow
[2024-06-20 18:41:24,500 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 238 transitions, 3091 flow, removed 1 selfloop flow, removed 9 redundant places.
[2024-06-20 18:41:24,503 INFO  L231             Difference]: Finished difference. Result has 175 places, 197 transitions, 2558 flow
[2024-06-20 18:41:24,504 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2100, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2558, PETRI_PLACES=175, PETRI_TRANSITIONS=197}
[2024-06-20 18:41:24,504 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 133 predicate places.
[2024-06-20 18:41:24,504 INFO  L495      AbstractCegarLoop]: Abstraction has has 175 places, 197 transitions, 2558 flow
[2024-06-20 18:41:24,504 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:41:24,504 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:41:24,505 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:41:24,505 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-20 18:41:24,505 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 18:41:24,505 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:41:24,505 INFO  L85        PathProgramCache]: Analyzing trace with hash -1130800042, now seen corresponding path program 10 times
[2024-06-20 18:41:24,505 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:41:24,505 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171580720]
[2024-06-20 18:41:24,505 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:41:24,506 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:41:24,557 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:41:34,070 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 18:41:34,070 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:41:34,070 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171580720]
[2024-06-20 18:41:34,070 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171580720] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:41:34,070 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:41:34,070 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 18:41:34,070 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456972719]
[2024-06-20 18:41:34,071 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:41:34,071 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 18:41:34,071 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:41:34,071 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 18:41:34,071 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-20 18:41:34,281 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:41:34,282 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 197 transitions, 2558 flow. Second operand  has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:41:34,282 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:41:34,282 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:41:34,282 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:41:36,390 INFO  L124   PetriNetUnfolderBase]: 2668/4322 cut-off events.
[2024-06-20 18:41:36,391 INFO  L125   PetriNetUnfolderBase]: For 330168/330174 co-relation queries the response was YES.
[2024-06-20 18:41:36,413 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37324 conditions, 4322 events. 2668/4322 cut-off events. For 330168/330174 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 25620 event pairs, 693 based on Foata normal form. 20/4337 useless extension candidates. Maximal degree in co-relation 37248. Up to 3869 conditions per place. 
[2024-06-20 18:41:36,431 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 182 selfloop transitions, 47 changer transitions 0/239 dead transitions.
[2024-06-20 18:41:36,432 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 239 transitions, 3281 flow
[2024-06-20 18:41:36,434 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 18:41:36,434 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 18:41:36,439 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions.
[2024-06-20 18:41:36,440 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4585365853658537
[2024-06-20 18:41:36,440 INFO  L175             Difference]: Start difference. First operand has 175 places, 197 transitions, 2558 flow. Second operand 10 states and 188 transitions.
[2024-06-20 18:41:36,440 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 239 transitions, 3281 flow
[2024-06-20 18:41:36,759 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 239 transitions, 3124 flow, removed 22 selfloop flow, removed 6 redundant places.
[2024-06-20 18:41:36,777 INFO  L231             Difference]: Finished difference. Result has 180 places, 204 transitions, 2643 flow
[2024-06-20 18:41:36,777 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2408, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2643, PETRI_PLACES=180, PETRI_TRANSITIONS=204}
[2024-06-20 18:41:36,778 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 138 predicate places.
[2024-06-20 18:41:36,778 INFO  L495      AbstractCegarLoop]: Abstraction has has 180 places, 204 transitions, 2643 flow
[2024-06-20 18:41:36,778 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:41:36,778 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:41:36,792 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:41:36,792 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-20 18:41:36,792 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 18:41:36,793 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:41:36,793 INFO  L85        PathProgramCache]: Analyzing trace with hash -1125437662, now seen corresponding path program 11 times
[2024-06-20 18:41:36,793 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:41:36,793 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679528734]
[2024-06-20 18:41:36,793 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:41:36,793 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:41:36,858 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:41:45,766 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:41:45,766 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:41:45,766 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679528734]
[2024-06-20 18:41:45,766 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679528734] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:41:45,766 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:41:45,767 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 18:41:45,774 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449975019]
[2024-06-20 18:41:45,775 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:41:45,775 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 18:41:45,775 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:41:45,775 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 18:41:45,775 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-20 18:41:46,025 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:41:46,026 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 204 transitions, 2643 flow. Second operand  has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:41:46,026 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:41:46,026 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:41:46,026 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:41:47,907 INFO  L124   PetriNetUnfolderBase]: 2652/4288 cut-off events.
[2024-06-20 18:41:47,907 INFO  L125   PetriNetUnfolderBase]: For 323746/323752 co-relation queries the response was YES.
[2024-06-20 18:41:47,928 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36827 conditions, 4288 events. 2652/4288 cut-off events. For 323746/323752 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 25323 event pairs, 670 based on Foata normal form. 12/4295 useless extension candidates. Maximal degree in co-relation 36748. Up to 3901 conditions per place. 
[2024-06-20 18:41:47,947 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 182 selfloop transitions, 48 changer transitions 0/240 dead transitions.
[2024-06-20 18:41:47,948 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 240 transitions, 3301 flow
[2024-06-20 18:41:47,950 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 18:41:47,950 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 18:41:47,950 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions.
[2024-06-20 18:41:47,950 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4609756097560976
[2024-06-20 18:41:47,951 INFO  L175             Difference]: Start difference. First operand has 180 places, 204 transitions, 2643 flow. Second operand 10 states and 189 transitions.
[2024-06-20 18:41:47,951 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 240 transitions, 3301 flow
[2024-06-20 18:41:48,278 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 240 transitions, 3172 flow, removed 17 selfloop flow, removed 7 redundant places.
[2024-06-20 18:41:48,282 INFO  L231             Difference]: Finished difference. Result has 183 places, 207 transitions, 2741 flow
[2024-06-20 18:41:48,282 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2514, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2741, PETRI_PLACES=183, PETRI_TRANSITIONS=207}
[2024-06-20 18:41:48,283 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 141 predicate places.
[2024-06-20 18:41:48,283 INFO  L495      AbstractCegarLoop]: Abstraction has has 183 places, 207 transitions, 2741 flow
[2024-06-20 18:41:48,283 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:41:48,283 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:41:48,283 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:41:48,283 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-20 18:41:48,283 INFO  L420      AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:41:48,284 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:41:48,284 INFO  L85        PathProgramCache]: Analyzing trace with hash -847117842, now seen corresponding path program 12 times
[2024-06-20 18:41:48,284 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:41:48,284 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053710178]
[2024-06-20 18:41:48,284 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:41:48,284 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:41:48,342 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:41:57,594 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 18:41:57,595 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:41:57,595 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053710178]
[2024-06-20 18:41:57,595 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053710178] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:41:57,595 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:41:57,595 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 18:41:57,595 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103432264]
[2024-06-20 18:41:57,596 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:41:57,596 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 18:41:57,596 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:41:57,596 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 18:41:57,596 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-20 18:41:57,817 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:41:57,817 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 207 transitions, 2741 flow. Second operand  has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:41:57,817 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:41:57,817 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:41:57,817 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:41:59,979 INFO  L124   PetriNetUnfolderBase]: 2685/4357 cut-off events.
[2024-06-20 18:41:59,979 INFO  L125   PetriNetUnfolderBase]: For 341656/341662 co-relation queries the response was YES.
[2024-06-20 18:42:00,006 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37658 conditions, 4357 events. 2685/4357 cut-off events. For 341656/341662 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 25945 event pairs, 688 based on Foata normal form. 20/4372 useless extension candidates. Maximal degree in co-relation 37579. Up to 3877 conditions per place. 
[2024-06-20 18:42:00,028 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 179 selfloop transitions, 54 changer transitions 0/243 dead transitions.
[2024-06-20 18:42:00,029 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 243 transitions, 3416 flow
[2024-06-20 18:42:00,031 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 18:42:00,031 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 18:42:00,038 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions.
[2024-06-20 18:42:00,038 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4634146341463415
[2024-06-20 18:42:00,038 INFO  L175             Difference]: Start difference. First operand has 183 places, 207 transitions, 2741 flow. Second operand 10 states and 190 transitions.
[2024-06-20 18:42:00,038 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 243 transitions, 3416 flow
[2024-06-20 18:42:00,427 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 243 transitions, 3189 flow, removed 57 selfloop flow, removed 10 redundant places.
[2024-06-20 18:42:00,430 INFO  L231             Difference]: Finished difference. Result has 183 places, 208 transitions, 2700 flow
[2024-06-20 18:42:00,431 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2514, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2700, PETRI_PLACES=183, PETRI_TRANSITIONS=208}
[2024-06-20 18:42:00,431 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 141 predicate places.
[2024-06-20 18:42:00,431 INFO  L495      AbstractCegarLoop]: Abstraction has has 183 places, 208 transitions, 2700 flow
[2024-06-20 18:42:00,431 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:42:00,432 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:42:00,432 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:42:00,432 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-20 18:42:00,432 INFO  L420      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:42:00,432 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:42:00,433 INFO  L85        PathProgramCache]: Analyzing trace with hash 1018316572, now seen corresponding path program 13 times
[2024-06-20 18:42:00,433 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:42:00,433 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445144020]
[2024-06-20 18:42:00,433 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:42:00,433 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:42:00,518 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:42:14,587 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 18:42:14,587 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:42:14,587 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445144020]
[2024-06-20 18:42:14,587 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445144020] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:42:14,588 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:42:14,588 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 18:42:14,588 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772857571]
[2024-06-20 18:42:14,588 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:42:14,588 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 18:42:14,588 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:42:14,588 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 18:42:14,588 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2024-06-20 18:42:14,967 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:42:14,968 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 208 transitions, 2700 flow. Second operand  has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:42:14,968 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:42:14,968 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:42:14,968 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:42:16,797 INFO  L124   PetriNetUnfolderBase]: 2743/4455 cut-off events.
[2024-06-20 18:42:16,797 INFO  L125   PetriNetUnfolderBase]: For 352704/352710 co-relation queries the response was YES.
[2024-06-20 18:42:16,821 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38133 conditions, 4455 events. 2743/4455 cut-off events. For 352704/352710 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 26615 event pairs, 693 based on Foata normal form. 16/4466 useless extension candidates. Maximal degree in co-relation 38055. Up to 3570 conditions per place. 
[2024-06-20 18:42:16,840 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 180 selfloop transitions, 61 changer transitions 0/251 dead transitions.
[2024-06-20 18:42:16,840 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 251 transitions, 3616 flow
[2024-06-20 18:42:16,842 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 18:42:16,842 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 18:42:16,843 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 195 transitions.
[2024-06-20 18:42:16,843 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47560975609756095
[2024-06-20 18:42:16,843 INFO  L175             Difference]: Start difference. First operand has 183 places, 208 transitions, 2700 flow. Second operand 10 states and 195 transitions.
[2024-06-20 18:42:16,843 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 251 transitions, 3616 flow
[2024-06-20 18:42:17,166 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 251 transitions, 3475 flow, removed 18 selfloop flow, removed 8 redundant places.
[2024-06-20 18:42:17,169 INFO  L231             Difference]: Finished difference. Result has 186 places, 210 transitions, 2780 flow
[2024-06-20 18:42:17,170 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2559, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2780, PETRI_PLACES=186, PETRI_TRANSITIONS=210}
[2024-06-20 18:42:17,170 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 144 predicate places.
[2024-06-20 18:42:17,170 INFO  L495      AbstractCegarLoop]: Abstraction has has 186 places, 210 transitions, 2780 flow
[2024-06-20 18:42:17,170 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:42:17,170 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:42:17,170 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:42:17,170 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-20 18:42:17,171 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 18:42:17,171 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:42:17,171 INFO  L85        PathProgramCache]: Analyzing trace with hash 1194199900, now seen corresponding path program 2 times
[2024-06-20 18:42:17,171 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:42:17,171 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346807364]
[2024-06-20 18:42:17,171 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:42:17,171 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:42:17,199 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:42:32,380 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 18:42:32,381 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:42:32,381 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346807364]
[2024-06-20 18:42:32,381 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346807364] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:42:32,381 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:42:32,381 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 18:42:32,381 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264947944]
[2024-06-20 18:42:32,381 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:42:32,382 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 18:42:32,382 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:42:32,383 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 18:42:32,383 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-06-20 18:42:32,502 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-20 18:42:32,503 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 210 transitions, 2780 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 18:42:32,503 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:42:32,503 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-20 18:42:32,503 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:42:34,364 INFO  L124   PetriNetUnfolderBase]: 2846/4559 cut-off events.
[2024-06-20 18:42:34,364 INFO  L125   PetriNetUnfolderBase]: For 351521/351524 co-relation queries the response was YES.
[2024-06-20 18:42:34,390 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38968 conditions, 4559 events. 2846/4559 cut-off events. For 351521/351524 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 26772 event pairs, 747 based on Foata normal form. 2/4554 useless extension candidates. Maximal degree in co-relation 38888. Up to 4366 conditions per place. 
[2024-06-20 18:42:34,410 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 194 selfloop transitions, 29 changer transitions 0/227 dead transitions.
[2024-06-20 18:42:34,410 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 227 transitions, 3440 flow
[2024-06-20 18:42:34,411 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 18:42:34,411 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 18:42:34,411 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions.
[2024-06-20 18:42:34,411 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42160278745644597
[2024-06-20 18:42:34,412 INFO  L175             Difference]: Start difference. First operand has 186 places, 210 transitions, 2780 flow. Second operand 7 states and 121 transitions.
[2024-06-20 18:42:34,412 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 227 transitions, 3440 flow
[2024-06-20 18:42:34,809 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 227 transitions, 3217 flow, removed 25 selfloop flow, removed 8 redundant places.
[2024-06-20 18:42:34,812 INFO  L231             Difference]: Finished difference. Result has 185 places, 213 transitions, 2669 flow
[2024-06-20 18:42:34,812 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2557, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2669, PETRI_PLACES=185, PETRI_TRANSITIONS=213}
[2024-06-20 18:42:34,813 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 143 predicate places.
[2024-06-20 18:42:34,813 INFO  L495      AbstractCegarLoop]: Abstraction has has 185 places, 213 transitions, 2669 flow
[2024-06-20 18:42:34,813 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 18:42:34,813 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:42:34,813 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:42:34,813 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-20 18:42:34,814 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 18:42:34,814 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:42:34,814 INFO  L85        PathProgramCache]: Analyzing trace with hash -1643811336, now seen corresponding path program 3 times
[2024-06-20 18:42:34,814 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:42:34,814 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979714721]
[2024-06-20 18:42:34,814 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:42:34,814 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:42:34,849 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:42:44,705 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 18:42:44,706 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:42:44,706 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979714721]
[2024-06-20 18:42:44,706 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979714721] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:42:44,706 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:42:44,706 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 18:42:44,706 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572277801]
[2024-06-20 18:42:44,706 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:42:44,706 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 18:42:44,706 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:42:44,707 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 18:42:44,707 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2024-06-20 18:42:44,803 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-20 18:42:44,803 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 213 transitions, 2669 flow. Second operand  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:42:44,803 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:42:44,803 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-20 18:42:44,803 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:42:46,679 INFO  L124   PetriNetUnfolderBase]: 2840/4551 cut-off events.
[2024-06-20 18:42:46,679 INFO  L125   PetriNetUnfolderBase]: For 353052/353055 co-relation queries the response was YES.
[2024-06-20 18:42:46,704 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38319 conditions, 4551 events. 2840/4551 cut-off events. For 353052/353055 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 26746 event pairs, 747 based on Foata normal form. 2/4546 useless extension candidates. Maximal degree in co-relation 38239. Up to 4361 conditions per place. 
[2024-06-20 18:42:46,725 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 194 selfloop transitions, 28 changer transitions 0/226 dead transitions.
[2024-06-20 18:42:46,725 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 226 transitions, 3179 flow
[2024-06-20 18:42:46,727 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 18:42:46,727 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 18:42:46,727 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions.
[2024-06-20 18:42:46,728 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42160278745644597
[2024-06-20 18:42:46,728 INFO  L175             Difference]: Start difference. First operand has 185 places, 213 transitions, 2669 flow. Second operand 7 states and 121 transitions.
[2024-06-20 18:42:46,728 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 226 transitions, 3179 flow
[2024-06-20 18:42:47,094 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 226 transitions, 3073 flow, removed 32 selfloop flow, removed 4 redundant places.
[2024-06-20 18:42:47,097 INFO  L231             Difference]: Finished difference. Result has 188 places, 213 transitions, 2625 flow
[2024-06-20 18:42:47,097 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2563, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2625, PETRI_PLACES=188, PETRI_TRANSITIONS=213}
[2024-06-20 18:42:47,098 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 146 predicate places.
[2024-06-20 18:42:47,098 INFO  L495      AbstractCegarLoop]: Abstraction has has 188 places, 213 transitions, 2625 flow
[2024-06-20 18:42:47,098 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:42:47,098 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:42:47,098 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:42:47,099 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-20 18:42:47,099 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 18:42:47,099 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:42:47,099 INFO  L85        PathProgramCache]: Analyzing trace with hash 1187938396, now seen corresponding path program 1 times
[2024-06-20 18:42:47,099 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:42:47,099 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989589471]
[2024-06-20 18:42:47,099 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:42:47,100 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:42:47,139 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:42:58,480 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 18:42:58,481 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:42:58,481 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989589471]
[2024-06-20 18:42:58,481 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989589471] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:42:58,481 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:42:58,481 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 18:42:58,481 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266616635]
[2024-06-20 18:42:58,481 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:42:58,482 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 18:42:58,482 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:42:58,484 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 18:42:58,485 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-20 18:42:58,597 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:42:58,598 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 213 transitions, 2625 flow. Second operand  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 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 18:42:58,598 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:42:58,598 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:42:58,598 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:43:00,348 INFO  L124   PetriNetUnfolderBase]: 2703/4412 cut-off events.
[2024-06-20 18:43:00,349 INFO  L125   PetriNetUnfolderBase]: For 324686/324686 co-relation queries the response was YES.
[2024-06-20 18:43:00,370 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36369 conditions, 4412 events. 2703/4412 cut-off events. For 324686/324686 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 26604 event pairs, 664 based on Foata normal form. 1/4403 useless extension candidates. Maximal degree in co-relation 36288. Up to 4200 conditions per place. 
[2024-06-20 18:43:00,387 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 209 selfloop transitions, 14 changer transitions 0/232 dead transitions.
[2024-06-20 18:43:00,388 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 232 transitions, 3153 flow
[2024-06-20 18:43:00,390 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 18:43:00,390 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 18:43:00,390 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions.
[2024-06-20 18:43:00,390 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4355400696864111
[2024-06-20 18:43:00,390 INFO  L175             Difference]: Start difference. First operand has 188 places, 213 transitions, 2625 flow. Second operand 7 states and 125 transitions.
[2024-06-20 18:43:00,390 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 232 transitions, 3153 flow
[2024-06-20 18:43:00,700 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 232 transitions, 3098 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-06-20 18:43:00,703 INFO  L231             Difference]: Finished difference. Result has 190 places, 216 transitions, 2652 flow
[2024-06-20 18:43:00,704 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2570, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2652, PETRI_PLACES=190, PETRI_TRANSITIONS=216}
[2024-06-20 18:43:00,704 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 148 predicate places.
[2024-06-20 18:43:00,704 INFO  L495      AbstractCegarLoop]: Abstraction has has 190 places, 216 transitions, 2652 flow
[2024-06-20 18:43:00,704 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 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 18:43:00,704 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:43:00,704 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:43:00,704 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-20 18:43:00,705 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 18:43:00,705 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:43:00,705 INFO  L85        PathProgramCache]: Analyzing trace with hash -1400207996, now seen corresponding path program 2 times
[2024-06-20 18:43:00,705 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:43:00,705 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817389621]
[2024-06-20 18:43:00,705 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:43:00,706 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:43:00,739 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:43:10,890 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:43:10,891 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:43:10,891 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817389621]
[2024-06-20 18:43:10,891 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817389621] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:43:10,891 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:43:10,891 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 18:43:10,891 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173918368]
[2024-06-20 18:43:10,891 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:43:10,891 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 18:43:10,891 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:43:10,892 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 18:43:10,892 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 18:43:11,080 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:43:11,080 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 216 transitions, 2652 flow. Second operand  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 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 18:43:11,080 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:43:11,080 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:43:11,080 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:43:12,585 INFO  L124   PetriNetUnfolderBase]: 2708/4419 cut-off events.
[2024-06-20 18:43:12,585 INFO  L125   PetriNetUnfolderBase]: For 333157/333157 co-relation queries the response was YES.
[2024-06-20 18:43:12,609 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36801 conditions, 4419 events. 2708/4419 cut-off events. For 333157/333157 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 26593 event pairs, 665 based on Foata normal form. 1/4410 useless extension candidates. Maximal degree in co-relation 36719. Up to 4191 conditions per place. 
[2024-06-20 18:43:12,628 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 201 selfloop transitions, 26 changer transitions 0/236 dead transitions.
[2024-06-20 18:43:12,628 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 236 transitions, 3340 flow
[2024-06-20 18:43:12,629 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 18:43:12,629 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 18:43:12,629 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions.
[2024-06-20 18:43:12,629 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4425087108013937
[2024-06-20 18:43:12,629 INFO  L175             Difference]: Start difference. First operand has 190 places, 216 transitions, 2652 flow. Second operand 7 states and 127 transitions.
[2024-06-20 18:43:12,629 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 236 transitions, 3340 flow
[2024-06-20 18:43:13,098 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 236 transitions, 3280 flow, removed 18 selfloop flow, removed 5 redundant places.
[2024-06-20 18:43:13,101 INFO  L231             Difference]: Finished difference. Result has 192 places, 222 transitions, 2752 flow
[2024-06-20 18:43:13,102 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2592, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2752, PETRI_PLACES=192, PETRI_TRANSITIONS=222}
[2024-06-20 18:43:13,102 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 150 predicate places.
[2024-06-20 18:43:13,102 INFO  L495      AbstractCegarLoop]: Abstraction has has 192 places, 222 transitions, 2752 flow
[2024-06-20 18:43:13,102 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 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 18:43:13,102 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:43:13,102 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:43:13,102 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-20 18:43:13,103 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 18:43:13,103 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:43:13,103 INFO  L85        PathProgramCache]: Analyzing trace with hash -1400207810, now seen corresponding path program 1 times
[2024-06-20 18:43:13,103 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:43:13,103 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753460968]
[2024-06-20 18:43:13,103 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:43:13,104 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:43:13,138 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:43:23,253 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:43:23,254 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:43:23,254 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753460968]
[2024-06-20 18:43:23,254 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753460968] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:43:23,254 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:43:23,254 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 18:43:23,254 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73619962]
[2024-06-20 18:43:23,254 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:43:23,255 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 18:43:23,255 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:43:23,255 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 18:43:23,255 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 18:43:23,443 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:43:23,444 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 222 transitions, 2752 flow. Second operand  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 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 18:43:23,444 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:43:23,444 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:43:23,444 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:43:25,026 INFO  L124   PetriNetUnfolderBase]: 2726/4446 cut-off events.
[2024-06-20 18:43:25,026 INFO  L125   PetriNetUnfolderBase]: For 346406/346406 co-relation queries the response was YES.
[2024-06-20 18:43:25,057 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37394 conditions, 4446 events. 2726/4446 cut-off events. For 346406/346406 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 26715 event pairs, 665 based on Foata normal form. 2/4438 useless extension candidates. Maximal degree in co-relation 37311. Up to 4213 conditions per place. 
[2024-06-20 18:43:25,079 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 213 selfloop transitions, 25 changer transitions 0/247 dead transitions.
[2024-06-20 18:43:25,080 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 247 transitions, 3450 flow
[2024-06-20 18:43:25,080 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 18:43:25,080 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 18:43:25,081 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions.
[2024-06-20 18:43:25,081 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44947735191637633
[2024-06-20 18:43:25,081 INFO  L175             Difference]: Start difference. First operand has 192 places, 222 transitions, 2752 flow. Second operand 7 states and 129 transitions.
[2024-06-20 18:43:25,081 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 247 transitions, 3450 flow
[2024-06-20 18:43:25,460 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 247 transitions, 3390 flow, removed 22 selfloop flow, removed 3 redundant places.
[2024-06-20 18:43:25,463 INFO  L231             Difference]: Finished difference. Result has 197 places, 231 transitions, 2848 flow
[2024-06-20 18:43:25,464 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2692, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2848, PETRI_PLACES=197, PETRI_TRANSITIONS=231}
[2024-06-20 18:43:25,467 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 155 predicate places.
[2024-06-20 18:43:25,467 INFO  L495      AbstractCegarLoop]: Abstraction has has 197 places, 231 transitions, 2848 flow
[2024-06-20 18:43:25,468 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 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 18:43:25,468 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:43:25,468 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:43:25,468 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-20 18:43:25,468 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 18:43:25,468 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:43:25,468 INFO  L85        PathProgramCache]: Analyzing trace with hash -1831250658, now seen corresponding path program 2 times
[2024-06-20 18:43:25,469 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:43:25,469 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315648623]
[2024-06-20 18:43:25,469 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:43:25,469 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:43:25,522 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:43:35,612 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 18:43:35,612 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:43:35,613 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315648623]
[2024-06-20 18:43:35,613 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315648623] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:43:35,613 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:43:35,613 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 18:43:35,613 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438488058]
[2024-06-20 18:43:35,613 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:43:35,613 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 18:43:35,613 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:43:35,614 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 18:43:35,614 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-20 18:43:35,788 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:43:35,788 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 231 transitions, 2848 flow. Second operand  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 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 18:43:35,788 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:43:35,789 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:43:35,789 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:43:37,406 INFO  L124   PetriNetUnfolderBase]: 2736/4462 cut-off events.
[2024-06-20 18:43:37,406 INFO  L125   PetriNetUnfolderBase]: For 356653/356653 co-relation queries the response was YES.
[2024-06-20 18:43:37,429 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38109 conditions, 4462 events. 2736/4462 cut-off events. For 356653/356653 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 26837 event pairs, 663 based on Foata normal form. 2/4454 useless extension candidates. Maximal degree in co-relation 38023. Up to 4253 conditions per place. 
[2024-06-20 18:43:37,448 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 220 selfloop transitions, 16 changer transitions 0/245 dead transitions.
[2024-06-20 18:43:37,448 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 245 transitions, 3386 flow
[2024-06-20 18:43:37,449 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 18:43:37,449 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 18:43:37,452 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions.
[2024-06-20 18:43:37,452 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4181184668989547
[2024-06-20 18:43:37,452 INFO  L175             Difference]: Start difference. First operand has 197 places, 231 transitions, 2848 flow. Second operand 7 states and 120 transitions.
[2024-06-20 18:43:37,453 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 245 transitions, 3386 flow
[2024-06-20 18:43:37,900 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 245 transitions, 3346 flow, removed 17 selfloop flow, removed 2 redundant places.
[2024-06-20 18:43:37,903 INFO  L231             Difference]: Finished difference. Result has 202 places, 234 transitions, 2891 flow
[2024-06-20 18:43:37,903 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2810, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2891, PETRI_PLACES=202, PETRI_TRANSITIONS=234}
[2024-06-20 18:43:37,904 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 160 predicate places.
[2024-06-20 18:43:37,904 INFO  L495      AbstractCegarLoop]: Abstraction has has 202 places, 234 transitions, 2891 flow
[2024-06-20 18:43:37,904 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 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 18:43:37,904 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:43:37,904 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:43:37,904 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-20 18:43:37,904 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 18:43:37,905 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:43:37,905 INFO  L85        PathProgramCache]: Analyzing trace with hash 1194372136, now seen corresponding path program 3 times
[2024-06-20 18:43:37,905 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:43:37,905 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977969346]
[2024-06-20 18:43:37,905 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:43:37,905 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:43:37,954 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:43:48,535 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 18:43:48,535 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:43:48,535 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977969346]
[2024-06-20 18:43:48,535 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977969346] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:43:48,536 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:43:48,536 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 18:43:48,536 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030891069]
[2024-06-20 18:43:48,536 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:43:48,536 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 18:43:48,536 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:43:48,537 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 18:43:48,537 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 18:43:48,681 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:43:48,681 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 234 transitions, 2891 flow. Second operand  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 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 18:43:48,681 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:43:48,682 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:43:48,682 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:43:50,261 INFO  L124   PetriNetUnfolderBase]: 2733/4458 cut-off events.
[2024-06-20 18:43:50,262 INFO  L125   PetriNetUnfolderBase]: For 363008/363008 co-relation queries the response was YES.
[2024-06-20 18:43:50,291 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38201 conditions, 4458 events. 2733/4458 cut-off events. For 363008/363008 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 26835 event pairs, 663 based on Foata normal form. 1/4449 useless extension candidates. Maximal degree in co-relation 38112. Up to 4254 conditions per place. 
[2024-06-20 18:43:50,311 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 221 selfloop transitions, 14 changer transitions 0/244 dead transitions.
[2024-06-20 18:43:50,311 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 244 transitions, 3385 flow
[2024-06-20 18:43:50,313 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 18:43:50,313 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 18:43:50,313 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions.
[2024-06-20 18:43:50,313 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4146341463414634
[2024-06-20 18:43:50,313 INFO  L175             Difference]: Start difference. First operand has 202 places, 234 transitions, 2891 flow. Second operand 7 states and 119 transitions.
[2024-06-20 18:43:50,313 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 244 transitions, 3385 flow
[2024-06-20 18:43:50,862 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 244 transitions, 3298 flow, removed 28 selfloop flow, removed 5 redundant places.
[2024-06-20 18:43:50,865 INFO  L231             Difference]: Finished difference. Result has 204 places, 234 transitions, 2838 flow
[2024-06-20 18:43:50,865 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2804, PETRI_DIFFERENCE_MINUEND_PLACES=197, 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=2838, PETRI_PLACES=204, PETRI_TRANSITIONS=234}
[2024-06-20 18:43:50,865 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 162 predicate places.
[2024-06-20 18:43:50,865 INFO  L495      AbstractCegarLoop]: Abstraction has has 204 places, 234 transitions, 2838 flow
[2024-06-20 18:43:50,866 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 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 18:43:50,866 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:43:50,866 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:43:50,866 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-20 18:43:50,866 INFO  L420      AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:43:50,867 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:43:50,867 INFO  L85        PathProgramCache]: Analyzing trace with hash 1194372322, now seen corresponding path program 3 times
[2024-06-20 18:43:50,867 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:43:50,867 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692500796]
[2024-06-20 18:43:50,867 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:43:50,867 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:43:50,902 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:44:00,876 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 18:44:00,876 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:44:00,876 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692500796]
[2024-06-20 18:44:00,876 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692500796] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:44:00,876 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:44:00,876 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 18:44:00,877 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753269719]
[2024-06-20 18:44:00,877 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:44:00,877 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 18:44:00,877 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:44:00,877 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 18:44:00,877 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 18:44:01,039 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:44:01,040 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 234 transitions, 2838 flow. Second operand  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 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 18:44:01,040 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:44:01,040 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:44:01,040 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:44:02,632 INFO  L124   PetriNetUnfolderBase]: 2727/4450 cut-off events.
[2024-06-20 18:44:02,633 INFO  L125   PetriNetUnfolderBase]: For 370217/370217 co-relation queries the response was YES.
[2024-06-20 18:44:02,659 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38139 conditions, 4450 events. 2727/4450 cut-off events. For 370217/370217 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 26878 event pairs, 662 based on Foata normal form. 2/4442 useless extension candidates. Maximal degree in co-relation 38050. Up to 4232 conditions per place. 
[2024-06-20 18:44:02,678 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 216 selfloop transitions, 21 changer transitions 0/246 dead transitions.
[2024-06-20 18:44:02,678 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 246 transitions, 3344 flow
[2024-06-20 18:44:02,679 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 18:44:02,679 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 18:44:02,679 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions.
[2024-06-20 18:44:02,679 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-20 18:44:02,679 INFO  L175             Difference]: Start difference. First operand has 204 places, 234 transitions, 2838 flow. Second operand 7 states and 123 transitions.
[2024-06-20 18:44:02,679 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 246 transitions, 3344 flow
[2024-06-20 18:44:03,083 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 246 transitions, 3286 flow, removed 11 selfloop flow, removed 6 redundant places.
[2024-06-20 18:44:03,086 INFO  L231             Difference]: Finished difference. Result has 205 places, 234 transitions, 2828 flow
[2024-06-20 18:44:03,087 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2780, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2828, PETRI_PLACES=205, PETRI_TRANSITIONS=234}
[2024-06-20 18:44:03,087 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 163 predicate places.
[2024-06-20 18:44:03,087 INFO  L495      AbstractCegarLoop]: Abstraction has has 205 places, 234 transitions, 2828 flow
[2024-06-20 18:44:03,087 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 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 18:44:03,087 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:44:03,087 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 18:44:03,088 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-20 18:44:03,088 INFO  L420      AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:44:03,088 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:44:03,088 INFO  L85        PathProgramCache]: Analyzing trace with hash -172692425, now seen corresponding path program 1 times
[2024-06-20 18:44:03,088 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:44:03,088 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908235187]
[2024-06-20 18:44:03,088 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:44:03,089 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:44:03,139 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:44:14,037 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 18:44:14,038 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:44:14,038 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908235187]
[2024-06-20 18:44:14,038 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908235187] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:44:14,038 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:44:14,038 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 18:44:14,038 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663539261]
[2024-06-20 18:44:14,038 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:44:14,039 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 18:44:14,039 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:44:14,040 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 18:44:14,040 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2024-06-20 18:44:14,335 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:44:14,335 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 234 transitions, 2828 flow. Second operand  has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:44:14,335 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:44:14,335 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:44:14,335 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:44:16,222 INFO  L124   PetriNetUnfolderBase]: 2810/4545 cut-off events.
[2024-06-20 18:44:16,223 INFO  L125   PetriNetUnfolderBase]: For 428547/428551 co-relation queries the response was YES.
[2024-06-20 18:44:16,247 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40457 conditions, 4545 events. 2810/4545 cut-off events. For 428547/428551 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 26981 event pairs, 507 based on Foata normal form. 4/4542 useless extension candidates. Maximal degree in co-relation 40367. Up to 4204 conditions per place. 
[2024-06-20 18:44:16,265 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 247 selfloop transitions, 19 changer transitions 0/279 dead transitions.
[2024-06-20 18:44:16,265 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 279 transitions, 3570 flow
[2024-06-20 18:44:16,267 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 18:44:16,267 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 18:44:16,267 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 186 transitions.
[2024-06-20 18:44:16,267 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45365853658536587
[2024-06-20 18:44:16,268 INFO  L175             Difference]: Start difference. First operand has 205 places, 234 transitions, 2828 flow. Second operand 10 states and 186 transitions.
[2024-06-20 18:44:16,268 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 279 transitions, 3570 flow
[2024-06-20 18:44:16,788 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 279 transitions, 3501 flow, removed 8 selfloop flow, removed 6 redundant places.
[2024-06-20 18:44:16,791 INFO  L231             Difference]: Finished difference. Result has 210 places, 238 transitions, 2921 flow
[2024-06-20 18:44:16,792 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2759, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2921, PETRI_PLACES=210, PETRI_TRANSITIONS=238}
[2024-06-20 18:44:16,792 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 168 predicate places.
[2024-06-20 18:44:16,792 INFO  L495      AbstractCegarLoop]: Abstraction has has 210 places, 238 transitions, 2921 flow
[2024-06-20 18:44:16,792 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:44:16,792 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:44:16,792 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 18:44:16,793 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-20 18:44:16,793 INFO  L420      AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:44:16,793 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:44:16,793 INFO  L85        PathProgramCache]: Analyzing trace with hash -54604745, now seen corresponding path program 2 times
[2024-06-20 18:44:16,793 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:44:16,793 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046169247]
[2024-06-20 18:44:16,793 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:44:16,793 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:44:16,853 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:44:25,736 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 18:44:25,736 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:44:25,736 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046169247]
[2024-06-20 18:44:25,736 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046169247] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:44:25,736 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:44:25,737 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 18:44:25,737 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953269365]
[2024-06-20 18:44:25,737 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:44:25,737 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 18:44:25,737 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:44:25,737 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 18:44:25,737 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-20 18:44:26,112 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:44:26,113 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 238 transitions, 2921 flow. Second operand  has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:44:26,113 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:44:26,113 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:44:26,113 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:44:28,116 INFO  L124   PetriNetUnfolderBase]: 2868/4643 cut-off events.
[2024-06-20 18:44:28,116 INFO  L125   PetriNetUnfolderBase]: For 457940/457944 co-relation queries the response was YES.
[2024-06-20 18:44:28,142 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41785 conditions, 4643 events. 2868/4643 cut-off events. For 457940/457944 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 27863 event pairs, 635 based on Foata normal form. 12/4648 useless extension candidates. Maximal degree in co-relation 41693. Up to 4296 conditions per place. 
[2024-06-20 18:44:28,161 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 249 selfloop transitions, 20 changer transitions 0/282 dead transitions.
[2024-06-20 18:44:28,161 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 282 transitions, 3665 flow
[2024-06-20 18:44:28,163 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 18:44:28,163 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 18:44:28,164 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions.
[2024-06-20 18:44:28,164 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4560975609756098
[2024-06-20 18:44:28,164 INFO  L175             Difference]: Start difference. First operand has 210 places, 238 transitions, 2921 flow. Second operand 10 states and 187 transitions.
[2024-06-20 18:44:28,164 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 282 transitions, 3665 flow
[2024-06-20 18:44:28,632 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 282 transitions, 3534 flow, removed 49 selfloop flow, removed 7 redundant places.
[2024-06-20 18:44:28,635 INFO  L231             Difference]: Finished difference. Result has 214 places, 241 transitions, 2923 flow
[2024-06-20 18:44:28,635 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2790, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2923, PETRI_PLACES=214, PETRI_TRANSITIONS=241}
[2024-06-20 18:44:28,636 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 172 predicate places.
[2024-06-20 18:44:28,636 INFO  L495      AbstractCegarLoop]: Abstraction has has 214 places, 241 transitions, 2923 flow
[2024-06-20 18:44:28,636 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:44:28,636 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:44:28,636 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 18:44:28,636 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-20 18:44:28,637 INFO  L420      AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:44:28,637 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:44:28,637 INFO  L85        PathProgramCache]: Analyzing trace with hash -59188715, now seen corresponding path program 3 times
[2024-06-20 18:44:28,637 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:44:28,637 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058673284]
[2024-06-20 18:44:28,637 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:44:28,637 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:44:28,702 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:44:38,032 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:44:38,032 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:44:38,032 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058673284]
[2024-06-20 18:44:38,032 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058673284] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:44:38,032 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:44:38,032 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 18:44:38,032 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688547859]
[2024-06-20 18:44:38,032 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:44:38,032 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 18:44:38,032 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:44:38,033 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 18:44:38,033 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-20 18:44:38,328 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-20 18:44:38,329 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 241 transitions, 2923 flow. Second operand  has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:44:38,329 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:44:38,329 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-20 18:44:38,329 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:44:40,416 INFO  L124   PetriNetUnfolderBase]: 2909/4714 cut-off events.
[2024-06-20 18:44:40,421 INFO  L125   PetriNetUnfolderBase]: For 481789/481793 co-relation queries the response was YES.
[2024-06-20 18:44:40,448 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42503 conditions, 4714 events. 2909/4714 cut-off events. For 481789/481793 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 28412 event pairs, 640 based on Foata normal form. 12/4719 useless extension candidates. Maximal degree in co-relation 42409. Up to 4326 conditions per place. 
[2024-06-20 18:44:40,467 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 250 selfloop transitions, 23 changer transitions 0/286 dead transitions.
[2024-06-20 18:44:40,468 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 286 transitions, 3689 flow
[2024-06-20 18:44:40,470 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 18:44:40,470 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 18:44:40,470 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 179 transitions.
[2024-06-20 18:44:40,470 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43658536585365854
[2024-06-20 18:44:40,470 INFO  L175             Difference]: Start difference. First operand has 214 places, 241 transitions, 2923 flow. Second operand 10 states and 179 transitions.
[2024-06-20 18:44:40,470 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 286 transitions, 3689 flow
[2024-06-20 18:44:41,031 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 286 transitions, 3608 flow, removed 23 selfloop flow, removed 7 redundant places.
[2024-06-20 18:44:41,034 INFO  L231             Difference]: Finished difference. Result has 218 places, 244 transitions, 2994 flow
[2024-06-20 18:44:41,034 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2842, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2994, PETRI_PLACES=218, PETRI_TRANSITIONS=244}
[2024-06-20 18:44:41,036 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 176 predicate places.
[2024-06-20 18:44:41,036 INFO  L495      AbstractCegarLoop]: Abstraction has has 218 places, 244 transitions, 2994 flow
[2024-06-20 18:44:41,037 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:44:41,037 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:44:41,037 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 18:44:41,037 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2024-06-20 18:44:41,037 INFO  L420      AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:44:41,037 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:44:41,037 INFO  L85        PathProgramCache]: Analyzing trace with hash 1056842477, now seen corresponding path program 4 times
[2024-06-20 18:44:41,037 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:44:41,038 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677788677]
[2024-06-20 18:44:41,038 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:44:41,038 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:44:41,093 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:44:52,464 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 18:44:52,464 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:44:52,465 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677788677]
[2024-06-20 18:44:52,465 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677788677] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:44:52,465 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:44:52,465 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 18:44:52,465 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795221636]
[2024-06-20 18:44:52,465 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:44:52,465 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 18:44:52,465 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:44:52,466 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 18:44:52,466 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-20 18:44:52,770 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:44:52,771 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 244 transitions, 2994 flow. Second operand  has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:44:52,771 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:44:52,771 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:44:52,771 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:44:54,836 INFO  L124   PetriNetUnfolderBase]: 2950/4785 cut-off events.
[2024-06-20 18:44:54,836 INFO  L125   PetriNetUnfolderBase]: For 498253/498257 co-relation queries the response was YES.
[2024-06-20 18:44:54,866 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43370 conditions, 4785 events. 2950/4785 cut-off events. For 498253/498257 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 28942 event pairs, 655 based on Foata normal form. 12/4790 useless extension candidates. Maximal degree in co-relation 43274. Up to 4380 conditions per place. 
[2024-06-20 18:44:54,886 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 246 selfloop transitions, 28 changer transitions 0/287 dead transitions.
[2024-06-20 18:44:54,886 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 287 transitions, 3762 flow
[2024-06-20 18:44:54,888 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 18:44:54,888 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 18:44:54,889 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions.
[2024-06-20 18:44:54,889 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4560975609756098
[2024-06-20 18:44:54,889 INFO  L175             Difference]: Start difference. First operand has 218 places, 244 transitions, 2994 flow. Second operand 10 states and 187 transitions.
[2024-06-20 18:44:54,889 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 287 transitions, 3762 flow
[2024-06-20 18:44:55,491 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 287 transitions, 3658 flow, removed 31 selfloop flow, removed 7 redundant places.
[2024-06-20 18:44:55,495 INFO  L231             Difference]: Finished difference. Result has 222 places, 248 transitions, 3061 flow
[2024-06-20 18:44:55,495 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2890, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3061, PETRI_PLACES=222, PETRI_TRANSITIONS=248}
[2024-06-20 18:44:55,500 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 180 predicate places.
[2024-06-20 18:44:55,500 INFO  L495      AbstractCegarLoop]: Abstraction has has 222 places, 248 transitions, 3061 flow
[2024-06-20 18:44:55,500 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:44:55,501 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:44:55,501 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 18:44:55,501 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2024-06-20 18:44:55,501 INFO  L420      AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:44:55,502 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:44:55,502 INFO  L85        PathProgramCache]: Analyzing trace with hash 265600739, now seen corresponding path program 1 times
[2024-06-20 18:44:55,502 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:44:55,502 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749464496]
[2024-06-20 18:44:55,502 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:44:55,502 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:44:55,540 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:45:06,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 18:45:06,544 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:45:06,544 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749464496]
[2024-06-20 18:45:06,544 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749464496] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:45:06,544 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:45:06,544 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 18:45:06,544 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624477333]
[2024-06-20 18:45:06,545 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:45:06,545 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 18:45:06,545 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:45:06,545 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 18:45:06,545 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-20 18:45:06,675 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-20 18:45:06,676 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 248 transitions, 3061 flow. Second operand  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:45:06,676 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:45:06,676 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-20 18:45:06,676 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:45:08,554 INFO  L124   PetriNetUnfolderBase]: 3059/4908 cut-off events.
[2024-06-20 18:45:08,554 INFO  L125   PetriNetUnfolderBase]: For 498962/498962 co-relation queries the response was YES.
[2024-06-20 18:45:08,588 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44339 conditions, 4908 events. 3059/4908 cut-off events. For 498962/498962 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 29334 event pairs, 707 based on Foata normal form. 2/4907 useless extension candidates. Maximal degree in co-relation 44241. Up to 4726 conditions per place. 
[2024-06-20 18:45:08,610 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 252 selfloop transitions, 25 changer transitions 0/281 dead transitions.
[2024-06-20 18:45:08,611 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 281 transitions, 3982 flow
[2024-06-20 18:45:08,612 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 18:45:08,612 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 18:45:08,613 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions.
[2024-06-20 18:45:08,613 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.445993031358885
[2024-06-20 18:45:08,613 INFO  L175             Difference]: Start difference. First operand has 222 places, 248 transitions, 3061 flow. Second operand 7 states and 128 transitions.
[2024-06-20 18:45:08,613 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 281 transitions, 3982 flow
[2024-06-20 18:45:09,151 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 281 transitions, 3866 flow, removed 32 selfloop flow, removed 7 redundant places.
[2024-06-20 18:45:09,154 INFO  L231             Difference]: Finished difference. Result has 223 places, 259 transitions, 3194 flow
[2024-06-20 18:45:09,154 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2945, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3194, PETRI_PLACES=223, PETRI_TRANSITIONS=259}
[2024-06-20 18:45:09,154 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 181 predicate places.
[2024-06-20 18:45:09,155 INFO  L495      AbstractCegarLoop]: Abstraction has has 223 places, 259 transitions, 3194 flow
[2024-06-20 18:45:09,155 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:45:09,155 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:45:09,155 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 18:45:09,155 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2024-06-20 18:45:09,155 INFO  L420      AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:45:09,155 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:45:09,155 INFO  L85        PathProgramCache]: Analyzing trace with hash 401361375, now seen corresponding path program 2 times
[2024-06-20 18:45:09,156 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:45:09,156 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275310133]
[2024-06-20 18:45:09,156 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:45:09,156 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:45:09,203 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:45:19,432 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:45:19,432 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:45:19,432 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275310133]
[2024-06-20 18:45:19,433 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275310133] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:45:19,433 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:45:19,433 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 18:45:19,433 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053519068]
[2024-06-20 18:45:19,433 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:45:19,433 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 18:45:19,433 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:45:19,434 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 18:45:19,434 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-20 18:45:19,598 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-20 18:45:19,598 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 259 transitions, 3194 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 18:45:19,598 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:45:19,598 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-20 18:45:19,598 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:45:21,452 INFO  L124   PetriNetUnfolderBase]: 3069/4924 cut-off events.
[2024-06-20 18:45:21,452 INFO  L125   PetriNetUnfolderBase]: For 509525/509525 co-relation queries the response was YES.
[2024-06-20 18:45:21,482 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44817 conditions, 4924 events. 3069/4924 cut-off events. For 509525/509525 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 29447 event pairs, 707 based on Foata normal form. 2/4923 useless extension candidates. Maximal degree in co-relation 44717. Up to 4771 conditions per place. 
[2024-06-20 18:45:21,500 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 257 selfloop transitions, 19 changer transitions 0/280 dead transitions.
[2024-06-20 18:45:21,500 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 280 transitions, 3885 flow
[2024-06-20 18:45:21,500 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 18:45:21,501 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 18:45:21,501 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions.
[2024-06-20 18:45:21,501 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4250871080139373
[2024-06-20 18:45:21,501 INFO  L175             Difference]: Start difference. First operand has 223 places, 259 transitions, 3194 flow. Second operand 7 states and 122 transitions.
[2024-06-20 18:45:21,501 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 280 transitions, 3885 flow
[2024-06-20 18:45:21,950 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 280 transitions, 3769 flow, removed 54 selfloop flow, removed 2 redundant places.
[2024-06-20 18:45:21,954 INFO  L231             Difference]: Finished difference. Result has 228 places, 263 transitions, 3211 flow
[2024-06-20 18:45:21,954 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3106, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3211, PETRI_PLACES=228, PETRI_TRANSITIONS=263}
[2024-06-20 18:45:21,954 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 186 predicate places.
[2024-06-20 18:45:21,954 INFO  L495      AbstractCegarLoop]: Abstraction has has 228 places, 263 transitions, 3211 flow
[2024-06-20 18:45:21,954 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 18:45:21,954 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:45:21,955 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 18:45:21,955 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62
[2024-06-20 18:45:21,955 INFO  L420      AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:45:21,955 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:45:21,956 INFO  L85        PathProgramCache]: Analyzing trace with hash 267865429, now seen corresponding path program 1 times
[2024-06-20 18:45:21,956 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:45:21,956 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572022620]
[2024-06-20 18:45:21,956 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:45:21,956 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:45:21,984 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:45:38,089 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:45:38,090 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:45:38,090 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572022620]
[2024-06-20 18:45:38,090 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572022620] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:45:38,090 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:45:38,090 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 18:45:38,090 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666869491]
[2024-06-20 18:45:38,090 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:45:38,091 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 18:45:38,091 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:45:38,094 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 18:45:38,094 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72
[2024-06-20 18:45:38,248 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-20 18:45:38,249 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 263 transitions, 3211 flow. Second operand  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 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 18:45:38,249 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:45:38,249 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-20 18:45:38,249 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:45:40,346 INFO  L124   PetriNetUnfolderBase]: 3089/4956 cut-off events.
[2024-06-20 18:45:40,346 INFO  L125   PetriNetUnfolderBase]: For 525890/525890 co-relation queries the response was YES.
[2024-06-20 18:45:40,380 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45140 conditions, 4956 events. 3089/4956 cut-off events. For 525890/525890 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 29648 event pairs, 714 based on Foata normal form. 4/4957 useless extension candidates. Maximal degree in co-relation 45038. Up to 4703 conditions per place. 
[2024-06-20 18:45:40,402 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 249 selfloop transitions, 39 changer transitions 0/292 dead transitions.
[2024-06-20 18:45:40,403 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 292 transitions, 4129 flow
[2024-06-20 18:45:40,405 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 18:45:40,405 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 18:45:40,405 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions.
[2024-06-20 18:45:40,405 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4451219512195122
[2024-06-20 18:45:40,405 INFO  L175             Difference]: Start difference. First operand has 228 places, 263 transitions, 3211 flow. Second operand 8 states and 146 transitions.
[2024-06-20 18:45:40,405 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 292 transitions, 4129 flow
[2024-06-20 18:45:40,913 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 292 transitions, 4059 flow, removed 19 selfloop flow, removed 4 redundant places.
[2024-06-20 18:45:40,917 INFO  L231             Difference]: Finished difference. Result has 232 places, 269 transitions, 3347 flow
[2024-06-20 18:45:40,917 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3141, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3347, PETRI_PLACES=232, PETRI_TRANSITIONS=269}
[2024-06-20 18:45:40,918 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 190 predicate places.
[2024-06-20 18:45:40,918 INFO  L495      AbstractCegarLoop]: Abstraction has has 232 places, 269 transitions, 3347 flow
[2024-06-20 18:45:40,918 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 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 18:45:40,918 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:45:40,919 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 18:45:40,919 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63
[2024-06-20 18:45:40,919 INFO  L420      AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:45:40,919 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:45:40,919 INFO  L85        PathProgramCache]: Analyzing trace with hash -1084734833, now seen corresponding path program 5 times
[2024-06-20 18:45:40,919 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:45:40,919 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018713869]
[2024-06-20 18:45:40,920 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:45:40,920 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:45:40,991 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:45:50,907 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 18:45:50,908 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:45:50,908 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018713869]
[2024-06-20 18:45:50,908 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018713869] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:45:50,908 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:45:50,908 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 18:45:50,908 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508619540]
[2024-06-20 18:45:50,908 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:45:50,908 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 18:45:50,908 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:45:50,909 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 18:45:50,909 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 18:45:51,291 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:45:51,291 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 269 transitions, 3347 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:45:51,291 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:45:51,291 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:45:51,291 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:45:53,401 INFO  L124   PetriNetUnfolderBase]: 2986/4839 cut-off events.
[2024-06-20 18:45:53,402 INFO  L125   PetriNetUnfolderBase]: For 534830/534836 co-relation queries the response was YES.
[2024-06-20 18:45:53,430 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44274 conditions, 4839 events. 2986/4839 cut-off events. For 534830/534836 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 29333 event pairs, 662 based on Foata normal form. 16/4850 useless extension candidates. Maximal degree in co-relation 44171. Up to 4381 conditions per place. 
[2024-06-20 18:45:53,448 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 240 selfloop transitions, 47 changer transitions 0/305 dead transitions.
[2024-06-20 18:45:53,449 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 305 transitions, 4037 flow
[2024-06-20 18:45:53,451 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 18:45:53,451 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 18:45:53,451 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 186 transitions.
[2024-06-20 18:45:53,453 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45365853658536587
[2024-06-20 18:45:53,453 INFO  L175             Difference]: Start difference. First operand has 232 places, 269 transitions, 3347 flow. Second operand 10 states and 186 transitions.
[2024-06-20 18:45:53,453 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 305 transitions, 4037 flow
[2024-06-20 18:45:53,983 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 305 transitions, 3957 flow, removed 27 selfloop flow, removed 4 redundant places.
[2024-06-20 18:45:53,986 INFO  L231             Difference]: Finished difference. Result has 239 places, 270 transitions, 3376 flow
[2024-06-20 18:45:53,987 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3267, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3376, PETRI_PLACES=239, PETRI_TRANSITIONS=270}
[2024-06-20 18:45:53,987 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 197 predicate places.
[2024-06-20 18:45:53,987 INFO  L495      AbstractCegarLoop]: Abstraction has has 239 places, 270 transitions, 3376 flow
[2024-06-20 18:45:53,987 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:45:53,987 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:45:53,987 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 18:45:53,987 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64
[2024-06-20 18:45:53,988 INFO  L420      AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:45:53,988 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:45:53,988 INFO  L85        PathProgramCache]: Analyzing trace with hash 1330139097, now seen corresponding path program 6 times
[2024-06-20 18:45:53,988 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:45:53,988 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682020141]
[2024-06-20 18:45:53,988 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:45:53,988 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:45:54,048 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:46:02,913 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 18:46:02,914 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:46:02,914 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682020141]
[2024-06-20 18:46:02,914 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682020141] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:46:02,914 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:46:02,914 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 18:46:02,914 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071594135]
[2024-06-20 18:46:02,914 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:46:02,914 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 18:46:02,914 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:46:02,914 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 18:46:02,914 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-20 18:46:03,351 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:46:03,352 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 270 transitions, 3376 flow. Second operand  has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:46:03,352 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:46:03,352 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:46:03,352 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:46:05,576 INFO  L124   PetriNetUnfolderBase]: 3020/4893 cut-off events.
[2024-06-20 18:46:05,576 INFO  L125   PetriNetUnfolderBase]: For 542604/542610 co-relation queries the response was YES.
[2024-06-20 18:46:05,610 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44992 conditions, 4893 events. 3020/4893 cut-off events. For 542604/542610 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 29723 event pairs, 668 based on Foata normal form. 8/4896 useless extension candidates. Maximal degree in co-relation 44886. Up to 4481 conditions per place. 
[2024-06-20 18:46:05,631 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 242 selfloop transitions, 47 changer transitions 0/307 dead transitions.
[2024-06-20 18:46:05,632 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 307 transitions, 4142 flow
[2024-06-20 18:46:05,634 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 18:46:05,634 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 18:46:05,634 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 186 transitions.
[2024-06-20 18:46:05,634 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45365853658536587
[2024-06-20 18:46:05,634 INFO  L175             Difference]: Start difference. First operand has 239 places, 270 transitions, 3376 flow. Second operand 10 states and 186 transitions.
[2024-06-20 18:46:05,634 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 307 transitions, 4142 flow
[2024-06-20 18:46:06,228 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 307 transitions, 3965 flow, removed 21 selfloop flow, removed 8 redundant places.
[2024-06-20 18:46:06,231 INFO  L231             Difference]: Finished difference. Result has 242 places, 274 transitions, 3417 flow
[2024-06-20 18:46:06,231 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3199, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3417, PETRI_PLACES=242, PETRI_TRANSITIONS=274}
[2024-06-20 18:46:06,232 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 200 predicate places.
[2024-06-20 18:46:06,232 INFO  L495      AbstractCegarLoop]: Abstraction has has 242 places, 274 transitions, 3417 flow
[2024-06-20 18:46:06,232 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:46:06,232 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:46:06,232 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 18:46:06,232 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65
[2024-06-20 18:46:06,233 INFO  L420      AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:46:06,233 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:46:06,233 INFO  L85        PathProgramCache]: Analyzing trace with hash 1325555127, now seen corresponding path program 7 times
[2024-06-20 18:46:06,233 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:46:06,233 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215625417]
[2024-06-20 18:46:06,233 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:46:06,233 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:46:06,296 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:46:16,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 18:46:16,056 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:46:16,056 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215625417]
[2024-06-20 18:46:16,056 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215625417] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:46:16,056 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:46:16,056 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 18:46:16,056 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866520581]
[2024-06-20 18:46:16,056 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:46:16,056 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 18:46:16,057 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:46:16,057 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 18:46:16,057 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-20 18:46:16,412 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:46:16,413 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 274 transitions, 3417 flow. Second operand  has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:46:16,413 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:46:16,413 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:46:16,413 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:46:18,483 INFO  L124   PetriNetUnfolderBase]: 3036/4925 cut-off events.
[2024-06-20 18:46:18,483 INFO  L125   PetriNetUnfolderBase]: For 561468/561474 co-relation queries the response was YES.
[2024-06-20 18:46:18,516 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45035 conditions, 4925 events. 3036/4925 cut-off events. For 561468/561474 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 30001 event pairs, 651 based on Foata normal form. 16/4936 useless extension candidates. Maximal degree in co-relation 44928. Up to 4390 conditions per place. 
[2024-06-20 18:46:18,536 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 243 selfloop transitions, 53 changer transitions 0/314 dead transitions.
[2024-06-20 18:46:18,537 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 314 transitions, 4235 flow
[2024-06-20 18:46:18,539 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 18:46:18,539 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 18:46:18,539 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions.
[2024-06-20 18:46:18,539 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4585365853658537
[2024-06-20 18:46:18,539 INFO  L175             Difference]: Start difference. First operand has 242 places, 274 transitions, 3417 flow. Second operand 10 states and 188 transitions.
[2024-06-20 18:46:18,540 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 314 transitions, 4235 flow
[2024-06-20 18:46:19,157 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 314 transitions, 4057 flow, removed 45 selfloop flow, removed 7 redundant places.
[2024-06-20 18:46:19,160 INFO  L231             Difference]: Finished difference. Result has 246 places, 278 transitions, 3477 flow
[2024-06-20 18:46:19,168 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3239, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3477, PETRI_PLACES=246, PETRI_TRANSITIONS=278}
[2024-06-20 18:46:19,168 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 204 predicate places.
[2024-06-20 18:46:19,168 INFO  L495      AbstractCegarLoop]: Abstraction has has 246 places, 278 transitions, 3477 flow
[2024-06-20 18:46:19,168 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:46:19,168 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:46:19,168 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 18:46:19,169 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66
[2024-06-20 18:46:19,169 INFO  L420      AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:46:19,169 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:46:19,169 INFO  L85        PathProgramCache]: Analyzing trace with hash 1496372877, now seen corresponding path program 8 times
[2024-06-20 18:46:19,169 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:46:19,169 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808790308]
[2024-06-20 18:46:19,169 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:46:19,170 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:46:19,227 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:46:28,635 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 18:46:28,636 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:46:28,636 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808790308]
[2024-06-20 18:46:28,636 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808790308] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:46:28,636 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:46:28,636 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 18:46:28,636 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335139065]
[2024-06-20 18:46:28,636 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:46:28,637 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 18:46:28,637 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:46:28,637 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 18:46:28,637 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-20 18:46:28,852 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:46:28,853 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 278 transitions, 3477 flow. Second operand  has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:46:28,853 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:46:28,853 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:46:28,853 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:46:31,013 INFO  L124   PetriNetUnfolderBase]: 3052/4957 cut-off events.
[2024-06-20 18:46:31,014 INFO  L125   PetriNetUnfolderBase]: For 573792/573798 co-relation queries the response was YES.
[2024-06-20 18:46:31,048 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45194 conditions, 4957 events. 3052/4957 cut-off events. For 573792/573798 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 30289 event pairs, 679 based on Foata normal form. 16/4968 useless extension candidates. Maximal degree in co-relation 45085. Up to 4499 conditions per place. 
[2024-06-20 18:46:31,069 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 251 selfloop transitions, 45 changer transitions 0/314 dead transitions.
[2024-06-20 18:46:31,069 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 314 transitions, 4251 flow
[2024-06-20 18:46:31,071 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 18:46:31,071 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 18:46:31,071 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions.
[2024-06-20 18:46:31,072 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4585365853658537
[2024-06-20 18:46:31,072 INFO  L175             Difference]: Start difference. First operand has 246 places, 278 transitions, 3477 flow. Second operand 10 states and 188 transitions.
[2024-06-20 18:46:31,072 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 314 transitions, 4251 flow
[2024-06-20 18:46:31,736 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 314 transitions, 4073 flow, removed 38 selfloop flow, removed 7 redundant places.
[2024-06-20 18:46:31,740 INFO  L231             Difference]: Finished difference. Result has 249 places, 279 transitions, 3465 flow
[2024-06-20 18:46:31,741 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3299, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3465, PETRI_PLACES=249, PETRI_TRANSITIONS=279}
[2024-06-20 18:46:31,741 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 207 predicate places.
[2024-06-20 18:46:31,741 INFO  L495      AbstractCegarLoop]: Abstraction has has 249 places, 279 transitions, 3465 flow
[2024-06-20 18:46:31,741 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:46:31,741 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:46:31,741 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 18:46:31,741 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67
[2024-06-20 18:46:31,742 INFO  L420      AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:46:31,742 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:46:31,742 INFO  L85        PathProgramCache]: Analyzing trace with hash 1458253397, now seen corresponding path program 3 times
[2024-06-20 18:46:31,742 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:46:31,742 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917114296]
[2024-06-20 18:46:31,742 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:46:31,742 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:46:31,778 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:46:42,126 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 18:46:42,126 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:46:42,126 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917114296]
[2024-06-20 18:46:42,126 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917114296] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:46:42,126 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:46:42,126 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 18:46:42,126 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141139655]
[2024-06-20 18:46:42,126 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:46:42,126 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 18:46:42,126 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:46:42,127 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 18:46:42,127 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 18:46:42,248 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-20 18:46:42,248 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 279 transitions, 3465 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 18:46:42,248 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:46:42,248 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-20 18:46:42,248 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:46:44,181 INFO  L124   PetriNetUnfolderBase]: 3153/5067 cut-off events.
[2024-06-20 18:46:44,182 INFO  L125   PetriNetUnfolderBase]: For 569498/569504 co-relation queries the response was YES.
[2024-06-20 18:46:44,218 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45790 conditions, 5067 events. 3153/5067 cut-off events. For 569498/569504 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 30523 event pairs, 724 based on Foata normal form. 6/5068 useless extension candidates. Maximal degree in co-relation 45680. Up to 4823 conditions per place. 
[2024-06-20 18:46:44,240 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 258 selfloop transitions, 44 changer transitions 0/306 dead transitions.
[2024-06-20 18:46:44,240 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 306 transitions, 4573 flow
[2024-06-20 18:46:44,242 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 18:46:44,242 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 18:46:44,242 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions.
[2024-06-20 18:46:44,242 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44947735191637633
[2024-06-20 18:46:44,242 INFO  L175             Difference]: Start difference. First operand has 249 places, 279 transitions, 3465 flow. Second operand 7 states and 129 transitions.
[2024-06-20 18:46:44,243 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 306 transitions, 4573 flow
[2024-06-20 18:46:45,053 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 306 transitions, 4434 flow, removed 24 selfloop flow, removed 9 redundant places.
[2024-06-20 18:46:45,057 INFO  L231             Difference]: Finished difference. Result has 247 places, 285 transitions, 3567 flow
[2024-06-20 18:46:45,057 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3326, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3567, PETRI_PLACES=247, PETRI_TRANSITIONS=285}
[2024-06-20 18:46:45,057 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 205 predicate places.
[2024-06-20 18:46:45,057 INFO  L495      AbstractCegarLoop]: Abstraction has has 247 places, 285 transitions, 3567 flow
[2024-06-20 18:46:45,057 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 18:46:45,057 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:46:45,057 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 18:46:45,057 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68
[2024-06-20 18:46:45,058 INFO  L420      AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:46:45,058 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:46:45,058 INFO  L85        PathProgramCache]: Analyzing trace with hash 1469681237, now seen corresponding path program 4 times
[2024-06-20 18:46:45,058 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:46:45,058 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565247005]
[2024-06-20 18:46:45,058 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:46:45,058 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:46:45,094 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:46:55,894 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 18:46:55,894 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:46:55,894 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565247005]
[2024-06-20 18:46:55,894 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565247005] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:46:55,894 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:46:55,894 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 18:46:55,894 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194409446]
[2024-06-20 18:46:55,894 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:46:55,894 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 18:46:55,894 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:46:55,895 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 18:46:55,895 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 18:46:56,087 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-20 18:46:56,087 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 285 transitions, 3567 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 18:46:56,087 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:46:56,087 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-20 18:46:56,087 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:46:57,926 INFO  L124   PetriNetUnfolderBase]: 3163/5083 cut-off events.
[2024-06-20 18:46:57,927 INFO  L125   PetriNetUnfolderBase]: For 582198/582204 co-relation queries the response was YES.
[2024-06-20 18:46:57,962 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46174 conditions, 5083 events. 3163/5083 cut-off events. For 582198/582204 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 30658 event pairs, 724 based on Foata normal form. 6/5084 useless extension candidates. Maximal degree in co-relation 46065. Up to 4833 conditions per place. 
[2024-06-20 18:46:57,984 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 253 selfloop transitions, 48 changer transitions 0/305 dead transitions.
[2024-06-20 18:46:57,985 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 305 transitions, 4465 flow
[2024-06-20 18:46:57,985 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 18:46:57,985 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 18:46:57,985 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions.
[2024-06-20 18:46:57,986 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4355400696864111
[2024-06-20 18:46:57,986 INFO  L175             Difference]: Start difference. First operand has 247 places, 285 transitions, 3567 flow. Second operand 7 states and 125 transitions.
[2024-06-20 18:46:57,986 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 305 transitions, 4465 flow
[2024-06-20 18:46:58,683 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 305 transitions, 4298 flow, removed 64 selfloop flow, removed 3 redundant places.
[2024-06-20 18:46:58,687 INFO  L231             Difference]: Finished difference. Result has 251 places, 288 transitions, 3578 flow
[2024-06-20 18:46:58,687 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3432, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3578, PETRI_PLACES=251, PETRI_TRANSITIONS=288}
[2024-06-20 18:46:58,688 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 209 predicate places.
[2024-06-20 18:46:58,688 INFO  L495      AbstractCegarLoop]: Abstraction has has 251 places, 288 transitions, 3578 flow
[2024-06-20 18:46:58,688 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 18:46:58,688 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:46:58,688 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 18:46:58,688 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69
[2024-06-20 18:46:58,688 INFO  L420      AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:46:58,689 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:46:58,689 INFO  L85        PathProgramCache]: Analyzing trace with hash -941559753, now seen corresponding path program 5 times
[2024-06-20 18:46:58,689 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:46:58,689 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635180984]
[2024-06-20 18:46:58,689 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:46:58,689 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:46:58,723 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:47:08,676 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 18:47:08,677 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:47:08,677 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635180984]
[2024-06-20 18:47:08,677 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635180984] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:47:08,677 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:47:08,677 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 18:47:08,677 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476664362]
[2024-06-20 18:47:08,677 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:47:08,677 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 18:47:08,678 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:47:08,678 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 18:47:08,678 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 18:47:08,829 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-20 18:47:08,829 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 288 transitions, 3578 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 18:47:08,829 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:47:08,829 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-20 18:47:08,830 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:47:10,737 INFO  L124   PetriNetUnfolderBase]: 3157/5075 cut-off events.
[2024-06-20 18:47:10,738 INFO  L125   PetriNetUnfolderBase]: For 588873/588879 co-relation queries the response was YES.
[2024-06-20 18:47:10,777 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46018 conditions, 5075 events. 3157/5075 cut-off events. For 588873/588879 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 30600 event pairs, 720 based on Foata normal form. 6/5076 useless extension candidates. Maximal degree in co-relation 45907. Up to 4898 conditions per place. 
[2024-06-20 18:47:10,801 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 270 selfloop transitions, 27 changer transitions 0/301 dead transitions.
[2024-06-20 18:47:10,802 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 301 transitions, 4370 flow
[2024-06-20 18:47:10,802 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 18:47:10,802 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 18:47:10,803 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions.
[2024-06-20 18:47:10,803 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4146341463414634
[2024-06-20 18:47:10,803 INFO  L175             Difference]: Start difference. First operand has 251 places, 288 transitions, 3578 flow. Second operand 7 states and 119 transitions.
[2024-06-20 18:47:10,803 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 301 transitions, 4370 flow
[2024-06-20 18:47:11,633 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 301 transitions, 4250 flow, removed 28 selfloop flow, removed 4 redundant places.
[2024-06-20 18:47:11,637 INFO  L231             Difference]: Finished difference. Result has 254 places, 288 transitions, 3518 flow
[2024-06-20 18:47:11,637 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3458, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3518, PETRI_PLACES=254, PETRI_TRANSITIONS=288}
[2024-06-20 18:47:11,637 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 212 predicate places.
[2024-06-20 18:47:11,637 INFO  L495      AbstractCegarLoop]: Abstraction has has 254 places, 288 transitions, 3518 flow
[2024-06-20 18:47:11,638 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 18:47:11,638 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:47:11,638 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 18:47:11,638 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70
[2024-06-20 18:47:11,638 INFO  L420      AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:47:11,638 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:47:11,638 INFO  L85        PathProgramCache]: Analyzing trace with hash -1634890155, now seen corresponding path program 6 times
[2024-06-20 18:47:11,639 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:47:11,639 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818061756]
[2024-06-20 18:47:11,639 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:47:11,639 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:47:11,673 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
Killed by 15