./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_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/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_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/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_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 19:49:40,429 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-20 19:49:40,523 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-20 19:49:40,528 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-20 19:49:40,528 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-20 19:49:40,567 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-20 19:49:40,567 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-20 19:49:40,568 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-20 19:49:40,569 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-20 19:49:40,572 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-20 19:49:40,573 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-20 19:49:40,573 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-20 19:49:40,574 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-20 19:49:40,575 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-20 19:49:40,575 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-20 19:49:40,575 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-20 19:49:40,575 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-20 19:49:40,575 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-20 19:49:40,576 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-20 19:49:40,576 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-20 19:49:40,578 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-20 19:49:40,579 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-20 19:49:40,579 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-20 19:49:40,579 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-20 19:49:40,579 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-20 19:49:40,580 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-20 19:49:40,580 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-20 19:49:40,580 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-20 19:49:40,581 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-20 19:49:40,581 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-20 19:49:40,582 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-20 19:49:40,582 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-20 19:49:40,584 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-20 19:49:40,584 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-20 19:49:40,584 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-20 19:49:40,584 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-20 19:49:40,585 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-20 19:49:40,585 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-20 19:49:40,585 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-20 19:49:40,585 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-20 19:49:40,585 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-20 19:49:40,586 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-20 19:49:40,586 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-20 19:49:40,600 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false
[2024-06-20 19:49:40,858 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-20 19:49:40,890 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-20 19:49:40,893 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-20 19:49:40,893 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-20 19:49:40,894 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-20 19:49:40,895 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-06-20 19:49:41,992 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-20 19:49:42,197 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-20 19:49:42,198 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-06-20 19:49:42,217 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c41991ef0/e241d35b28614ba982d4927fb60e1b63/FLAG8bf1edb52
[2024-06-20 19:49:42,231 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c41991ef0/e241d35b28614ba982d4927fb60e1b63
[2024-06-20 19:49:42,233 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-20 19:49:42,234 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-20 19:49:42,235 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/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml
[2024-06-20 19:49:42,430 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-20 19:49:42,431 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-20 19:49:42,432 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-20 19:49:42,433 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-20 19:49:42,436 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-20 19:49:42,437 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:49:42" (1/2) ...
[2024-06-20 19:49:42,438 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ceb6b10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:49:42, skipping insertion in model container
[2024-06-20 19:49:42,438 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:49:42" (1/2) ...
[2024-06-20 19:49:42,439 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@78642c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:49:42, skipping insertion in model container
[2024-06-20 19:49:42,439 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:49:42" (2/2) ...
[2024-06-20 19:49:42,439 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ceb6b10 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:49:42, skipping insertion in model container
[2024-06-20 19:49:42,439 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:49:42" (2/2) ...
[2024-06-20 19:49:42,440 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-20 19:49:42,548 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-20 19:49:42,550 INFO  L97    edCorrectnessWitness]: Location invariant before [L834-L834] ((((((((((((((((((! multithreaded || x$r_buff1_thd0 == (_Bool)0) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! 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_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )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 )z >= 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_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 )z >= 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_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 )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_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 )z >= 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 )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (2LL + (long long )x) - (long long )z >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (2LL + (long long )y) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (2LL + (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 )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 )x$r_buff0_thd0) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (3LL - (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_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 || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p2_EAX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 1) && z <= 2) && z <= 127) && 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_p2_EAX == 0 || __unbuffered_p2_EAX == 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) || z == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_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 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || x$read_delayed_var == 0)
[2024-06-20 19:49:42,550 INFO  L97    edCorrectnessWitness]: Location invariant before [L836-L836] ((((((((((((((((((! multithreaded || x$r_buff1_thd0 == (_Bool)0) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! 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_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )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 )z >= 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_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 )z >= 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_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 )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_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 )z >= 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 )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (2LL + (long long )x) - (long long )z >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (2LL + (long long )y) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (2LL + (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 )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 )x$r_buff0_thd0) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (3LL - (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_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 || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p2_EAX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 1) && z <= 2) && z <= 127) && 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_p2_EAX == 0 || __unbuffered_p2_EAX == 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) || z == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_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 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || x$read_delayed_var == 0)
[2024-06-20 19:49:42,551 INFO  L97    edCorrectnessWitness]: Location invariant before [L837-L837] ((((((((((((((((((! multithreaded || x$r_buff1_thd0 == (_Bool)0) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! 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_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )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 )z >= 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_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 )z >= 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_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 )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_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 )z >= 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 )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (2LL + (long long )x) - (long long )z >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (2LL + (long long )y) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (2LL + (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 )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 )x$r_buff0_thd0) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (3LL - (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_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 || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p2_EAX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 1) && z <= 2) && z <= 127) && 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_p2_EAX == 0 || __unbuffered_p2_EAX == 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) || z == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_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 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || x$read_delayed_var == 0)
[2024-06-20 19:49:42,552 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-20 19:49:42,552 INFO  L106   edCorrectnessWitness]: ghost_update [L832-L832] multithreaded = 1;
[2024-06-20 19:49:42,589 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-20 19:49:42,919 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-20 19:49:42,926 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-20 19:49:43,213 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-20 19:49:43,254 INFO  L206         MainTranslator]: Completed translation
[2024-06-20 19:49:43,256 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:49:43 WrapperNode
[2024-06-20 19:49:43,256 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-20 19:49:43,257 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-20 19:49:43,258 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-20 19:49:43,258 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-20 19:49:43,263 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:49:43" (1/1) ...
[2024-06-20 19:49:43,292 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:49:43" (1/1) ...
[2024-06-20 19:49:43,382 INFO  L138                Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 125
[2024-06-20 19:49:43,383 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-20 19:49:43,384 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-20 19:49:43,384 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-20 19:49:43,384 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-20 19:49:43,393 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:49:43" (1/1) ...
[2024-06-20 19:49:43,393 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:49:43" (1/1) ...
[2024-06-20 19:49:43,421 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:49:43" (1/1) ...
[2024-06-20 19:49:43,466 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-06-20 19:49:43,466 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:49:43" (1/1) ...
[2024-06-20 19:49:43,466 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:49:43" (1/1) ...
[2024-06-20 19:49:43,511 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:49:43" (1/1) ...
[2024-06-20 19:49:43,513 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:49:43" (1/1) ...
[2024-06-20 19:49:43,535 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:49:43" (1/1) ...
[2024-06-20 19:49:43,541 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:49:43" (1/1) ...
[2024-06-20 19:49:43,561 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-20 19:49:43,562 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-20 19:49:43,562 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-20 19:49:43,562 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-20 19:49:43,563 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:49:43" (1/1) ...
[2024-06-20 19:49:43,567 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-20 19:49:43,573 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-20 19:49:43,602 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-06-20 19:49:43,651 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-06-20 19:49:43,679 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-20 19:49:43,680 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-20 19:49:43,680 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-20 19:49:43,680 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-20 19:49:43,680 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-20 19:49:43,680 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-20 19:49:43,680 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-20 19:49:43,680 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-20 19:49:43,681 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-20 19:49:43,681 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-20 19:49:43,681 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-20 19:49:43,681 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-20 19:49:43,682 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-20 19:49:43,795 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-20 19:49:43,797 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-20 19:49:44,898 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-20 19:49:44,899 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-20 19:49:45,103 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-20 19:49:45,104 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-20 19:49:45,104 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:49:45 BoogieIcfgContainer
[2024-06-20 19:49:45,104 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-20 19:49:45,106 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-20 19:49:45,106 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-20 19:49:45,109 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-20 19:49:45,109 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.06 07:49:42" (1/4) ...
[2024-06-20 19:49:45,110 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ffa3bdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 07:49:45, skipping insertion in model container
[2024-06-20 19:49:45,110 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:49:42" (2/4) ...
[2024-06-20 19:49:45,110 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ffa3bdb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 07:49:45, skipping insertion in model container
[2024-06-20 19:49:45,110 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:49:43" (3/4) ...
[2024-06-20 19:49:45,111 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ffa3bdb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 07:49:45, skipping insertion in model container
[2024-06-20 19:49:45,111 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:49:45" (4/4) ...
[2024-06-20 19:49:45,112 INFO  L112   eAbstractionObserver]: Analyzing ICFG safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-06-20 19:49:45,125 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-20 19:49:45,125 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-20 19:49:45,125 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-20 19:49:45,240 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-20 19:49:45,268 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 94 flow
[2024-06-20 19:49:45,320 INFO  L124   PetriNetUnfolderBase]: 0/38 cut-off events.
[2024-06-20 19:49:45,320 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-20 19:49:45,322 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 5. Compared 68 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 19:49:45,322 INFO  L82        GeneralOperation]: Start removeDead. Operand has 51 places, 41 transitions, 94 flow
[2024-06-20 19:49:45,325 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow
[2024-06-20 19:49:45,350 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-20 19:49:45,355 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;@4725e025, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-20 19:49:45,355 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-20 19:49:45,364 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-20 19:49:45,364 INFO  L124   PetriNetUnfolderBase]: 0/5 cut-off events.
[2024-06-20 19:49:45,364 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-20 19:49:45,364 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:49:45,365 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1]
[2024-06-20 19:49:45,365 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:49:45,389 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:49:45,389 INFO  L85        PathProgramCache]: Analyzing trace with hash 362811812, now seen corresponding path program 1 times
[2024-06-20 19:49:45,396 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:49:45,397 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589441404]
[2024-06-20 19:49:45,397 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:49:45,398 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:49:45,716 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:49:50,381 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:49:50,386 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:49:50,386 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589441404]
[2024-06-20 19:49:50,387 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589441404] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:49:50,387 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:49:50,387 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-20 19:49:50,388 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625150949]
[2024-06-20 19:49:50,389 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:49:50,396 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-20 19:49:50,400 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:49:50,420 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-20 19:49:50,421 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-20 19:49:50,478 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41
[2024-06-20 19:49:50,481 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand  has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:49:50,481 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:49:50,481 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41
[2024-06-20 19:49:50,482 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:49:51,158 INFO  L124   PetriNetUnfolderBase]: 1152/1761 cut-off events.
[2024-06-20 19:49:51,158 INFO  L125   PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES.
[2024-06-20 19:49:51,163 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3578 conditions, 1761 events. 1152/1761 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8407 event pairs, 785 based on Foata normal form. 1/1725 useless extension candidates. Maximal degree in co-relation 3566. Up to 1732 conditions per place. 
[2024-06-20 19:49:51,170 INFO  L140   encePairwiseOnDemand]: 34/41 looper letters, 31 selfloop transitions, 4 changer transitions 0/42 dead transitions.
[2024-06-20 19:49:51,171 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 169 flow
[2024-06-20 19:49:51,172 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-20 19:49:51,173 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-20 19:49:51,178 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions.
[2024-06-20 19:49:51,179 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6260162601626016
[2024-06-20 19:49:51,180 INFO  L175             Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 3 states and 77 transitions.
[2024-06-20 19:49:51,181 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 169 flow
[2024-06-20 19:49:51,183 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 164 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-20 19:49:51,184 INFO  L231             Difference]: Finished difference. Result has 42 places, 35 transitions, 100 flow
[2024-06-20 19:49:51,186 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 19:49:51,188 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places.
[2024-06-20 19:49:51,188 INFO  L495      AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 100 flow
[2024-06-20 19:49:51,188 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:49:51,188 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:49:51,188 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:49:51,189 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-20 19:49:51,189 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:49:51,189 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:49:51,189 INFO  L85        PathProgramCache]: Analyzing trace with hash 769830979, now seen corresponding path program 1 times
[2024-06-20 19:49:51,189 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:49:51,190 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616058538]
[2024-06-20 19:49:51,190 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:49:51,190 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:49:51,250 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:49:55,012 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:49:55,012 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:49:55,012 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616058538]
[2024-06-20 19:49:55,013 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616058538] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:49:55,013 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:49:55,013 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-20 19:49:55,013 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765701573]
[2024-06-20 19:49:55,013 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:49:55,014 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-20 19:49:55,014 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:49:55,015 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-20 19:49:55,015 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-06-20 19:49:55,099 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41
[2024-06-20 19:49:55,099 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 19:49:55,099 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:49:55,100 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41
[2024-06-20 19:49:55,100 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:49:55,804 INFO  L124   PetriNetUnfolderBase]: 1160/1778 cut-off events.
[2024-06-20 19:49:55,804 INFO  L125   PetriNetUnfolderBase]: For 341/349 co-relation queries the response was YES.
[2024-06-20 19:49:55,807 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4100 conditions, 1778 events. 1160/1778 cut-off events. For 341/349 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8605 event pairs, 662 based on Foata normal form. 8/1784 useless extension candidates. Maximal degree in co-relation 4088. Up to 1699 conditions per place. 
[2024-06-20 19:49:55,813 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 42 selfloop transitions, 11 changer transitions 0/60 dead transitions.
[2024-06-20 19:49:55,813 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 60 transitions, 274 flow
[2024-06-20 19:49:55,814 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-20 19:49:55,814 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-20 19:49:55,814 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions.
[2024-06-20 19:49:55,815 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6463414634146342
[2024-06-20 19:49:55,815 INFO  L175             Difference]: Start difference. First operand has 42 places, 35 transitions, 100 flow. Second operand 4 states and 106 transitions.
[2024-06-20 19:49:55,815 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 60 transitions, 274 flow
[2024-06-20 19:49:55,816 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 60 transitions, 270 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-20 19:49:55,817 INFO  L231             Difference]: Finished difference. Result has 46 places, 43 transitions, 172 flow
[2024-06-20 19:49:55,817 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=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=172, PETRI_PLACES=46, PETRI_TRANSITIONS=43}
[2024-06-20 19:49:55,818 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places.
[2024-06-20 19:49:55,818 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 172 flow
[2024-06-20 19:49:55,818 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 19:49:55,818 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:49:55,818 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:49:55,818 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-20 19:49:55,819 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:49:55,819 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:49:55,819 INFO  L85        PathProgramCache]: Analyzing trace with hash 1073228514, now seen corresponding path program 1 times
[2024-06-20 19:49:55,819 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:49:55,820 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500588267]
[2024-06-20 19:49:55,820 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:49:55,820 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:49:55,899 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:50:00,662 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:50:00,663 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:50:00,663 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500588267]
[2024-06-20 19:50:00,663 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500588267] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:50:00,663 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:50:00,663 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-20 19:50:00,664 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455195840]
[2024-06-20 19:50:00,664 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:50:00,664 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-20 19:50:00,664 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:50:00,665 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-20 19:50:00,665 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2024-06-20 19:50:00,793 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41
[2024-06-20 19:50:00,793 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 172 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 19:50:00,793 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:50:00,793 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41
[2024-06-20 19:50:00,793 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:50:01,595 INFO  L124   PetriNetUnfolderBase]: 1168/1795 cut-off events.
[2024-06-20 19:50:01,595 INFO  L125   PetriNetUnfolderBase]: For 1206/1223 co-relation queries the response was YES.
[2024-06-20 19:50:01,598 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4883 conditions, 1795 events. 1168/1795 cut-off events. For 1206/1223 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8776 event pairs, 538 based on Foata normal form. 11/1804 useless extension candidates. Maximal degree in co-relation 4868. Up to 1669 conditions per place. 
[2024-06-20 19:50:01,606 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 51 selfloop transitions, 17 changer transitions 0/75 dead transitions.
[2024-06-20 19:50:01,606 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 75 transitions, 404 flow
[2024-06-20 19:50:01,607 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 19:50:01,607 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 19:50:01,608 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions.
[2024-06-20 19:50:01,609 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6439024390243903
[2024-06-20 19:50:01,609 INFO  L175             Difference]: Start difference. First operand has 46 places, 43 transitions, 172 flow. Second operand 5 states and 132 transitions.
[2024-06-20 19:50:01,609 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 75 transitions, 404 flow
[2024-06-20 19:50:01,611 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 75 transitions, 400 flow, removed 2 selfloop flow, removed 0 redundant places.
[2024-06-20 19:50:01,612 INFO  L231             Difference]: Finished difference. Result has 51 places, 50 transitions, 251 flow
[2024-06-20 19:50:01,612 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=251, PETRI_PLACES=51, PETRI_TRANSITIONS=50}
[2024-06-20 19:50:01,613 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places.
[2024-06-20 19:50:01,613 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 251 flow
[2024-06-20 19:50:01,613 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 19:50:01,613 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:50:01,613 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:50:01,613 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-20 19:50:01,614 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:50:01,614 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:50:01,614 INFO  L85        PathProgramCache]: Analyzing trace with hash -1617039464, now seen corresponding path program 1 times
[2024-06-20 19:50:01,615 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:50:01,615 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666721066]
[2024-06-20 19:50:01,615 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:50:01,615 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:50:01,654 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:50:09,369 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:50:09,370 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:50:09,370 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666721066]
[2024-06-20 19:50:09,370 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666721066] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:50:09,370 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:50:09,370 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-20 19:50:09,370 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748091883]
[2024-06-20 19:50:09,371 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:50:09,371 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-20 19:50:09,371 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:50:09,371 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-20 19:50:09,372 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-06-20 19:50:09,451 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41
[2024-06-20 19:50:09,452 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 251 flow. Second operand  has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:50:09,452 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:50:09,452 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41
[2024-06-20 19:50:09,452 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:50:10,202 INFO  L124   PetriNetUnfolderBase]: 1163/1784 cut-off events.
[2024-06-20 19:50:10,202 INFO  L125   PetriNetUnfolderBase]: For 2228/2243 co-relation queries the response was YES.
[2024-06-20 19:50:10,205 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5480 conditions, 1784 events. 1163/1784 cut-off events. For 2228/2243 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8545 event pairs, 526 based on Foata normal form. 8/1790 useless extension candidates. Maximal degree in co-relation 5461. Up to 1738 conditions per place. 
[2024-06-20 19:50:10,211 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 50 selfloop transitions, 8 changer transitions 0/64 dead transitions.
[2024-06-20 19:50:10,211 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 64 transitions, 411 flow
[2024-06-20 19:50:10,212 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 19:50:10,212 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 19:50:10,212 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions.
[2024-06-20 19:50:10,212 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4878048780487805
[2024-06-20 19:50:10,213 INFO  L175             Difference]: Start difference. First operand has 51 places, 50 transitions, 251 flow. Second operand 5 states and 100 transitions.
[2024-06-20 19:50:10,213 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 64 transitions, 411 flow
[2024-06-20 19:50:10,215 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 64 transitions, 395 flow, removed 5 selfloop flow, removed 1 redundant places.
[2024-06-20 19:50:10,216 INFO  L231             Difference]: Finished difference. Result has 55 places, 53 transitions, 281 flow
[2024-06-20 19:50:10,216 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=281, PETRI_PLACES=55, PETRI_TRANSITIONS=53}
[2024-06-20 19:50:10,217 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places.
[2024-06-20 19:50:10,217 INFO  L495      AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 281 flow
[2024-06-20 19:50:10,217 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:50:10,217 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:50:10,217 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:50:10,218 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-20 19:50:10,218 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:50:10,218 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:50:10,218 INFO  L85        PathProgramCache]: Analyzing trace with hash 580485505, now seen corresponding path program 1 times
[2024-06-20 19:50:10,218 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:50:10,219 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765711177]
[2024-06-20 19:50:10,219 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:50:10,219 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:50:10,272 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:50:14,921 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:50:14,921 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:50:14,921 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765711177]
[2024-06-20 19:50:14,921 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765711177] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:50:14,921 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:50:14,922 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-20 19:50:14,922 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481331622]
[2024-06-20 19:50:14,922 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:50:14,923 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-20 19:50:14,923 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:50:14,924 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-20 19:50:14,924 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-06-20 19:50:15,028 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41
[2024-06-20 19:50:15,028 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 281 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 19:50:15,028 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:50:15,028 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41
[2024-06-20 19:50:15,028 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:50:15,899 INFO  L124   PetriNetUnfolderBase]: 1203/1852 cut-off events.
[2024-06-20 19:50:15,899 INFO  L125   PetriNetUnfolderBase]: For 3389/3410 co-relation queries the response was YES.
[2024-06-20 19:50:15,903 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6109 conditions, 1852 events. 1203/1852 cut-off events. For 3389/3410 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 9041 event pairs, 389 based on Foata normal form. 25/1875 useless extension candidates. Maximal degree in co-relation 6087. Up to 1638 conditions per place. 
[2024-06-20 19:50:15,911 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 62 selfloop transitions, 19 changer transitions 0/88 dead transitions.
[2024-06-20 19:50:15,911 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 88 transitions, 549 flow
[2024-06-20 19:50:15,912 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:50:15,912 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:50:15,913 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions.
[2024-06-20 19:50:15,913 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6300813008130082
[2024-06-20 19:50:15,913 INFO  L175             Difference]: Start difference. First operand has 55 places, 53 transitions, 281 flow. Second operand 6 states and 155 transitions.
[2024-06-20 19:50:15,913 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 88 transitions, 549 flow
[2024-06-20 19:50:15,916 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 88 transitions, 527 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-06-20 19:50:15,919 INFO  L231             Difference]: Finished difference. Result has 57 places, 54 transitions, 319 flow
[2024-06-20 19:50:15,919 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=319, PETRI_PLACES=57, PETRI_TRANSITIONS=54}
[2024-06-20 19:50:15,920 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 15 predicate places.
[2024-06-20 19:50:15,920 INFO  L495      AbstractCegarLoop]: Abstraction has has 57 places, 54 transitions, 319 flow
[2024-06-20 19:50:15,920 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 19:50:15,920 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:50:15,920 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:50:15,920 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-20 19:50:15,921 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:50:15,921 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:50:15,921 INFO  L85        PathProgramCache]: Analyzing trace with hash 1445347293, now seen corresponding path program 1 times
[2024-06-20 19:50:15,921 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:50:15,921 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727877151]
[2024-06-20 19:50:15,921 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:50:15,922 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:50:15,964 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:50:23,287 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:50:23,287 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:50:23,289 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727877151]
[2024-06-20 19:50:23,289 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727877151] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:50:23,289 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:50:23,289 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:50:23,290 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566709970]
[2024-06-20 19:50:23,290 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:50:23,290 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:50:23,290 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:50:23,291 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:50:23,291 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:50:23,434 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 19:50:23,435 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 54 transitions, 319 flow. Second operand  has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:50:23,435 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:50:23,435 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 19:50:23,435 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:50:24,265 INFO  L124   PetriNetUnfolderBase]: 1398/2132 cut-off events.
[2024-06-20 19:50:24,266 INFO  L125   PetriNetUnfolderBase]: For 5070/5070 co-relation queries the response was YES.
[2024-06-20 19:50:24,269 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7391 conditions, 2132 events. 1398/2132 cut-off events. For 5070/5070 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 10481 event pairs, 524 based on Foata normal form. 3/2133 useless extension candidates. Maximal degree in co-relation 7368. Up to 2065 conditions per place. 
[2024-06-20 19:50:24,279 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 60 selfloop transitions, 13 changer transitions 0/78 dead transitions.
[2024-06-20 19:50:24,279 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 78 transitions, 543 flow
[2024-06-20 19:50:24,279 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:50:24,279 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:50:24,280 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions.
[2024-06-20 19:50:24,280 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46747967479674796
[2024-06-20 19:50:24,280 INFO  L175             Difference]: Start difference. First operand has 57 places, 54 transitions, 319 flow. Second operand 6 states and 115 transitions.
[2024-06-20 19:50:24,280 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 78 transitions, 543 flow
[2024-06-20 19:50:24,282 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 78 transitions, 499 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-06-20 19:50:24,283 INFO  L231             Difference]: Finished difference. Result has 60 places, 62 transitions, 369 flow
[2024-06-20 19:50:24,284 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=369, PETRI_PLACES=60, PETRI_TRANSITIONS=62}
[2024-06-20 19:50:24,284 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places.
[2024-06-20 19:50:24,284 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 62 transitions, 369 flow
[2024-06-20 19:50:24,285 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:50:24,285 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:50:24,285 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:50:24,285 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-20 19:50:24,285 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:50:24,285 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:50:24,285 INFO  L85        PathProgramCache]: Analyzing trace with hash 796605431, now seen corresponding path program 1 times
[2024-06-20 19:50:24,286 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:50:24,286 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970746342]
[2024-06-20 19:50:24,286 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:50:24,286 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:50:24,317 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:50:31,738 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:50:31,739 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:50:31,739 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970746342]
[2024-06-20 19:50:31,739 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970746342] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:50:31,739 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:50:31,739 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:50:31,739 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622490881]
[2024-06-20 19:50:31,740 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:50:31,740 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:50:31,740 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:50:31,740 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:50:31,741 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:50:31,893 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41
[2024-06-20 19:50:31,893 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 62 transitions, 369 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 19:50:31,894 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:50:31,894 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41
[2024-06-20 19:50:31,894 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:50:32,789 INFO  L124   PetriNetUnfolderBase]: 1410/2174 cut-off events.
[2024-06-20 19:50:32,790 INFO  L125   PetriNetUnfolderBase]: For 8018/8058 co-relation queries the response was YES.
[2024-06-20 19:50:32,793 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8177 conditions, 2174 events. 1410/2174 cut-off events. For 8018/8058 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10866 event pairs, 522 based on Foata normal form. 17/2152 useless extension candidates. Maximal degree in co-relation 8151. Up to 2013 conditions per place. 
[2024-06-20 19:50:32,802 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 70 selfloop transitions, 17 changer transitions 0/95 dead transitions.
[2024-06-20 19:50:32,802 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 95 transitions, 679 flow
[2024-06-20 19:50:32,803 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:50:32,803 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:50:32,803 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions.
[2024-06-20 19:50:32,803 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4912891986062718
[2024-06-20 19:50:32,804 INFO  L175             Difference]: Start difference. First operand has 60 places, 62 transitions, 369 flow. Second operand 7 states and 141 transitions.
[2024-06-20 19:50:32,804 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 95 transitions, 679 flow
[2024-06-20 19:50:32,806 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 95 transitions, 647 flow, removed 8 selfloop flow, removed 3 redundant places.
[2024-06-20 19:50:32,808 INFO  L231             Difference]: Finished difference. Result has 66 places, 73 transitions, 482 flow
[2024-06-20 19:50:32,808 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=482, PETRI_PLACES=66, PETRI_TRANSITIONS=73}
[2024-06-20 19:50:32,808 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places.
[2024-06-20 19:50:32,809 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 73 transitions, 482 flow
[2024-06-20 19:50:32,809 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 19:50:32,809 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:50:32,809 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:50:32,809 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-20 19:50:32,809 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:50:32,810 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:50:32,810 INFO  L85        PathProgramCache]: Analyzing trace with hash 1856085611, now seen corresponding path program 2 times
[2024-06-20 19:50:32,810 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:50:32,810 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471609698]
[2024-06-20 19:50:32,810 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:50:32,810 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:50:32,843 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:50:39,987 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:50:39,987 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:50:39,987 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471609698]
[2024-06-20 19:50:39,988 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471609698] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:50:39,988 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:50:39,988 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:50:39,988 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482577664]
[2024-06-20 19:50:39,988 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:50:39,988 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:50:39,989 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:50:39,989 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:50:39,989 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:50:40,169 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41
[2024-06-20 19:50:40,169 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 73 transitions, 482 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 19:50:40,169 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:50:40,169 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41
[2024-06-20 19:50:40,170 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:50:41,087 INFO  L124   PetriNetUnfolderBase]: 1432/2214 cut-off events.
[2024-06-20 19:50:41,087 INFO  L125   PetriNetUnfolderBase]: For 10319/10359 co-relation queries the response was YES.
[2024-06-20 19:50:41,092 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9248 conditions, 2214 events. 1432/2214 cut-off events. For 10319/10359 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 11176 event pairs, 516 based on Foata normal form. 14/2189 useless extension candidates. Maximal degree in co-relation 9219. Up to 2000 conditions per place. 
[2024-06-20 19:50:41,100 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 77 selfloop transitions, 25 changer transitions 0/110 dead transitions.
[2024-06-20 19:50:41,100 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 110 transitions, 881 flow
[2024-06-20 19:50:41,101 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:50:41,101 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:50:41,101 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions.
[2024-06-20 19:50:41,101 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5121951219512195
[2024-06-20 19:50:41,102 INFO  L175             Difference]: Start difference. First operand has 66 places, 73 transitions, 482 flow. Second operand 7 states and 147 transitions.
[2024-06-20 19:50:41,102 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 110 transitions, 881 flow
[2024-06-20 19:50:41,107 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 110 transitions, 831 flow, removed 15 selfloop flow, removed 3 redundant places.
[2024-06-20 19:50:41,108 INFO  L231             Difference]: Finished difference. Result has 71 places, 83 transitions, 610 flow
[2024-06-20 19:50:41,108 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=610, PETRI_PLACES=71, PETRI_TRANSITIONS=83}
[2024-06-20 19:50:41,109 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 29 predicate places.
[2024-06-20 19:50:41,109 INFO  L495      AbstractCegarLoop]: Abstraction has has 71 places, 83 transitions, 610 flow
[2024-06-20 19:50:41,109 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 19:50:41,109 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:50:41,109 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:50:41,109 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-20 19:50:41,110 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:50:41,110 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:50:41,110 INFO  L85        PathProgramCache]: Analyzing trace with hash 803280599, now seen corresponding path program 1 times
[2024-06-20 19:50:41,110 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:50:41,110 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360870382]
[2024-06-20 19:50:41,110 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:50:41,111 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:50:41,145 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:50:49,769 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:50:49,769 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:50:49,769 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360870382]
[2024-06-20 19:50:49,769 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360870382] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:50:49,769 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:50:49,769 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:50:49,770 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192460057]
[2024-06-20 19:50:49,770 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:50:49,770 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:50:49,770 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:50:49,770 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:50:49,770 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:50:49,921 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 19:50:49,922 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 83 transitions, 610 flow. Second operand  has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:50:49,922 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:50:49,922 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 19:50:49,922 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:50:50,840 INFO  L124   PetriNetUnfolderBase]: 1480/2267 cut-off events.
[2024-06-20 19:50:50,840 INFO  L125   PetriNetUnfolderBase]: For 11242/11242 co-relation queries the response was YES.
[2024-06-20 19:50:50,845 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10000 conditions, 2267 events. 1480/2267 cut-off events. For 11242/11242 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11254 event pairs, 494 based on Foata normal form. 3/2268 useless extension candidates. Maximal degree in co-relation 9969. Up to 2170 conditions per place. 
[2024-06-20 19:50:50,852 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 85 selfloop transitions, 17 changer transitions 0/107 dead transitions.
[2024-06-20 19:50:50,852 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 107 transitions, 906 flow
[2024-06-20 19:50:50,853 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:50:50,853 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:50:50,853 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions.
[2024-06-20 19:50:50,854 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4634146341463415
[2024-06-20 19:50:50,854 INFO  L175             Difference]: Start difference. First operand has 71 places, 83 transitions, 610 flow. Second operand 7 states and 133 transitions.
[2024-06-20 19:50:50,854 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 107 transitions, 906 flow
[2024-06-20 19:50:50,860 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 107 transitions, 858 flow, removed 17 selfloop flow, removed 3 redundant places.
[2024-06-20 19:50:50,861 INFO  L231             Difference]: Finished difference. Result has 75 places, 87 transitions, 651 flow
[2024-06-20 19:50:50,861 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=651, PETRI_PLACES=75, PETRI_TRANSITIONS=87}
[2024-06-20 19:50:50,862 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 33 predicate places.
[2024-06-20 19:50:50,862 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 87 transitions, 651 flow
[2024-06-20 19:50:50,862 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:50:50,862 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:50:50,862 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:50:50,862 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-20 19:50:50,863 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:50:50,863 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:50:50,863 INFO  L85        PathProgramCache]: Analyzing trace with hash -1739363938, now seen corresponding path program 1 times
[2024-06-20 19:50:50,863 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:50:50,863 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448400760]
[2024-06-20 19:50:50,863 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:50:50,864 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:50:50,896 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:50:58,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 19:50:58,637 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:50:58,638 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448400760]
[2024-06-20 19:50:58,638 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448400760] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:50:58,638 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:50:58,638 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:50:58,638 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478570299]
[2024-06-20 19:50:58,639 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:50:58,639 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:50:58,641 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:50:58,641 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:50:58,642 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:50:58,762 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 19:50:58,763 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 87 transitions, 651 flow. Second operand  has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:50:58,763 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:50:58,763 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 19:50:58,763 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:50:59,781 INFO  L124   PetriNetUnfolderBase]: 1563/2404 cut-off events.
[2024-06-20 19:50:59,781 INFO  L125   PetriNetUnfolderBase]: For 13615/13615 co-relation queries the response was YES.
[2024-06-20 19:50:59,786 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11030 conditions, 2404 events. 1563/2404 cut-off events. For 13615/13615 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 11987 event pairs, 470 based on Foata normal form. 10/2412 useless extension candidates. Maximal degree in co-relation 10997. Up to 2192 conditions per place. 
[2024-06-20 19:50:59,794 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 102 selfloop transitions, 26 changer transitions 0/133 dead transitions.
[2024-06-20 19:50:59,795 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 133 transitions, 1162 flow
[2024-06-20 19:50:59,795 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:50:59,795 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:50:59,796 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions.
[2024-06-20 19:50:59,796 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4847560975609756
[2024-06-20 19:50:59,796 INFO  L175             Difference]: Start difference. First operand has 75 places, 87 transitions, 651 flow. Second operand 8 states and 159 transitions.
[2024-06-20 19:50:59,796 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 133 transitions, 1162 flow
[2024-06-20 19:50:59,803 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 133 transitions, 1101 flow, removed 16 selfloop flow, removed 5 redundant places.
[2024-06-20 19:50:59,805 INFO  L231             Difference]: Finished difference. Result has 81 places, 105 transitions, 860 flow
[2024-06-20 19:50:59,805 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=860, PETRI_PLACES=81, PETRI_TRANSITIONS=105}
[2024-06-20 19:50:59,806 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 39 predicate places.
[2024-06-20 19:50:59,806 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 105 transitions, 860 flow
[2024-06-20 19:50:59,806 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:50:59,806 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:50:59,806 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:50:59,806 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-20 19:50:59,806 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:50:59,807 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:50:59,807 INFO  L85        PathProgramCache]: Analyzing trace with hash 1704347388, now seen corresponding path program 2 times
[2024-06-20 19:50:59,807 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:50:59,807 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775309336]
[2024-06-20 19:50:59,807 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:50:59,807 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:50:59,840 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:51:08,092 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:51:08,092 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:51:08,093 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775309336]
[2024-06-20 19:51:08,093 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775309336] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:51:08,093 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:51:08,093 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:51:08,093 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074359799]
[2024-06-20 19:51:08,093 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:51:08,093 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:51:08,094 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:51:08,094 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:51:08,094 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:51:08,238 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 19:51:08,238 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 105 transitions, 860 flow. Second operand  has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:51:08,238 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:51:08,238 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 19:51:08,238 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:51:09,383 INFO  L124   PetriNetUnfolderBase]: 1794/2770 cut-off events.
[2024-06-20 19:51:09,384 INFO  L125   PetriNetUnfolderBase]: For 18528/18528 co-relation queries the response was YES.
[2024-06-20 19:51:09,390 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13635 conditions, 2770 events. 1794/2770 cut-off events. For 18528/18528 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 14294 event pairs, 492 based on Foata normal form. 10/2778 useless extension candidates. Maximal degree in co-relation 13598. Up to 2248 conditions per place. 
[2024-06-20 19:51:09,424 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 115 selfloop transitions, 45 changer transitions 0/165 dead transitions.
[2024-06-20 19:51:09,424 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 165 transitions, 1632 flow
[2024-06-20 19:51:09,425 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:51:09,425 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:51:09,425 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 172 transitions.
[2024-06-20 19:51:09,426 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.524390243902439
[2024-06-20 19:51:09,426 INFO  L175             Difference]: Start difference. First operand has 81 places, 105 transitions, 860 flow. Second operand 8 states and 172 transitions.
[2024-06-20 19:51:09,426 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 165 transitions, 1632 flow
[2024-06-20 19:51:09,437 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 165 transitions, 1572 flow, removed 27 selfloop flow, removed 2 redundant places.
[2024-06-20 19:51:09,440 INFO  L231             Difference]: Finished difference. Result has 89 places, 123 transitions, 1133 flow
[2024-06-20 19:51:09,441 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1133, PETRI_PLACES=89, PETRI_TRANSITIONS=123}
[2024-06-20 19:51:09,442 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 47 predicate places.
[2024-06-20 19:51:09,442 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 123 transitions, 1133 flow
[2024-06-20 19:51:09,442 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:51:09,442 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:51:09,442 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:51:09,443 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-20 19:51:09,443 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:51:09,443 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:51:09,443 INFO  L85        PathProgramCache]: Analyzing trace with hash 1704080478, now seen corresponding path program 3 times
[2024-06-20 19:51:09,443 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:51:09,443 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624169273]
[2024-06-20 19:51:09,443 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:51:09,444 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:51:09,477 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:51:17,640 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:51:17,641 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:51:17,641 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624169273]
[2024-06-20 19:51:17,641 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624169273] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:51:17,641 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:51:17,641 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:51:17,641 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737320797]
[2024-06-20 19:51:17,641 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:51:17,642 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:51:17,642 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:51:17,643 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:51:17,643 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:51:17,748 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 19:51:17,749 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 123 transitions, 1133 flow. Second operand  has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:51:17,749 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:51:17,749 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 19:51:17,750 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:51:18,865 INFO  L124   PetriNetUnfolderBase]: 1827/2826 cut-off events.
[2024-06-20 19:51:18,865 INFO  L125   PetriNetUnfolderBase]: For 24173/24173 co-relation queries the response was YES.
[2024-06-20 19:51:18,872 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15325 conditions, 2826 events. 1827/2826 cut-off events. For 24173/24173 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 14682 event pairs, 492 based on Foata normal form. 10/2834 useless extension candidates. Maximal degree in co-relation 15284. Up to 2277 conditions per place. 
[2024-06-20 19:51:18,894 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 115 selfloop transitions, 51 changer transitions 0/171 dead transitions.
[2024-06-20 19:51:18,894 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 171 transitions, 1814 flow
[2024-06-20 19:51:18,895 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:51:18,895 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:51:18,895 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 172 transitions.
[2024-06-20 19:51:18,895 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.524390243902439
[2024-06-20 19:51:18,896 INFO  L175             Difference]: Start difference. First operand has 89 places, 123 transitions, 1133 flow. Second operand 8 states and 172 transitions.
[2024-06-20 19:51:18,896 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 171 transitions, 1814 flow
[2024-06-20 19:51:18,915 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 171 transitions, 1725 flow, removed 37 selfloop flow, removed 3 redundant places.
[2024-06-20 19:51:18,917 INFO  L231             Difference]: Finished difference. Result has 96 places, 133 transitions, 1351 flow
[2024-06-20 19:51:18,917 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1054, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1351, PETRI_PLACES=96, PETRI_TRANSITIONS=133}
[2024-06-20 19:51:18,918 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 54 predicate places.
[2024-06-20 19:51:18,918 INFO  L495      AbstractCegarLoop]: Abstraction has has 96 places, 133 transitions, 1351 flow
[2024-06-20 19:51:18,918 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:51:18,918 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:51:18,919 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:51:18,919 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-20 19:51:18,919 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:51:18,919 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:51:18,919 INFO  L85        PathProgramCache]: Analyzing trace with hash 1704357308, now seen corresponding path program 1 times
[2024-06-20 19:51:18,919 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:51:18,919 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646554326]
[2024-06-20 19:51:18,920 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:51:18,920 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:51:18,961 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:51:28,262 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:51:28,262 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:51:28,262 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646554326]
[2024-06-20 19:51:28,262 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646554326] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:51:28,263 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:51:28,263 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:51:28,263 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628591049]
[2024-06-20 19:51:28,263 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:51:28,263 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:51:28,264 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:51:28,265 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:51:28,265 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:51:28,449 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 19:51:28,450 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 133 transitions, 1351 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 19:51:28,450 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:51:28,450 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 19:51:28,450 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:51:29,571 INFO  L124   PetriNetUnfolderBase]: 1827/2819 cut-off events.
[2024-06-20 19:51:29,571 INFO  L125   PetriNetUnfolderBase]: For 27228/27228 co-relation queries the response was YES.
[2024-06-20 19:51:29,578 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15991 conditions, 2819 events. 1827/2819 cut-off events. For 27228/27228 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 14550 event pairs, 509 based on Foata normal form. 6/2823 useless extension candidates. Maximal degree in co-relation 15946. Up to 2636 conditions per place. 
[2024-06-20 19:51:29,587 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 135 selfloop transitions, 20 changer transitions 0/160 dead transitions.
[2024-06-20 19:51:29,588 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 160 transitions, 1773 flow
[2024-06-20 19:51:29,588 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:51:29,588 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:51:29,589 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions.
[2024-06-20 19:51:29,589 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4603658536585366
[2024-06-20 19:51:29,589 INFO  L175             Difference]: Start difference. First operand has 96 places, 133 transitions, 1351 flow. Second operand 8 states and 151 transitions.
[2024-06-20 19:51:29,589 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 160 transitions, 1773 flow
[2024-06-20 19:51:29,610 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 160 transitions, 1696 flow, removed 22 selfloop flow, removed 4 redundant places.
[2024-06-20 19:51:29,615 INFO  L231             Difference]: Finished difference. Result has 100 places, 136 transitions, 1380 flow
[2024-06-20 19:51:29,615 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1274, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1380, PETRI_PLACES=100, PETRI_TRANSITIONS=136}
[2024-06-20 19:51:29,616 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 58 predicate places.
[2024-06-20 19:51:29,616 INFO  L495      AbstractCegarLoop]: Abstraction has has 100 places, 136 transitions, 1380 flow
[2024-06-20 19:51:29,617 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 19:51:29,617 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:51:29,617 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:51:29,617 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-20 19:51:29,618 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:51:29,618 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:51:29,618 INFO  L85        PathProgramCache]: Analyzing trace with hash 1028916310, now seen corresponding path program 1 times
[2024-06-20 19:51:29,618 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:51:29,618 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527792632]
[2024-06-20 19:51:29,618 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:51:29,619 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:51:29,693 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:51:37,820 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:51:37,821 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:51:37,821 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527792632]
[2024-06-20 19:51:37,821 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527792632] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:51:37,821 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:51:37,821 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:51:37,821 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359472962]
[2024-06-20 19:51:37,821 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:51:37,821 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:51:37,821 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:51:37,821 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:51:37,822 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:51:37,971 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41
[2024-06-20 19:51:37,971 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 136 transitions, 1380 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 19:51:37,971 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:51:37,971 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41
[2024-06-20 19:51:37,972 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:51:39,099 INFO  L124   PetriNetUnfolderBase]: 1798/2793 cut-off events.
[2024-06-20 19:51:39,100 INFO  L125   PetriNetUnfolderBase]: For 29596/29611 co-relation queries the response was YES.
[2024-06-20 19:51:39,107 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16011 conditions, 2793 events. 1798/2793 cut-off events. For 29596/29611 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 14568 event pairs, 492 based on Foata normal form. 7/2784 useless extension candidates. Maximal degree in co-relation 15965. Up to 2523 conditions per place. 
[2024-06-20 19:51:39,118 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 129 selfloop transitions, 28 changer transitions 0/174 dead transitions.
[2024-06-20 19:51:39,118 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 174 transitions, 1892 flow
[2024-06-20 19:51:39,119 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:51:39,119 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:51:39,119 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions.
[2024-06-20 19:51:39,120 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4969512195121951
[2024-06-20 19:51:39,120 INFO  L175             Difference]: Start difference. First operand has 100 places, 136 transitions, 1380 flow. Second operand 8 states and 163 transitions.
[2024-06-20 19:51:39,120 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 174 transitions, 1892 flow
[2024-06-20 19:51:39,144 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 174 transitions, 1810 flow, removed 23 selfloop flow, removed 6 redundant places.
[2024-06-20 19:51:39,146 INFO  L231             Difference]: Finished difference. Result has 104 places, 146 transitions, 1499 flow
[2024-06-20 19:51:39,146 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1298, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1499, PETRI_PLACES=104, PETRI_TRANSITIONS=146}
[2024-06-20 19:51:39,147 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 62 predicate places.
[2024-06-20 19:51:39,147 INFO  L495      AbstractCegarLoop]: Abstraction has has 104 places, 146 transitions, 1499 flow
[2024-06-20 19:51:39,147 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 19:51:39,147 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:51:39,147 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:51:39,148 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-20 19:51:39,148 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:51:39,148 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:51:39,148 INFO  L85        PathProgramCache]: Analyzing trace with hash -1794437710, now seen corresponding path program 1 times
[2024-06-20 19:51:39,148 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:51:39,148 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946380894]
[2024-06-20 19:51:39,148 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:51:39,149 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:51:39,192 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:51:47,544 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:51:47,544 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:51:47,544 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946380894]
[2024-06-20 19:51:47,545 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946380894] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:51:47,545 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:51:47,545 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:51:47,545 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164664228]
[2024-06-20 19:51:47,545 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:51:47,545 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:51:47,545 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:51:47,546 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:51:47,546 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:51:47,682 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 19:51:47,682 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 146 transitions, 1499 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 19:51:47,682 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:51:47,683 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 19:51:47,683 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:51:48,892 INFO  L124   PetriNetUnfolderBase]: 1895/2922 cut-off events.
[2024-06-20 19:51:48,892 INFO  L125   PetriNetUnfolderBase]: For 33946/33946 co-relation queries the response was YES.
[2024-06-20 19:51:48,901 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17552 conditions, 2922 events. 1895/2922 cut-off events. For 33946/33946 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 15159 event pairs, 464 based on Foata normal form. 5/2925 useless extension candidates. Maximal degree in co-relation 17503. Up to 2666 conditions per place. 
[2024-06-20 19:51:48,911 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 156 selfloop transitions, 39 changer transitions 0/200 dead transitions.
[2024-06-20 19:51:48,911 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 200 transitions, 2293 flow
[2024-06-20 19:51:48,913 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:51:48,913 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:51:48,914 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 181 transitions.
[2024-06-20 19:51:48,914 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4905149051490515
[2024-06-20 19:51:48,914 INFO  L175             Difference]: Start difference. First operand has 104 places, 146 transitions, 1499 flow. Second operand 9 states and 181 transitions.
[2024-06-20 19:51:48,914 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 200 transitions, 2293 flow
[2024-06-20 19:51:48,941 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 200 transitions, 2210 flow, removed 25 selfloop flow, removed 4 redundant places.
[2024-06-20 19:51:48,943 INFO  L231             Difference]: Finished difference. Result has 112 places, 167 transitions, 1783 flow
[2024-06-20 19:51:48,943 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1416, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1783, PETRI_PLACES=112, PETRI_TRANSITIONS=167}
[2024-06-20 19:51:48,944 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 70 predicate places.
[2024-06-20 19:51:48,944 INFO  L495      AbstractCegarLoop]: Abstraction has has 112 places, 167 transitions, 1783 flow
[2024-06-20 19:51:48,944 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 19:51:48,944 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:51:48,944 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:51:48,944 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-20 19:51:48,945 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:51:48,945 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:51:48,945 INFO  L85        PathProgramCache]: Analyzing trace with hash 1206167800, now seen corresponding path program 2 times
[2024-06-20 19:51:48,945 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:51:48,945 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502458671]
[2024-06-20 19:51:48,945 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:51:48,945 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:51:49,004 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:51:57,642 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:51:57,643 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:51:57,643 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502458671]
[2024-06-20 19:51:57,645 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502458671] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:51:57,646 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:51:57,646 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:51:57,646 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562075896]
[2024-06-20 19:51:57,646 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:51:57,647 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:51:57,647 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:51:57,648 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:51:57,648 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:51:57,769 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41
[2024-06-20 19:51:57,769 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 167 transitions, 1783 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 19:51:57,769 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:51:57,769 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41
[2024-06-20 19:51:57,769 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:51:58,947 INFO  L124   PetriNetUnfolderBase]: 1862/2903 cut-off events.
[2024-06-20 19:51:58,947 INFO  L125   PetriNetUnfolderBase]: For 39898/39907 co-relation queries the response was YES.
[2024-06-20 19:51:58,955 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18264 conditions, 2903 events. 1862/2903 cut-off events. For 39898/39907 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 15333 event pairs, 440 based on Foata normal form. 17/2911 useless extension candidates. Maximal degree in co-relation 18211. Up to 2454 conditions per place. 
[2024-06-20 19:51:58,965 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 130 selfloop transitions, 55 changer transitions 0/205 dead transitions.
[2024-06-20 19:51:58,965 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 205 transitions, 2433 flow
[2024-06-20 19:51:58,966 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:51:58,966 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:51:58,966 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 168 transitions.
[2024-06-20 19:51:58,967 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5121951219512195
[2024-06-20 19:51:58,967 INFO  L175             Difference]: Start difference. First operand has 112 places, 167 transitions, 1783 flow. Second operand 8 states and 168 transitions.
[2024-06-20 19:51:58,967 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 205 transitions, 2433 flow
[2024-06-20 19:51:58,999 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 205 transitions, 2301 flow, removed 57 selfloop flow, removed 3 redundant places.
[2024-06-20 19:51:59,001 INFO  L231             Difference]: Finished difference. Result has 117 places, 174 transitions, 1902 flow
[2024-06-20 19:51:59,001 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1651, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1902, PETRI_PLACES=117, PETRI_TRANSITIONS=174}
[2024-06-20 19:51:59,002 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 75 predicate places.
[2024-06-20 19:51:59,002 INFO  L495      AbstractCegarLoop]: Abstraction has has 117 places, 174 transitions, 1902 flow
[2024-06-20 19:51:59,002 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 19:51:59,002 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:51:59,002 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:51:59,002 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-20 19:51:59,003 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:51:59,003 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:51:59,003 INFO  L85        PathProgramCache]: Analyzing trace with hash 1286888682, now seen corresponding path program 2 times
[2024-06-20 19:51:59,003 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:51:59,003 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073671728]
[2024-06-20 19:51:59,003 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:51:59,003 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:51:59,046 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:52:08,897 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:52:08,897 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:52:08,897 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073671728]
[2024-06-20 19:52:08,897 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073671728] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:52:08,897 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:52:08,897 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:52:08,898 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456649135]
[2024-06-20 19:52:08,898 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:52:08,898 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:52:08,898 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:52:08,899 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:52:08,899 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:52:09,057 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 19:52:09,058 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 174 transitions, 1902 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 19:52:09,058 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:52:09,058 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 19:52:09,058 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:52:10,244 INFO  L124   PetriNetUnfolderBase]: 1967/3041 cut-off events.
[2024-06-20 19:52:10,245 INFO  L125   PetriNetUnfolderBase]: For 45977/45977 co-relation queries the response was YES.
[2024-06-20 19:52:10,255 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19775 conditions, 3041 events. 1967/3041 cut-off events. For 45977/45977 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 15901 event pairs, 448 based on Foata normal form. 10/3049 useless extension candidates. Maximal degree in co-relation 19720. Up to 2440 conditions per place. 
[2024-06-20 19:52:10,266 INFO  L140   encePairwiseOnDemand]: 26/41 looper letters, 156 selfloop transitions, 61 changer transitions 0/222 dead transitions.
[2024-06-20 19:52:10,266 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 222 transitions, 2660 flow
[2024-06-20 19:52:10,268 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:52:10,268 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:52:10,268 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 191 transitions.
[2024-06-20 19:52:10,269 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5176151761517616
[2024-06-20 19:52:10,269 INFO  L175             Difference]: Start difference. First operand has 117 places, 174 transitions, 1902 flow. Second operand 9 states and 191 transitions.
[2024-06-20 19:52:10,269 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 222 transitions, 2660 flow
[2024-06-20 19:52:10,305 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 222 transitions, 2547 flow, removed 41 selfloop flow, removed 4 redundant places.
[2024-06-20 19:52:10,308 INFO  L231             Difference]: Finished difference. Result has 122 places, 180 transitions, 2031 flow
[2024-06-20 19:52:10,308 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1790, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2031, PETRI_PLACES=122, PETRI_TRANSITIONS=180}
[2024-06-20 19:52:10,308 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 80 predicate places.
[2024-06-20 19:52:10,309 INFO  L495      AbstractCegarLoop]: Abstraction has has 122 places, 180 transitions, 2031 flow
[2024-06-20 19:52:10,309 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 19:52:10,309 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:52:10,309 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:52:10,309 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-20 19:52:10,309 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:52:10,310 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:52:10,310 INFO  L85        PathProgramCache]: Analyzing trace with hash 1295459562, now seen corresponding path program 3 times
[2024-06-20 19:52:10,310 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:52:10,310 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657649439]
[2024-06-20 19:52:10,310 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:52:10,310 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:52:10,359 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:52:18,712 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:52:18,713 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:52:18,713 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657649439]
[2024-06-20 19:52:18,713 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657649439] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:52:18,713 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:52:18,713 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:52:18,713 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894810286]
[2024-06-20 19:52:18,713 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:52:18,714 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:52:18,714 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:52:18,714 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:52:18,714 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:52:18,904 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 19:52:18,905 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 180 transitions, 2031 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 19:52:18,905 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:52:18,905 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 19:52:18,905 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:52:20,211 INFO  L124   PetriNetUnfolderBase]: 2061/3183 cut-off events.
[2024-06-20 19:52:20,212 INFO  L125   PetriNetUnfolderBase]: For 52608/52608 co-relation queries the response was YES.
[2024-06-20 19:52:20,223 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21877 conditions, 3183 events. 2061/3183 cut-off events. For 52608/52608 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 16788 event pairs, 450 based on Foata normal form. 5/3186 useless extension candidates. Maximal degree in co-relation 21820. Up to 2599 conditions per place. 
[2024-06-20 19:52:20,237 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 175 selfloop transitions, 75 changer transitions 0/255 dead transitions.
[2024-06-20 19:52:20,237 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 255 transitions, 3386 flow
[2024-06-20 19:52:20,238 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:52:20,238 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:52:20,238 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 191 transitions.
[2024-06-20 19:52:20,238 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5176151761517616
[2024-06-20 19:52:20,239 INFO  L175             Difference]: Start difference. First operand has 122 places, 180 transitions, 2031 flow. Second operand 9 states and 191 transitions.
[2024-06-20 19:52:20,239 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 255 transitions, 3386 flow
[2024-06-20 19:52:20,277 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 255 transitions, 3096 flow, removed 75 selfloop flow, removed 7 redundant places.
[2024-06-20 19:52:20,280 INFO  L231             Difference]: Finished difference. Result has 127 places, 210 transitions, 2486 flow
[2024-06-20 19:52:20,280 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1832, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2486, PETRI_PLACES=127, PETRI_TRANSITIONS=210}
[2024-06-20 19:52:20,281 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 85 predicate places.
[2024-06-20 19:52:20,281 INFO  L495      AbstractCegarLoop]: Abstraction has has 127 places, 210 transitions, 2486 flow
[2024-06-20 19:52:20,281 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 19:52:20,281 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:52:20,281 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:52:20,281 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-20 19:52:20,282 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:52:20,282 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:52:20,282 INFO  L85        PathProgramCache]: Analyzing trace with hash 1295162892, now seen corresponding path program 4 times
[2024-06-20 19:52:20,282 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:52:20,282 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157237618]
[2024-06-20 19:52:20,282 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:52:20,282 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:52:20,324 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:52:28,714 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:52:28,715 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:52:28,715 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157237618]
[2024-06-20 19:52:28,715 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157237618] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:52:28,715 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:52:28,715 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:52:28,715 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640922550]
[2024-06-20 19:52:28,715 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:52:28,717 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:52:28,719 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:52:28,719 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:52:28,719 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:52:28,902 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 19:52:28,903 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 210 transitions, 2486 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 19:52:28,903 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:52:28,903 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 19:52:28,903 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:52:30,156 INFO  L124   PetriNetUnfolderBase]: 2075/3206 cut-off events.
[2024-06-20 19:52:30,156 INFO  L125   PetriNetUnfolderBase]: For 59129/59129 co-relation queries the response was YES.
[2024-06-20 19:52:30,168 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23152 conditions, 3206 events. 2075/3206 cut-off events. For 59129/59129 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 16946 event pairs, 452 based on Foata normal form. 5/3209 useless extension candidates. Maximal degree in co-relation 23091. Up to 2739 conditions per place. 
[2024-06-20 19:52:30,181 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 188 selfloop transitions, 66 changer transitions 0/259 dead transitions.
[2024-06-20 19:52:30,181 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 259 transitions, 3457 flow
[2024-06-20 19:52:30,182 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:52:30,182 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:52:30,183 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 189 transitions.
[2024-06-20 19:52:30,183 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5121951219512195
[2024-06-20 19:52:30,183 INFO  L175             Difference]: Start difference. First operand has 127 places, 210 transitions, 2486 flow. Second operand 9 states and 189 transitions.
[2024-06-20 19:52:30,183 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 259 transitions, 3457 flow
[2024-06-20 19:52:30,236 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 259 transitions, 3276 flow, removed 81 selfloop flow, removed 3 redundant places.
[2024-06-20 19:52:30,239 INFO  L231             Difference]: Finished difference. Result has 135 places, 219 transitions, 2665 flow
[2024-06-20 19:52:30,239 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2331, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2665, PETRI_PLACES=135, PETRI_TRANSITIONS=219}
[2024-06-20 19:52:30,240 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 93 predicate places.
[2024-06-20 19:52:30,240 INFO  L495      AbstractCegarLoop]: Abstraction has has 135 places, 219 transitions, 2665 flow
[2024-06-20 19:52:30,240 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 19:52:30,240 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:52:30,240 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:52:30,240 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-20 19:52:30,240 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:52:30,241 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:52:30,241 INFO  L85        PathProgramCache]: Analyzing trace with hash 1872612921, now seen corresponding path program 1 times
[2024-06-20 19:52:30,241 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:52:30,241 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988749091]
[2024-06-20 19:52:30,241 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:52:30,241 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:52:30,271 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:52:42,434 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:52:42,434 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:52:42,434 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988749091]
[2024-06-20 19:52:42,434 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988749091] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:52:42,435 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:52:42,435 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:52:42,435 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463395769]
[2024-06-20 19:52:42,435 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:52:42,435 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:52:42,435 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:52:42,435 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:52:42,435 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:52:42,550 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 19:52:42,550 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 219 transitions, 2665 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 19:52:42,550 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:52:42,550 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 19:52:42,550 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:52:43,565 INFO  L124   PetriNetUnfolderBase]: 2008/3086 cut-off events.
[2024-06-20 19:52:43,565 INFO  L125   PetriNetUnfolderBase]: For 61888/61888 co-relation queries the response was YES.
[2024-06-20 19:52:43,577 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22824 conditions, 3086 events. 2008/3086 cut-off events. For 61888/61888 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 16153 event pairs, 506 based on Foata normal form. 8/3088 useless extension candidates. Maximal degree in co-relation 22759. Up to 2855 conditions per place. 
[2024-06-20 19:52:43,591 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 194 selfloop transitions, 29 changer transitions 0/228 dead transitions.
[2024-06-20 19:52:43,591 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 228 transitions, 3149 flow
[2024-06-20 19:52:43,591 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 19:52:43,592 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 19:52:43,592 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions.
[2024-06-20 19:52:43,592 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48292682926829267
[2024-06-20 19:52:43,592 INFO  L175             Difference]: Start difference. First operand has 135 places, 219 transitions, 2665 flow. Second operand 5 states and 99 transitions.
[2024-06-20 19:52:43,592 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 228 transitions, 3149 flow
[2024-06-20 19:52:43,720 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 228 transitions, 2930 flow, removed 51 selfloop flow, removed 6 redundant places.
[2024-06-20 19:52:43,722 INFO  L231             Difference]: Finished difference. Result has 134 places, 219 transitions, 2523 flow
[2024-06-20 19:52:43,723 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2446, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2523, PETRI_PLACES=134, PETRI_TRANSITIONS=219}
[2024-06-20 19:52:43,723 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 92 predicate places.
[2024-06-20 19:52:43,723 INFO  L495      AbstractCegarLoop]: Abstraction has has 134 places, 219 transitions, 2523 flow
[2024-06-20 19:52:43,724 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 19:52:43,724 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:52:43,724 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:52:43,724 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-20 19:52:43,724 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:52:43,725 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:52:43,725 INFO  L85        PathProgramCache]: Analyzing trace with hash 253419743, now seen corresponding path program 1 times
[2024-06-20 19:52:43,725 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:52:43,725 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601769975]
[2024-06-20 19:52:43,725 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:52:43,726 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:52:43,771 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:52:53,122 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:52:53,122 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:52:53,123 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601769975]
[2024-06-20 19:52:53,123 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601769975] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:52:53,124 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:52:53,124 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:52:53,124 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342833679]
[2024-06-20 19:52:53,124 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:52:53,125 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:52:53,126 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:52:53,126 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:52:53,126 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:52:53,344 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 19:52:53,344 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 219 transitions, 2523 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 19:52:53,344 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:52:53,344 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 19:52:53,344 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:52:54,600 INFO  L124   PetriNetUnfolderBase]: 2078/3194 cut-off events.
[2024-06-20 19:52:54,600 INFO  L125   PetriNetUnfolderBase]: For 64258/64258 co-relation queries the response was YES.
[2024-06-20 19:52:54,611 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23244 conditions, 3194 events. 2078/3194 cut-off events. For 64258/64258 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 16696 event pairs, 490 based on Foata normal form. 6/3198 useless extension candidates. Maximal degree in co-relation 23178. Up to 2933 conditions per place. 
[2024-06-20 19:52:54,623 INFO  L140   encePairwiseOnDemand]: 25/41 looper letters, 227 selfloop transitions, 39 changer transitions 0/271 dead transitions.
[2024-06-20 19:52:54,623 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 271 transitions, 3378 flow
[2024-06-20 19:52:54,624 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:52:54,624 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:52:54,624 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 196 transitions.
[2024-06-20 19:52:54,625 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47804878048780486
[2024-06-20 19:52:54,625 INFO  L175             Difference]: Start difference. First operand has 134 places, 219 transitions, 2523 flow. Second operand 10 states and 196 transitions.
[2024-06-20 19:52:54,625 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 271 transitions, 3378 flow
[2024-06-20 19:52:54,683 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 271 transitions, 3302 flow, removed 2 selfloop flow, removed 4 redundant places.
[2024-06-20 19:52:54,686 INFO  L231             Difference]: Finished difference. Result has 143 places, 235 transitions, 2766 flow
[2024-06-20 19:52:54,686 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2459, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2766, PETRI_PLACES=143, PETRI_TRANSITIONS=235}
[2024-06-20 19:52:54,687 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 101 predicate places.
[2024-06-20 19:52:54,687 INFO  L495      AbstractCegarLoop]: Abstraction has has 143 places, 235 transitions, 2766 flow
[2024-06-20 19:52:54,687 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 19:52:54,687 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:52:54,687 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:52:54,688 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-20 19:52:54,688 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:52:54,688 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:52:54,688 INFO  L85        PathProgramCache]: Analyzing trace with hash 59182359, now seen corresponding path program 2 times
[2024-06-20 19:52:54,688 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:52:54,688 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190300856]
[2024-06-20 19:52:54,688 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:52:54,689 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:52:54,738 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:53:03,832 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:53:03,833 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:53:03,833 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190300856]
[2024-06-20 19:53:03,833 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190300856] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:53:03,833 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:53:03,833 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:53:03,833 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924506245]
[2024-06-20 19:53:03,833 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:53:03,834 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:53:03,835 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:53:03,836 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:53:03,836 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:53:03,988 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 19:53:03,989 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 235 transitions, 2766 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 19:53:03,989 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:53:03,989 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 19:53:03,989 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:53:05,302 INFO  L124   PetriNetUnfolderBase]: 2103/3228 cut-off events.
[2024-06-20 19:53:05,302 INFO  L125   PetriNetUnfolderBase]: For 70942/70942 co-relation queries the response was YES.
[2024-06-20 19:53:05,314 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24259 conditions, 3228 events. 2103/3228 cut-off events. For 70942/70942 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 16885 event pairs, 472 based on Foata normal form. 5/3231 useless extension candidates. Maximal degree in co-relation 24190. Up to 2968 conditions per place. 
[2024-06-20 19:53:05,327 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 245 selfloop transitions, 38 changer transitions 0/288 dead transitions.
[2024-06-20 19:53:05,328 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 288 transitions, 3773 flow
[2024-06-20 19:53:05,328 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:53:05,328 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:53:05,329 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions.
[2024-06-20 19:53:05,329 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48509485094850946
[2024-06-20 19:53:05,329 INFO  L175             Difference]: Start difference. First operand has 143 places, 235 transitions, 2766 flow. Second operand 9 states and 179 transitions.
[2024-06-20 19:53:05,329 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 288 transitions, 3773 flow
[2024-06-20 19:53:05,403 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 288 transitions, 3579 flow, removed 58 selfloop flow, removed 5 redundant places.
[2024-06-20 19:53:05,407 INFO  L231             Difference]: Finished difference. Result has 150 places, 257 transitions, 3061 flow
[2024-06-20 19:53:05,407 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2614, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3061, PETRI_PLACES=150, PETRI_TRANSITIONS=257}
[2024-06-20 19:53:05,408 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 108 predicate places.
[2024-06-20 19:53:05,408 INFO  L495      AbstractCegarLoop]: Abstraction has has 150 places, 257 transitions, 3061 flow
[2024-06-20 19:53:05,408 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 19:53:05,408 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:53:05,408 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:53:05,408 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-20 19:53:05,408 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:53:05,409 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:53:05,409 INFO  L85        PathProgramCache]: Analyzing trace with hash 1979460849, now seen corresponding path program 1 times
[2024-06-20 19:53:05,409 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:53:05,409 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637712313]
[2024-06-20 19:53:05,409 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:53:05,409 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:53:05,450 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:53:13,420 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:53:13,420 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:53:13,421 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637712313]
[2024-06-20 19:53:13,421 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637712313] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:53:13,421 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:53:13,421 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:53:13,421 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78642056]
[2024-06-20 19:53:13,421 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:53:13,423 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:53:13,423 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:53:13,423 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:53:13,424 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:53:13,611 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 19:53:13,612 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 257 transitions, 3061 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 19:53:13,612 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:53:13,612 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 19:53:13,612 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:53:14,894 INFO  L124   PetriNetUnfolderBase]: 2120/3260 cut-off events.
[2024-06-20 19:53:14,895 INFO  L125   PetriNetUnfolderBase]: For 70050/70050 co-relation queries the response was YES.
[2024-06-20 19:53:14,908 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24978 conditions, 3260 events. 2120/3260 cut-off events. For 70050/70050 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 16975 event pairs, 529 based on Foata normal form. 4/3262 useless extension candidates. Maximal degree in co-relation 24905. Up to 3052 conditions per place. 
[2024-06-20 19:53:14,922 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 276 selfloop transitions, 19 changer transitions 0/300 dead transitions.
[2024-06-20 19:53:14,923 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 300 transitions, 3950 flow
[2024-06-20 19:53:14,924 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:53:14,925 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:53:14,925 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions.
[2024-06-20 19:53:14,925 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44986449864498645
[2024-06-20 19:53:14,925 INFO  L175             Difference]: Start difference. First operand has 150 places, 257 transitions, 3061 flow. Second operand 9 states and 166 transitions.
[2024-06-20 19:53:14,925 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 300 transitions, 3950 flow
[2024-06-20 19:53:15,015 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 300 transitions, 3774 flow, removed 79 selfloop flow, removed 3 redundant places.
[2024-06-20 19:53:15,025 INFO  L231             Difference]: Finished difference. Result has 161 places, 269 transitions, 3179 flow
[2024-06-20 19:53:15,026 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2890, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3179, PETRI_PLACES=161, PETRI_TRANSITIONS=269}
[2024-06-20 19:53:15,027 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 119 predicate places.
[2024-06-20 19:53:15,027 INFO  L495      AbstractCegarLoop]: Abstraction has has 161 places, 269 transitions, 3179 flow
[2024-06-20 19:53:15,027 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 19:53:15,027 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:53:15,027 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:53:15,027 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-20 19:53:15,028 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:53:15,048 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:53:15,048 INFO  L85        PathProgramCache]: Analyzing trace with hash 1238844925, now seen corresponding path program 2 times
[2024-06-20 19:53:15,048 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:53:15,049 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088686679]
[2024-06-20 19:53:15,049 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:53:15,049 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:53:15,084 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:53:23,293 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:53:23,294 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:53:23,294 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088686679]
[2024-06-20 19:53:23,294 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088686679] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:53:23,294 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:53:23,294 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:53:23,294 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529626292]
[2024-06-20 19:53:23,294 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:53:23,295 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:53:23,296 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:53:23,300 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:53:23,300 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:53:23,500 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 19:53:23,501 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 269 transitions, 3179 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 19:53:23,501 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:53:23,501 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 19:53:23,501 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:53:24,707 INFO  L124   PetriNetUnfolderBase]: 2137/3291 cut-off events.
[2024-06-20 19:53:24,707 INFO  L125   PetriNetUnfolderBase]: For 73392/73392 co-relation queries the response was YES.
[2024-06-20 19:53:24,723 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25362 conditions, 3291 events. 2137/3291 cut-off events. For 73392/73392 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 17251 event pairs, 553 based on Foata normal form. 4/3291 useless extension candidates. Maximal degree in co-relation 25282. Up to 3034 conditions per place. 
[2024-06-20 19:53:24,738 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 275 selfloop transitions, 31 changer transitions 0/311 dead transitions.
[2024-06-20 19:53:24,738 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 311 transitions, 4076 flow
[2024-06-20 19:53:24,740 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:53:24,740 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:53:24,741 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions.
[2024-06-20 19:53:24,741 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45257452574525747
[2024-06-20 19:53:24,741 INFO  L175             Difference]: Start difference. First operand has 161 places, 269 transitions, 3179 flow. Second operand 9 states and 167 transitions.
[2024-06-20 19:53:24,741 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 311 transitions, 4076 flow
[2024-06-20 19:53:24,827 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 311 transitions, 4019 flow, removed 21 selfloop flow, removed 2 redundant places.
[2024-06-20 19:53:24,831 INFO  L231             Difference]: Finished difference. Result has 172 places, 282 transitions, 3424 flow
[2024-06-20 19:53:24,831 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3122, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3424, PETRI_PLACES=172, PETRI_TRANSITIONS=282}
[2024-06-20 19:53:24,832 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 130 predicate places.
[2024-06-20 19:53:24,832 INFO  L495      AbstractCegarLoop]: Abstraction has has 172 places, 282 transitions, 3424 flow
[2024-06-20 19:53:24,832 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 19:53:24,832 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:53:24,832 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:53:24,833 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-20 19:53:24,833 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:53:24,833 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:53:24,833 INFO  L85        PathProgramCache]: Analyzing trace with hash -1024022513, now seen corresponding path program 3 times
[2024-06-20 19:53:24,833 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:53:24,833 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824892901]
[2024-06-20 19:53:24,833 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:53:24,834 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:53:24,869 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:53:33,120 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:53:33,120 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:53:33,120 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824892901]
[2024-06-20 19:53:33,121 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824892901] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:53:33,121 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:53:33,121 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:53:33,121 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445223534]
[2024-06-20 19:53:33,121 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:53:33,121 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:53:33,121 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:53:33,122 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:53:33,122 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:53:33,317 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 19:53:33,317 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 282 transitions, 3424 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 19:53:33,318 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:53:33,318 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 19:53:33,318 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:53:34,556 INFO  L124   PetriNetUnfolderBase]: 2154/3323 cut-off events.
[2024-06-20 19:53:34,557 INFO  L125   PetriNetUnfolderBase]: For 79882/79882 co-relation queries the response was YES.
[2024-06-20 19:53:34,574 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26033 conditions, 3323 events. 2154/3323 cut-off events. For 79882/79882 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 17515 event pairs, 514 based on Foata normal form. 4/3323 useless extension candidates. Maximal degree in co-relation 25947. Up to 2937 conditions per place. 
[2024-06-20 19:53:34,589 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 270 selfloop transitions, 50 changer transitions 0/325 dead transitions.
[2024-06-20 19:53:34,589 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 325 transitions, 4403 flow
[2024-06-20 19:53:34,591 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:53:34,591 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:53:34,592 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions.
[2024-06-20 19:53:34,592 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46070460704607047
[2024-06-20 19:53:34,592 INFO  L175             Difference]: Start difference. First operand has 172 places, 282 transitions, 3424 flow. Second operand 9 states and 170 transitions.
[2024-06-20 19:53:34,592 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 325 transitions, 4403 flow
[2024-06-20 19:53:34,687 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 325 transitions, 4330 flow, removed 21 selfloop flow, removed 3 redundant places.
[2024-06-20 19:53:34,691 INFO  L231             Difference]: Finished difference. Result has 181 places, 293 transitions, 3664 flow
[2024-06-20 19:53:34,691 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3351, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3664, PETRI_PLACES=181, PETRI_TRANSITIONS=293}
[2024-06-20 19:53:34,693 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 139 predicate places.
[2024-06-20 19:53:34,693 INFO  L495      AbstractCegarLoop]: Abstraction has has 181 places, 293 transitions, 3664 flow
[2024-06-20 19:53:34,693 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 19:53:34,693 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:53:34,693 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:53:34,694 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-20 19:53:34,694 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:53:34,695 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:53:34,695 INFO  L85        PathProgramCache]: Analyzing trace with hash -1024348943, now seen corresponding path program 4 times
[2024-06-20 19:53:34,695 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:53:34,695 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450819550]
[2024-06-20 19:53:34,695 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:53:34,696 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:53:34,743 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:53:42,891 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:53:42,893 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:53:42,893 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450819550]
[2024-06-20 19:53:42,893 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450819550] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:53:42,893 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:53:42,893 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:53:42,893 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848209930]
[2024-06-20 19:53:42,893 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:53:42,895 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:53:42,895 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:53:42,896 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:53:42,910 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:53:43,170 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 19:53:43,170 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 293 transitions, 3664 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 19:53:43,170 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:53:43,170 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 19:53:43,170 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:53:44,485 INFO  L124   PetriNetUnfolderBase]: 2171/3350 cut-off events.
[2024-06-20 19:53:44,486 INFO  L125   PetriNetUnfolderBase]: For 85912/85912 co-relation queries the response was YES.
[2024-06-20 19:53:44,501 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26776 conditions, 3350 events. 2171/3350 cut-off events. For 85912/85912 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 17609 event pairs, 545 based on Foata normal form. 4/3350 useless extension candidates. Maximal degree in co-relation 26686. Up to 3052 conditions per place. 
[2024-06-20 19:53:44,515 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 276 selfloop transitions, 43 changer transitions 0/324 dead transitions.
[2024-06-20 19:53:44,515 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 324 transitions, 4444 flow
[2024-06-20 19:53:44,517 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:53:44,517 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:53:44,518 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions.
[2024-06-20 19:53:44,518 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45257452574525747
[2024-06-20 19:53:44,518 INFO  L175             Difference]: Start difference. First operand has 181 places, 293 transitions, 3664 flow. Second operand 9 states and 167 transitions.
[2024-06-20 19:53:44,518 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 324 transitions, 4444 flow
[2024-06-20 19:53:44,620 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 324 transitions, 4360 flow, removed 38 selfloop flow, removed 2 redundant places.
[2024-06-20 19:53:44,624 INFO  L231             Difference]: Finished difference. Result has 189 places, 296 transitions, 3753 flow
[2024-06-20 19:53:44,624 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3598, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3753, PETRI_PLACES=189, PETRI_TRANSITIONS=296}
[2024-06-20 19:53:44,624 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 147 predicate places.
[2024-06-20 19:53:44,625 INFO  L495      AbstractCegarLoop]: Abstraction has has 189 places, 296 transitions, 3753 flow
[2024-06-20 19:53:44,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 19:53:44,625 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:53:44,625 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:53:44,625 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-20 19:53:44,625 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:53:44,626 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:53:44,626 INFO  L85        PathProgramCache]: Analyzing trace with hash 1495345435, now seen corresponding path program 5 times
[2024-06-20 19:53:44,626 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:53:44,626 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295804443]
[2024-06-20 19:53:44,626 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:53:44,626 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:53:44,661 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:53:52,805 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:53:52,805 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:53:52,805 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295804443]
[2024-06-20 19:53:52,805 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295804443] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:53:52,805 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:53:52,805 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:53:52,805 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799437499]
[2024-06-20 19:53:52,805 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:53:52,806 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:53:52,806 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:53:52,806 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:53:52,806 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:53:52,980 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 19:53:52,980 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 296 transitions, 3753 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 19:53:52,980 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:53:52,980 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 19:53:52,980 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:53:54,368 INFO  L124   PetriNetUnfolderBase]: 2163/3333 cut-off events.
[2024-06-20 19:53:54,368 INFO  L125   PetriNetUnfolderBase]: For 87657/87657 co-relation queries the response was YES.
[2024-06-20 19:53:54,384 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26780 conditions, 3333 events. 2163/3333 cut-off events. For 87657/87657 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 17468 event pairs, 543 based on Foata normal form. 4/3333 useless extension candidates. Maximal degree in co-relation 26687. Up to 3076 conditions per place. 
[2024-06-20 19:53:54,397 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 287 selfloop transitions, 32 changer transitions 0/324 dead transitions.
[2024-06-20 19:53:54,398 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 324 transitions, 4475 flow
[2024-06-20 19:53:54,400 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:53:54,400 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:53:54,400 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions.
[2024-06-20 19:53:54,400 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44986449864498645
[2024-06-20 19:53:54,400 INFO  L175             Difference]: Start difference. First operand has 189 places, 296 transitions, 3753 flow. Second operand 9 states and 166 transitions.
[2024-06-20 19:53:54,400 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 324 transitions, 4475 flow
[2024-06-20 19:53:54,506 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 324 transitions, 4360 flow, removed 17 selfloop flow, removed 6 redundant places.
[2024-06-20 19:53:54,510 INFO  L231             Difference]: Finished difference. Result has 192 places, 296 transitions, 3709 flow
[2024-06-20 19:53:54,510 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3638, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3709, PETRI_PLACES=192, PETRI_TRANSITIONS=296}
[2024-06-20 19:53:54,511 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 150 predicate places.
[2024-06-20 19:53:54,511 INFO  L495      AbstractCegarLoop]: Abstraction has has 192 places, 296 transitions, 3709 flow
[2024-06-20 19:53:54,511 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 19:53:54,511 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:53:54,511 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:53:54,511 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-20 19:53:54,512 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:53:54,512 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:53:54,512 INFO  L85        PathProgramCache]: Analyzing trace with hash -1554388555, now seen corresponding path program 1 times
[2024-06-20 19:53:54,512 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:53:54,512 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258689137]
[2024-06-20 19:53:54,512 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:53:54,512 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:53:54,566 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:54:01,724 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:54:01,724 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:54:01,724 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258689137]
[2024-06-20 19:54:01,724 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258689137] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:54:01,724 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:54:01,724 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:54:01,724 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393057765]
[2024-06-20 19:54:01,724 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:54:01,724 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:54:01,725 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:54:01,725 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:54:01,725 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:54:01,868 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41
[2024-06-20 19:54:01,869 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 296 transitions, 3709 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 19:54:01,869 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:54:01,869 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41
[2024-06-20 19:54:01,869 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:54:03,206 INFO  L124   PetriNetUnfolderBase]: 2199/3426 cut-off events.
[2024-06-20 19:54:03,206 INFO  L125   PetriNetUnfolderBase]: For 107440/107608 co-relation queries the response was YES.
[2024-06-20 19:54:03,222 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27927 conditions, 3426 events. 2199/3426 cut-off events. For 107440/107608 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 18400 event pairs, 493 based on Foata normal form. 10/3391 useless extension candidates. Maximal degree in co-relation 27833. Up to 3007 conditions per place. 
[2024-06-20 19:54:03,236 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 254 selfloop transitions, 58 changer transitions 0/350 dead transitions.
[2024-06-20 19:54:03,236 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 350 transitions, 4748 flow
[2024-06-20 19:54:03,237 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:54:03,237 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:54:03,237 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 183 transitions.
[2024-06-20 19:54:03,238 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4959349593495935
[2024-06-20 19:54:03,238 INFO  L175             Difference]: Start difference. First operand has 192 places, 296 transitions, 3709 flow. Second operand 9 states and 183 transitions.
[2024-06-20 19:54:03,238 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 350 transitions, 4748 flow
[2024-06-20 19:54:03,351 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 350 transitions, 4675 flow, removed 7 selfloop flow, removed 5 redundant places.
[2024-06-20 19:54:03,355 INFO  L231             Difference]: Finished difference. Result has 199 places, 318 transitions, 4136 flow
[2024-06-20 19:54:03,355 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3640, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4136, PETRI_PLACES=199, PETRI_TRANSITIONS=318}
[2024-06-20 19:54:03,360 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 157 predicate places.
[2024-06-20 19:54:03,360 INFO  L495      AbstractCegarLoop]: Abstraction has has 199 places, 318 transitions, 4136 flow
[2024-06-20 19:54:03,360 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 19:54:03,360 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:54:03,360 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:54:03,360 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-20 19:54:03,360 INFO  L420      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:54:03,361 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:54:03,361 INFO  L85        PathProgramCache]: Analyzing trace with hash 1834531475, now seen corresponding path program 2 times
[2024-06-20 19:54:03,361 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:54:03,361 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033873860]
[2024-06-20 19:54:03,361 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:54:03,361 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:54:03,468 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:54:11,762 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:54:11,763 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:54:11,763 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033873860]
[2024-06-20 19:54:11,763 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033873860] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:54:11,763 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:54:11,763 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:54:11,763 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445862367]
[2024-06-20 19:54:11,763 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:54:11,764 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:54:11,764 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:54:11,765 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:54:11,765 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:54:12,019 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41
[2024-06-20 19:54:12,019 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 318 transitions, 4136 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 19:54:12,019 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:54:12,019 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41
[2024-06-20 19:54:12,019 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:54:13,413 INFO  L124   PetriNetUnfolderBase]: 2235/3480 cut-off events.
[2024-06-20 19:54:13,413 INFO  L125   PetriNetUnfolderBase]: For 116793/116964 co-relation queries the response was YES.
[2024-06-20 19:54:13,430 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28885 conditions, 3480 events. 2235/3480 cut-off events. For 116793/116964 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 18738 event pairs, 373 based on Foata normal form. 32/3465 useless extension candidates. Maximal degree in co-relation 28787. Up to 2963 conditions per place. 
[2024-06-20 19:54:13,444 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 254 selfloop transitions, 62 changer transitions 0/354 dead transitions.
[2024-06-20 19:54:13,444 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 354 transitions, 4990 flow
[2024-06-20 19:54:13,445 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:54:13,445 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:54:13,445 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 168 transitions.
[2024-06-20 19:54:13,445 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5121951219512195
[2024-06-20 19:54:13,445 INFO  L175             Difference]: Start difference. First operand has 199 places, 318 transitions, 4136 flow. Second operand 8 states and 168 transitions.
[2024-06-20 19:54:13,446 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 354 transitions, 4990 flow
[2024-06-20 19:54:13,586 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 354 transitions, 4879 flow, removed 25 selfloop flow, removed 3 redundant places.
[2024-06-20 19:54:13,590 INFO  L231             Difference]: Finished difference. Result has 205 places, 322 transitions, 4266 flow
[2024-06-20 19:54:13,591 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4025, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4266, PETRI_PLACES=205, PETRI_TRANSITIONS=322}
[2024-06-20 19:54:13,591 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 163 predicate places.
[2024-06-20 19:54:13,591 INFO  L495      AbstractCegarLoop]: Abstraction has has 205 places, 322 transitions, 4266 flow
[2024-06-20 19:54:13,592 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 19:54:13,592 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:54:13,592 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:54:13,592 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-20 19:54:13,592 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:54:13,592 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:54:13,593 INFO  L85        PathProgramCache]: Analyzing trace with hash 943338711, now seen corresponding path program 3 times
[2024-06-20 19:54:13,593 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:54:13,593 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415587493]
[2024-06-20 19:54:13,593 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:54:13,593 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:54:13,648 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:54:23,322 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:54:23,323 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:54:23,323 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415587493]
[2024-06-20 19:54:23,323 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415587493] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:54:23,323 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:54:23,323 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:54:23,323 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775327810]
[2024-06-20 19:54:23,324 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:54:23,324 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:54:23,325 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:54:23,325 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:54:23,325 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:54:23,521 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41
[2024-06-20 19:54:23,522 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 322 transitions, 4266 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 19:54:23,522 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:54:23,522 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41
[2024-06-20 19:54:23,522 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:54:24,986 INFO  L124   PetriNetUnfolderBase]: 2288/3563 cut-off events.
[2024-06-20 19:54:24,986 INFO  L125   PetriNetUnfolderBase]: For 127510/127680 co-relation queries the response was YES.
[2024-06-20 19:54:25,007 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30130 conditions, 3563 events. 2288/3563 cut-off events. For 127510/127680 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 19215 event pairs, 478 based on Foata normal form. 25/3539 useless extension candidates. Maximal degree in co-relation 30030. Up to 3086 conditions per place. 
[2024-06-20 19:54:25,025 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 252 selfloop transitions, 68 changer transitions 0/358 dead transitions.
[2024-06-20 19:54:25,025 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 358 transitions, 5146 flow
[2024-06-20 19:54:25,026 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:54:25,026 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:54:25,026 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 184 transitions.
[2024-06-20 19:54:25,026 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4986449864498645
[2024-06-20 19:54:25,026 INFO  L175             Difference]: Start difference. First operand has 205 places, 322 transitions, 4266 flow. Second operand 9 states and 184 transitions.
[2024-06-20 19:54:25,026 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 358 transitions, 5146 flow
[2024-06-20 19:54:25,175 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 358 transitions, 4985 flow, removed 28 selfloop flow, removed 5 redundant places.
[2024-06-20 19:54:25,180 INFO  L231             Difference]: Finished difference. Result has 209 places, 324 transitions, 4326 flow
[2024-06-20 19:54:25,180 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4109, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4326, PETRI_PLACES=209, PETRI_TRANSITIONS=324}
[2024-06-20 19:54:25,181 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 167 predicate places.
[2024-06-20 19:54:25,181 INFO  L495      AbstractCegarLoop]: Abstraction has has 209 places, 324 transitions, 4326 flow
[2024-06-20 19:54:25,181 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 19:54:25,181 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:54:25,181 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:54:25,181 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-20 19:54:25,182 INFO  L420      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:54:25,182 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:54:25,182 INFO  L85        PathProgramCache]: Analyzing trace with hash 1056368055, now seen corresponding path program 1 times
[2024-06-20 19:54:25,182 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:54:25,182 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762847455]
[2024-06-20 19:54:25,182 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:54:25,182 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:54:25,249 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:54:36,653 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:54:36,653 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:54:36,653 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762847455]
[2024-06-20 19:54:36,653 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762847455] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:54:36,653 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:54:36,653 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:54:36,653 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204533074]
[2024-06-20 19:54:36,653 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:54:36,653 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:54:36,653 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:54:36,654 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:54:36,654 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:54:36,865 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 19:54:36,865 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 324 transitions, 4326 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 19:54:36,865 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:54:36,865 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 19:54:36,865 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:54:38,315 INFO  L124   PetriNetUnfolderBase]: 2385/3684 cut-off events.
[2024-06-20 19:54:38,315 INFO  L125   PetriNetUnfolderBase]: For 110866/110866 co-relation queries the response was YES.
[2024-06-20 19:54:38,332 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30500 conditions, 3684 events. 2385/3684 cut-off events. For 110866/110866 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 19578 event pairs, 512 based on Foata normal form. 2/3684 useless extension candidates. Maximal degree in co-relation 30399. Up to 3408 conditions per place. 
[2024-06-20 19:54:38,347 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 325 selfloop transitions, 36 changer transitions 0/366 dead transitions.
[2024-06-20 19:54:38,347 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 366 transitions, 5305 flow
[2024-06-20 19:54:38,349 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:54:38,349 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:54:38,349 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions.
[2024-06-20 19:54:38,349 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45799457994579945
[2024-06-20 19:54:38,350 INFO  L175             Difference]: Start difference. First operand has 209 places, 324 transitions, 4326 flow. Second operand 9 states and 169 transitions.
[2024-06-20 19:54:38,350 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 366 transitions, 5305 flow
[2024-06-20 19:54:38,498 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 366 transitions, 5135 flow, removed 17 selfloop flow, removed 7 redundant places.
[2024-06-20 19:54:38,503 INFO  L231             Difference]: Finished difference. Result has 214 places, 335 transitions, 4438 flow
[2024-06-20 19:54:38,503 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4163, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4438, PETRI_PLACES=214, PETRI_TRANSITIONS=335}
[2024-06-20 19:54:38,504 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 172 predicate places.
[2024-06-20 19:54:38,504 INFO  L495      AbstractCegarLoop]: Abstraction has has 214 places, 335 transitions, 4438 flow
[2024-06-20 19:54:38,504 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 19:54:38,504 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:54:38,504 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:54:38,504 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-20 19:54:38,505 INFO  L420      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:54:38,505 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:54:38,505 INFO  L85        PathProgramCache]: Analyzing trace with hash 1227065525, now seen corresponding path program 4 times
[2024-06-20 19:54:38,505 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:54:38,505 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143234626]
[2024-06-20 19:54:38,505 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:54:38,505 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:54:38,562 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:54:48,515 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:54:48,515 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:54:48,515 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143234626]
[2024-06-20 19:54:48,516 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143234626] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:54:48,516 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:54:48,516 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:54:48,516 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270051986]
[2024-06-20 19:54:48,516 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:54:48,516 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:54:48,516 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:54:48,517 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:54:48,517 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:54:48,671 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41
[2024-06-20 19:54:48,671 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 335 transitions, 4438 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 19:54:48,671 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:54:48,671 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41
[2024-06-20 19:54:48,671 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:54:50,104 INFO  L124   PetriNetUnfolderBase]: 2352/3663 cut-off events.
[2024-06-20 19:54:50,104 INFO  L125   PetriNetUnfolderBase]: For 135527/135701 co-relation queries the response was YES.
[2024-06-20 19:54:50,125 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31146 conditions, 3663 events. 2352/3663 cut-off events. For 135527/135701 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 19883 event pairs, 470 based on Foata normal form. 25/3637 useless extension candidates. Maximal degree in co-relation 31041. Up to 3244 conditions per place. 
[2024-06-20 19:54:50,142 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 287 selfloop transitions, 46 changer transitions 0/372 dead transitions.
[2024-06-20 19:54:50,142 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 372 transitions, 5367 flow
[2024-06-20 19:54:50,142 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:54:50,143 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:54:50,143 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 181 transitions.
[2024-06-20 19:54:50,143 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4905149051490515
[2024-06-20 19:54:50,143 INFO  L175             Difference]: Start difference. First operand has 214 places, 335 transitions, 4438 flow. Second operand 9 states and 181 transitions.
[2024-06-20 19:54:50,143 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 372 transitions, 5367 flow
[2024-06-20 19:54:50,380 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 372 transitions, 5268 flow, removed 31 selfloop flow, removed 4 redundant places.
[2024-06-20 19:54:50,405 INFO  L231             Difference]: Finished difference. Result has 220 places, 339 transitions, 4545 flow
[2024-06-20 19:54:50,406 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4339, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4545, PETRI_PLACES=220, PETRI_TRANSITIONS=339}
[2024-06-20 19:54:50,406 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 178 predicate places.
[2024-06-20 19:54:50,407 INFO  L495      AbstractCegarLoop]: Abstraction has has 220 places, 339 transitions, 4545 flow
[2024-06-20 19:54:50,407 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 19:54:50,407 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:54:50,407 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:54:50,407 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-20 19:54:50,407 INFO  L420      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:54:50,408 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:54:50,408 INFO  L85        PathProgramCache]: Analyzing trace with hash 1227070485, now seen corresponding path program 2 times
[2024-06-20 19:54:50,408 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:54:50,408 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203322857]
[2024-06-20 19:54:50,408 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:54:50,409 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:54:50,473 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:54:59,709 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:54:59,710 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:54:59,710 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203322857]
[2024-06-20 19:54:59,710 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203322857] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:54:59,710 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:54:59,710 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:54:59,710 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317051370]
[2024-06-20 19:54:59,710 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:54:59,711 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:54:59,711 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:54:59,711 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:54:59,711 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:54:59,936 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 19:54:59,936 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 339 transitions, 4545 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 19:54:59,937 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:54:59,937 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 19:54:59,937 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:55:01,684 INFO  L124   PetriNetUnfolderBase]: 2498/3869 cut-off events.
[2024-06-20 19:55:01,684 INFO  L125   PetriNetUnfolderBase]: For 128958/128958 co-relation queries the response was YES.
[2024-06-20 19:55:01,707 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32613 conditions, 3869 events. 2498/3869 cut-off events. For 128958/128958 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 20858 event pairs, 526 based on Foata normal form. 5/3872 useless extension candidates. Maximal degree in co-relation 32506. Up to 3534 conditions per place. 
[2024-06-20 19:55:01,725 INFO  L140   encePairwiseOnDemand]: 26/41 looper letters, 327 selfloop transitions, 52 changer transitions 0/384 dead transitions.
[2024-06-20 19:55:01,725 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 384 transitions, 5662 flow
[2024-06-20 19:55:01,734 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:55:01,734 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:55:01,735 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 198 transitions.
[2024-06-20 19:55:01,735 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48292682926829267
[2024-06-20 19:55:01,735 INFO  L175             Difference]: Start difference. First operand has 220 places, 339 transitions, 4545 flow. Second operand 10 states and 198 transitions.
[2024-06-20 19:55:01,735 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 384 transitions, 5662 flow
[2024-06-20 19:55:01,923 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 384 transitions, 5537 flow, removed 22 selfloop flow, removed 6 redundant places.
[2024-06-20 19:55:01,928 INFO  L231             Difference]: Finished difference. Result has 225 places, 350 transitions, 4768 flow
[2024-06-20 19:55:01,928 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4420, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4768, PETRI_PLACES=225, PETRI_TRANSITIONS=350}
[2024-06-20 19:55:01,928 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 183 predicate places.
[2024-06-20 19:55:01,928 INFO  L495      AbstractCegarLoop]: Abstraction has has 225 places, 350 transitions, 4768 flow
[2024-06-20 19:55:01,929 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 19:55:01,929 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:55:01,929 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:55:01,929 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-20 19:55:01,929 INFO  L420      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:55:01,929 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:55:01,929 INFO  L85        PathProgramCache]: Analyzing trace with hash 1233736725, now seen corresponding path program 3 times
[2024-06-20 19:55:01,930 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:55:01,930 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748960923]
[2024-06-20 19:55:01,930 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:55:01,930 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:55:02,010 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:55:12,369 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:55:12,369 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:55:12,369 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748960923]
[2024-06-20 19:55:12,369 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748960923] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:55:12,369 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:55:12,369 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:55:12,369 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270747872]
[2024-06-20 19:55:12,369 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:55:12,369 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:55:12,369 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:55:12,370 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:55:12,370 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:55:12,527 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 19:55:12,528 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 350 transitions, 4768 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 19:55:12,528 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:55:12,528 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 19:55:12,528 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:55:14,006 INFO  L124   PetriNetUnfolderBase]: 2569/3978 cut-off events.
[2024-06-20 19:55:14,007 INFO  L125   PetriNetUnfolderBase]: For 139810/139810 co-relation queries the response was YES.
[2024-06-20 19:55:14,029 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34292 conditions, 3978 events. 2569/3978 cut-off events. For 139810/139810 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 21544 event pairs, 505 based on Foata normal form. 5/3981 useless extension candidates. Maximal degree in co-relation 34183. Up to 3436 conditions per place. 
[2024-06-20 19:55:14,046 INFO  L140   encePairwiseOnDemand]: 26/41 looper letters, 290 selfloop transitions, 104 changer transitions 0/399 dead transitions.
[2024-06-20 19:55:14,047 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 399 transitions, 6174 flow
[2024-06-20 19:55:14,047 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:55:14,047 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:55:14,048 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 203 transitions.
[2024-06-20 19:55:14,048 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4951219512195122
[2024-06-20 19:55:14,048 INFO  L175             Difference]: Start difference. First operand has 225 places, 350 transitions, 4768 flow. Second operand 10 states and 203 transitions.
[2024-06-20 19:55:14,048 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 399 transitions, 6174 flow
[2024-06-20 19:55:14,251 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 399 transitions, 5955 flow, removed 78 selfloop flow, removed 5 redundant places.
[2024-06-20 19:55:14,256 INFO  L231             Difference]: Finished difference. Result has 231 places, 363 transitions, 5149 flow
[2024-06-20 19:55:14,256 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4549, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5149, PETRI_PLACES=231, PETRI_TRANSITIONS=363}
[2024-06-20 19:55:14,256 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 189 predicate places.
[2024-06-20 19:55:14,256 INFO  L495      AbstractCegarLoop]: Abstraction has has 231 places, 363 transitions, 5149 flow
[2024-06-20 19:55:14,257 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 19:55:14,257 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:55:14,257 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:55:14,257 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-20 19:55:14,257 INFO  L420      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:55:14,257 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:55:14,257 INFO  L85        PathProgramCache]: Analyzing trace with hash -220430643, now seen corresponding path program 4 times
[2024-06-20 19:55:14,258 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:55:14,258 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878262006]
[2024-06-20 19:55:14,258 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:55:14,258 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:55:14,322 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:55:25,021 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:55:25,021 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:55:25,021 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878262006]
[2024-06-20 19:55:25,021 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878262006] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:55:25,021 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:55:25,021 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:55:25,021 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663411967]
[2024-06-20 19:55:25,021 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:55:25,022 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:55:25,022 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:55:25,022 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:55:25,022 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:55:25,189 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 19:55:25,189 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 363 transitions, 5149 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 19:55:25,189 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:55:25,189 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 19:55:25,189 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:55:26,837 INFO  L124   PetriNetUnfolderBase]: 2579/3992 cut-off events.
[2024-06-20 19:55:26,837 INFO  L125   PetriNetUnfolderBase]: For 148367/148367 co-relation queries the response was YES.
[2024-06-20 19:55:26,859 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35178 conditions, 3992 events. 2579/3992 cut-off events. For 148367/148367 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 21613 event pairs, 535 based on Foata normal form. 5/3995 useless extension candidates. Maximal degree in co-relation 35067. Up to 3648 conditions per place. 
[2024-06-20 19:55:26,876 INFO  L140   encePairwiseOnDemand]: 26/41 looper letters, 344 selfloop transitions, 52 changer transitions 0/401 dead transitions.
[2024-06-20 19:55:26,876 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 401 transitions, 6225 flow
[2024-06-20 19:55:26,877 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:55:26,877 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:55:26,880 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 198 transitions.
[2024-06-20 19:55:26,880 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48292682926829267
[2024-06-20 19:55:26,880 INFO  L175             Difference]: Start difference. First operand has 231 places, 363 transitions, 5149 flow. Second operand 10 states and 198 transitions.
[2024-06-20 19:55:26,880 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 401 transitions, 6225 flow
[2024-06-20 19:55:27,090 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 401 transitions, 5896 flow, removed 98 selfloop flow, removed 7 redundant places.
[2024-06-20 19:55:27,095 INFO  L231             Difference]: Finished difference. Result has 234 places, 367 transitions, 5074 flow
[2024-06-20 19:55:27,095 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4838, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5074, PETRI_PLACES=234, PETRI_TRANSITIONS=367}
[2024-06-20 19:55:27,096 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 192 predicate places.
[2024-06-20 19:55:27,096 INFO  L495      AbstractCegarLoop]: Abstraction has has 234 places, 367 transitions, 5074 flow
[2024-06-20 19:55:27,096 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 19:55:27,096 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:55:27,096 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:55:27,096 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-20 19:55:27,096 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:55:27,097 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:55:27,097 INFO  L85        PathProgramCache]: Analyzing trace with hash -257191639, now seen corresponding path program 5 times
[2024-06-20 19:55:27,097 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:55:27,097 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101873842]
[2024-06-20 19:55:27,097 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:55:27,097 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:55:27,170 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:55:35,886 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:55:35,886 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:55:35,886 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101873842]
[2024-06-20 19:55:35,886 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101873842] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:55:35,887 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:55:35,887 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:55:35,887 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339189111]
[2024-06-20 19:55:35,887 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:55:35,887 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:55:35,887 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:55:35,887 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:55:35,887 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:55:36,071 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41
[2024-06-20 19:55:36,071 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 367 transitions, 5074 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 19:55:36,071 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:55:36,071 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41
[2024-06-20 19:55:36,071 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:55:37,728 INFO  L124   PetriNetUnfolderBase]: 2521/3943 cut-off events.
[2024-06-20 19:55:37,729 INFO  L125   PetriNetUnfolderBase]: For 171438/171632 co-relation queries the response was YES.
[2024-06-20 19:55:37,752 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34719 conditions, 3943 events. 2521/3943 cut-off events. For 171438/171632 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 21708 event pairs, 437 based on Foata normal form. 25/3918 useless extension candidates. Maximal degree in co-relation 34607. Up to 3298 conditions per place. 
[2024-06-20 19:55:37,771 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 293 selfloop transitions, 71 changer transitions 0/407 dead transitions.
[2024-06-20 19:55:37,771 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 407 transitions, 6160 flow
[2024-06-20 19:55:37,772 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:55:37,772 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:55:37,772 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 189 transitions.
[2024-06-20 19:55:37,772 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5121951219512195
[2024-06-20 19:55:37,773 INFO  L175             Difference]: Start difference. First operand has 234 places, 367 transitions, 5074 flow. Second operand 9 states and 189 transitions.
[2024-06-20 19:55:37,773 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 407 transitions, 6160 flow
[2024-06-20 19:55:37,982 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 407 transitions, 5954 flow, removed 59 selfloop flow, removed 6 redundant places.
[2024-06-20 19:55:37,988 INFO  L231             Difference]: Finished difference. Result has 237 places, 369 transitions, 5102 flow
[2024-06-20 19:55:37,989 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4868, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5102, PETRI_PLACES=237, PETRI_TRANSITIONS=369}
[2024-06-20 19:55:37,989 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 195 predicate places.
[2024-06-20 19:55:37,989 INFO  L495      AbstractCegarLoop]: Abstraction has has 237 places, 369 transitions, 5102 flow
[2024-06-20 19:55:37,989 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 19:55:37,990 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:55:37,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 19:55:37,990 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-20 19:55:37,990 INFO  L420      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:55:37,990 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:55:37,990 INFO  L85        PathProgramCache]: Analyzing trace with hash -888939221, now seen corresponding path program 5 times
[2024-06-20 19:55:37,990 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:55:37,990 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197209389]
[2024-06-20 19:55:37,991 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:55:37,991 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:55:38,062 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:55:47,711 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:55:47,712 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:55:47,712 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197209389]
[2024-06-20 19:55:47,712 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197209389] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:55:47,712 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:55:47,712 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:55:47,712 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687519813]
[2024-06-20 19:55:47,713 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:55:47,713 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:55:47,713 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:55:47,713 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:55:47,713 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:55:47,847 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 19:55:47,848 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 369 transitions, 5102 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 19:55:47,848 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:55:47,848 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 19:55:47,848 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:55:49,567 INFO  L124   PetriNetUnfolderBase]: 2730/4237 cut-off events.
[2024-06-20 19:55:49,567 INFO  L125   PetriNetUnfolderBase]: For 169706/169706 co-relation queries the response was YES.
[2024-06-20 19:55:49,592 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37479 conditions, 4237 events. 2730/4237 cut-off events. For 169706/169706 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 23278 event pairs, 488 based on Foata normal form. 5/4240 useless extension candidates. Maximal degree in co-relation 37366. Up to 3318 conditions per place. 
[2024-06-20 19:55:49,612 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 273 selfloop transitions, 157 changer transitions 0/435 dead transitions.
[2024-06-20 19:55:49,612 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 435 transitions, 7087 flow
[2024-06-20 19:55:49,613 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:55:49,613 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:55:49,613 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 215 transitions.
[2024-06-20 19:55:49,613 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.524390243902439
[2024-06-20 19:55:49,614 INFO  L175             Difference]: Start difference. First operand has 237 places, 369 transitions, 5102 flow. Second operand 10 states and 215 transitions.
[2024-06-20 19:55:49,614 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 435 transitions, 7087 flow
[2024-06-20 19:55:49,839 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 435 transitions, 6909 flow, removed 21 selfloop flow, removed 7 redundant places.
[2024-06-20 19:55:49,845 INFO  L231             Difference]: Finished difference. Result has 242 places, 391 transitions, 5929 flow
[2024-06-20 19:55:49,845 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4924, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5929, PETRI_PLACES=242, PETRI_TRANSITIONS=391}
[2024-06-20 19:55:49,846 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 200 predicate places.
[2024-06-20 19:55:49,846 INFO  L495      AbstractCegarLoop]: Abstraction has has 242 places, 391 transitions, 5929 flow
[2024-06-20 19:55:49,846 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 19:55:49,846 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:55:49,846 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:55:49,846 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-20 19:55:49,846 INFO  L420      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:55:49,847 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:55:49,847 INFO  L85        PathProgramCache]: Analyzing trace with hash -250520439, now seen corresponding path program 6 times
[2024-06-20 19:55:49,847 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:55:49,847 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244198988]
[2024-06-20 19:55:49,847 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:55:49,847 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:55:49,914 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:55:59,765 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:55:59,766 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:55:59,766 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244198988]
[2024-06-20 19:55:59,766 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244198988] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:55:59,766 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:55:59,766 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:55:59,766 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688045136]
[2024-06-20 19:55:59,767 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:55:59,767 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:55:59,767 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:55:59,767 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:55:59,767 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:55:59,947 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 19:55:59,947 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 391 transitions, 5929 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 19:55:59,947 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:55:59,947 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 19:55:59,947 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:56:01,741 INFO  L124   PetriNetUnfolderBase]: 2808/4369 cut-off events.
[2024-06-20 19:56:01,742 INFO  L125   PetriNetUnfolderBase]: For 187379/187379 co-relation queries the response was YES.
[2024-06-20 19:56:01,769 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40113 conditions, 4369 events. 2808/4369 cut-off events. For 187379/187379 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 24209 event pairs, 510 based on Foata normal form. 5/4372 useless extension candidates. Maximal degree in co-relation 39997. Up to 3405 conditions per place. 
[2024-06-20 19:56:01,790 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 286 selfloop transitions, 166 changer transitions 0/457 dead transitions.
[2024-06-20 19:56:01,791 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 457 transitions, 7895 flow
[2024-06-20 19:56:01,791 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:56:01,791 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:56:01,792 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 215 transitions.
[2024-06-20 19:56:01,792 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.524390243902439
[2024-06-20 19:56:01,792 INFO  L175             Difference]: Start difference. First operand has 242 places, 391 transitions, 5929 flow. Second operand 10 states and 215 transitions.
[2024-06-20 19:56:01,792 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 457 transitions, 7895 flow
[2024-06-20 19:56:02,119 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 457 transitions, 7641 flow, removed 123 selfloop flow, removed 2 redundant places.
[2024-06-20 19:56:02,125 INFO  L231             Difference]: Finished difference. Result has 253 places, 413 transitions, 6752 flow
[2024-06-20 19:56:02,126 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5693, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=147, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6752, PETRI_PLACES=253, PETRI_TRANSITIONS=413}
[2024-06-20 19:56:02,126 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 211 predicate places.
[2024-06-20 19:56:02,126 INFO  L495      AbstractCegarLoop]: Abstraction has has 253 places, 413 transitions, 6752 flow
[2024-06-20 19:56:02,127 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 19:56:02,127 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:56:02,127 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:56:02,127 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-20 19:56:02,127 INFO  L420      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:56:02,127 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:56:02,127 INFO  L85        PathProgramCache]: Analyzing trace with hash -889176371, now seen corresponding path program 7 times
[2024-06-20 19:56:02,127 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:56:02,128 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463697539]
[2024-06-20 19:56:02,128 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:56:02,128 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:56:02,186 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:56:11,738 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:56:11,738 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:56:11,738 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463697539]
[2024-06-20 19:56:11,739 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463697539] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:56:11,739 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:56:11,739 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:56:11,739 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491465329]
[2024-06-20 19:56:11,739 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:56:11,739 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:56:11,739 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:56:11,740 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:56:11,740 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:56:11,836 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 19:56:11,837 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 413 transitions, 6752 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 19:56:11,837 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:56:11,837 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 19:56:11,837 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:56:13,667 INFO  L124   PetriNetUnfolderBase]: 2806/4370 cut-off events.
[2024-06-20 19:56:13,667 INFO  L125   PetriNetUnfolderBase]: For 195104/195104 co-relation queries the response was YES.
[2024-06-20 19:56:13,694 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41292 conditions, 4370 events. 2806/4370 cut-off events. For 195104/195104 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 24277 event pairs, 525 based on Foata normal form. 5/4373 useless extension candidates. Maximal degree in co-relation 41171. Up to 3696 conditions per place. 
[2024-06-20 19:56:13,715 INFO  L140   encePairwiseOnDemand]: 26/41 looper letters, 363 selfloop transitions, 90 changer transitions 0/458 dead transitions.
[2024-06-20 19:56:13,716 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 458 transitions, 8064 flow
[2024-06-20 19:56:13,716 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:56:13,716 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:56:13,716 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 208 transitions.
[2024-06-20 19:56:13,717 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5073170731707317
[2024-06-20 19:56:13,717 INFO  L175             Difference]: Start difference. First operand has 253 places, 413 transitions, 6752 flow. Second operand 10 states and 208 transitions.
[2024-06-20 19:56:13,717 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 458 transitions, 8064 flow
[2024-06-20 19:56:14,034 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 458 transitions, 7812 flow, removed 108 selfloop flow, removed 2 redundant places.
[2024-06-20 19:56:14,041 INFO  L231             Difference]: Finished difference. Result has 262 places, 417 transitions, 6774 flow
[2024-06-20 19:56:14,041 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6500, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6774, PETRI_PLACES=262, PETRI_TRANSITIONS=417}
[2024-06-20 19:56:14,042 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 220 predicate places.
[2024-06-20 19:56:14,042 INFO  L495      AbstractCegarLoop]: Abstraction has has 262 places, 417 transitions, 6774 flow
[2024-06-20 19:56:14,042 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 19:56:14,042 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:56:14,042 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:56:14,042 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-20 19:56:14,042 INFO  L420      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:56:14,043 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:56:14,043 INFO  L85        PathProgramCache]: Analyzing trace with hash -603839351, now seen corresponding path program 8 times
[2024-06-20 19:56:14,043 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:56:14,043 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896121583]
[2024-06-20 19:56:14,043 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:56:14,043 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:56:14,109 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:56:23,520 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:56:23,521 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:56:23,521 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896121583]
[2024-06-20 19:56:23,521 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896121583] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:56:23,521 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:56:23,521 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:56:23,521 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018245983]
[2024-06-20 19:56:23,521 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:56:23,522 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:56:23,522 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:56:23,522 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:56:23,522 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:56:23,771 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 19:56:23,772 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 417 transitions, 6774 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 19:56:23,772 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:56:23,772 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 19:56:23,772 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:56:25,657 INFO  L124   PetriNetUnfolderBase]: 2880/4491 cut-off events.
[2024-06-20 19:56:25,657 INFO  L125   PetriNetUnfolderBase]: For 208578/208578 co-relation queries the response was YES.
[2024-06-20 19:56:25,684 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42522 conditions, 4491 events. 2880/4491 cut-off events. For 208578/208578 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 25201 event pairs, 516 based on Foata normal form. 5/4494 useless extension candidates. Maximal degree in co-relation 42397. Up to 3476 conditions per place. 
[2024-06-20 19:56:25,705 INFO  L140   encePairwiseOnDemand]: 26/41 looper letters, 337 selfloop transitions, 141 changer transitions 0/483 dead transitions.
[2024-06-20 19:56:25,706 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 483 transitions, 8566 flow
[2024-06-20 19:56:25,706 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:56:25,706 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:56:25,707 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 211 transitions.
[2024-06-20 19:56:25,707 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5146341463414634
[2024-06-20 19:56:25,707 INFO  L175             Difference]: Start difference. First operand has 262 places, 417 transitions, 6774 flow. Second operand 10 states and 211 transitions.
[2024-06-20 19:56:25,707 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 483 transitions, 8566 flow
[2024-06-20 19:56:26,067 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 483 transitions, 8254 flow, removed 64 selfloop flow, removed 8 redundant places.
[2024-06-20 19:56:26,073 INFO  L231             Difference]: Finished difference. Result has 266 places, 439 transitions, 7259 flow
[2024-06-20 19:56:26,074 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6462, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7259, PETRI_PLACES=266, PETRI_TRANSITIONS=439}
[2024-06-20 19:56:26,085 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 224 predicate places.
[2024-06-20 19:56:26,086 INFO  L495      AbstractCegarLoop]: Abstraction has has 266 places, 439 transitions, 7259 flow
[2024-06-20 19:56:26,086 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 19:56:26,086 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:56:26,086 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:56:26,086 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-20 19:56:26,087 INFO  L420      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:56:26,087 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:56:26,087 INFO  L85        PathProgramCache]: Analyzing trace with hash -447454298, now seen corresponding path program 1 times
[2024-06-20 19:56:26,087 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:56:26,087 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333207665]
[2024-06-20 19:56:26,088 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:56:26,088 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:56:26,144 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:56:36,267 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:56:36,268 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:56:36,268 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333207665]
[2024-06-20 19:56:36,268 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333207665] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:56:36,268 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:56:36,268 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:56:36,268 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308820291]
[2024-06-20 19:56:36,268 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:56:36,269 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:56:36,269 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:56:36,269 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:56:36,269 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:56:36,449 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 19:56:36,450 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 439 transitions, 7259 flow. Second operand  has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:56:36,450 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:56:36,450 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 19:56:36,450 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:56:38,007 INFO  L124   PetriNetUnfolderBase]: 2885/4497 cut-off events.
[2024-06-20 19:56:38,008 INFO  L125   PetriNetUnfolderBase]: For 215838/215838 co-relation queries the response was YES.
[2024-06-20 19:56:38,036 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43644 conditions, 4497 events. 2885/4497 cut-off events. For 215838/215838 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 25202 event pairs, 610 based on Foata normal form. 1/4496 useless extension candidates. Maximal degree in co-relation 43517. Up to 4208 conditions per place. 
[2024-06-20 19:56:38,059 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 430 selfloop transitions, 27 changer transitions 0/462 dead transitions.
[2024-06-20 19:56:38,059 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 462 transitions, 8505 flow
[2024-06-20 19:56:38,060 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:56:38,060 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:56:38,060 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions.
[2024-06-20 19:56:38,060 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44947735191637633
[2024-06-20 19:56:38,060 INFO  L175             Difference]: Start difference. First operand has 266 places, 439 transitions, 7259 flow. Second operand 7 states and 129 transitions.
[2024-06-20 19:56:38,061 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 462 transitions, 8505 flow
[2024-06-20 19:56:38,406 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 462 transitions, 8211 flow, removed 95 selfloop flow, removed 6 redundant places.
[2024-06-20 19:56:38,413 INFO  L231             Difference]: Finished difference. Result has 267 places, 445 transitions, 7227 flow
[2024-06-20 19:56:38,413 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6965, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7227, PETRI_PLACES=267, PETRI_TRANSITIONS=445}
[2024-06-20 19:56:38,413 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 225 predicate places.
[2024-06-20 19:56:38,414 INFO  L495      AbstractCegarLoop]: Abstraction has has 267 places, 445 transitions, 7227 flow
[2024-06-20 19:56:38,414 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:56:38,414 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:56:38,414 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:56:38,414 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-20 19:56:38,414 INFO  L420      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:56:38,414 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:56:38,415 INFO  L85        PathProgramCache]: Analyzing trace with hash -447334328, now seen corresponding path program 2 times
[2024-06-20 19:56:38,415 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:56:38,415 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541781596]
[2024-06-20 19:56:38,415 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:56:38,415 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:56:38,452 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:56:48,477 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:56:48,477 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:56:48,478 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541781596]
[2024-06-20 19:56:48,478 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541781596] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:56:48,478 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:56:48,479 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:56:48,479 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623066115]
[2024-06-20 19:56:48,479 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:56:48,479 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:56:48,479 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:56:48,480 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:56:48,480 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:56:48,552 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 19:56:48,552 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 445 transitions, 7227 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 19:56:48,552 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:56:48,552 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 19:56:48,552 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:56:50,182 INFO  L124   PetriNetUnfolderBase]: 2882/4493 cut-off events.
[2024-06-20 19:56:50,182 INFO  L125   PetriNetUnfolderBase]: For 217476/217476 co-relation queries the response was YES.
[2024-06-20 19:56:50,213 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43434 conditions, 4493 events. 2882/4493 cut-off events. For 217476/217476 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 25181 event pairs, 610 based on Foata normal form. 1/4492 useless extension candidates. Maximal degree in co-relation 43306. Up to 4220 conditions per place. 
[2024-06-20 19:56:50,236 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 434 selfloop transitions, 19 changer transitions 0/458 dead transitions.
[2024-06-20 19:56:50,236 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 458 transitions, 8177 flow
[2024-06-20 19:56:50,238 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:56:50,238 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:56:50,238 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions.
[2024-06-20 19:56:50,238 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43205574912891986
[2024-06-20 19:56:50,238 INFO  L175             Difference]: Start difference. First operand has 267 places, 445 transitions, 7227 flow. Second operand 7 states and 124 transitions.
[2024-06-20 19:56:50,239 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 458 transitions, 8177 flow
[2024-06-20 19:56:50,652 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 458 transitions, 7995 flow, removed 82 selfloop flow, removed 3 redundant places.
[2024-06-20 19:56:50,659 INFO  L231             Difference]: Finished difference. Result has 271 places, 445 transitions, 7089 flow
[2024-06-20 19:56:50,660 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7045, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7089, PETRI_PLACES=271, PETRI_TRANSITIONS=445}
[2024-06-20 19:56:50,661 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 229 predicate places.
[2024-06-20 19:56:50,661 INFO  L495      AbstractCegarLoop]: Abstraction has has 271 places, 445 transitions, 7089 flow
[2024-06-20 19:56:50,662 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 19:56:50,662 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:56:50,662 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:56:50,663 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-20 19:56:50,663 INFO  L420      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:56:50,663 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:56:50,663 INFO  L85        PathProgramCache]: Analyzing trace with hash -629114308, now seen corresponding path program 1 times
[2024-06-20 19:56:50,663 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:56:50,663 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413624012]
[2024-06-20 19:56:50,663 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:56:50,664 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:56:50,710 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:57:02,290 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:57:02,290 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:57:02,290 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413624012]
[2024-06-20 19:57:02,290 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413624012] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:57:02,290 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:57:02,290 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:57:02,290 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841206692]
[2024-06-20 19:57:02,290 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:57:02,291 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:57:02,291 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:57:02,291 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:57:02,291 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:57:02,481 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 19:57:02,481 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 445 transitions, 7089 flow. Second operand  has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:57:02,482 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:57:02,482 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 19:57:02,482 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:57:04,081 INFO  L124   PetriNetUnfolderBase]: 2898/4521 cut-off events.
[2024-06-20 19:57:04,082 INFO  L125   PetriNetUnfolderBase]: For 225905/225905 co-relation queries the response was YES.
[2024-06-20 19:57:04,109 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43578 conditions, 4521 events. 2898/4521 cut-off events. For 225905/225905 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 25364 event pairs, 502 based on Foata normal form. 6/4525 useless extension candidates. Maximal degree in co-relation 43448. Up to 3978 conditions per place. 
[2024-06-20 19:57:04,131 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 399 selfloop transitions, 76 changer transitions 0/480 dead transitions.
[2024-06-20 19:57:04,131 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 480 transitions, 8357 flow
[2024-06-20 19:57:04,132 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:57:04,132 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:57:04,137 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions.
[2024-06-20 19:57:04,138 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4847560975609756
[2024-06-20 19:57:04,138 INFO  L175             Difference]: Start difference. First operand has 271 places, 445 transitions, 7089 flow. Second operand 8 states and 159 transitions.
[2024-06-20 19:57:04,138 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 480 transitions, 8357 flow
[2024-06-20 19:57:04,479 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 480 transitions, 8279 flow, removed 13 selfloop flow, removed 6 redundant places.
[2024-06-20 19:57:04,485 INFO  L231             Difference]: Finished difference. Result has 274 places, 455 transitions, 7311 flow
[2024-06-20 19:57:04,486 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7011, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7311, PETRI_PLACES=274, PETRI_TRANSITIONS=455}
[2024-06-20 19:57:04,488 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 232 predicate places.
[2024-06-20 19:57:04,488 INFO  L495      AbstractCegarLoop]: Abstraction has has 274 places, 455 transitions, 7311 flow
[2024-06-20 19:57:04,488 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:57:04,488 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:57:04,489 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:57:04,489 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-20 19:57:04,489 INFO  L420      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:57:04,489 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:57:04,489 INFO  L85        PathProgramCache]: Analyzing trace with hash -10476646, now seen corresponding path program 2 times
[2024-06-20 19:57:04,489 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:57:04,489 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702121946]
[2024-06-20 19:57:04,490 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:57:04,490 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:57:04,529 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:57:14,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 19:57:14,737 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:57:14,737 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702121946]
[2024-06-20 19:57:14,737 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702121946] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:57:14,737 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:57:14,737 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:57:14,738 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087605373]
[2024-06-20 19:57:14,739 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:57:14,739 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:57:14,739 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:57:14,739 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:57:14,739 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:57:14,913 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 19:57:14,915 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 455 transitions, 7311 flow. Second operand  has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:57:14,915 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:57:14,915 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 19:57:14,915 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:57:16,513 INFO  L124   PetriNetUnfolderBase]: 2948/4592 cut-off events.
[2024-06-20 19:57:16,513 INFO  L125   PetriNetUnfolderBase]: For 239483/239483 co-relation queries the response was YES.
[2024-06-20 19:57:16,546 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44709 conditions, 4592 events. 2948/4592 cut-off events. For 239483/239483 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 25765 event pairs, 508 based on Foata normal form. 10/4600 useless extension candidates. Maximal degree in co-relation 44577. Up to 4016 conditions per place. 
[2024-06-20 19:57:16,569 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 395 selfloop transitions, 89 changer transitions 0/489 dead transitions.
[2024-06-20 19:57:16,570 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 489 transitions, 8690 flow
[2024-06-20 19:57:16,570 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:57:16,570 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:57:16,571 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions.
[2024-06-20 19:57:16,571 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4912891986062718
[2024-06-20 19:57:16,571 INFO  L175             Difference]: Start difference. First operand has 274 places, 455 transitions, 7311 flow. Second operand 7 states and 141 transitions.
[2024-06-20 19:57:16,571 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 489 transitions, 8690 flow
[2024-06-20 19:57:16,914 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 489 transitions, 8445 flow, removed 35 selfloop flow, removed 7 redundant places.
[2024-06-20 19:57:16,920 INFO  L231             Difference]: Finished difference. Result has 274 places, 466 transitions, 7495 flow
[2024-06-20 19:57:16,921 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7081, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=455, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7495, PETRI_PLACES=274, PETRI_TRANSITIONS=466}
[2024-06-20 19:57:16,921 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 232 predicate places.
[2024-06-20 19:57:16,921 INFO  L495      AbstractCegarLoop]: Abstraction has has 274 places, 466 transitions, 7495 flow
[2024-06-20 19:57:16,921 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:57:16,922 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:57:16,922 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:57:16,922 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-20 19:57:16,922 INFO  L420      AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:57:16,922 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:57:16,922 INFO  L85        PathProgramCache]: Analyzing trace with hash -10239496, now seen corresponding path program 3 times
[2024-06-20 19:57:16,922 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:57:16,923 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055317724]
[2024-06-20 19:57:16,923 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:57:16,923 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:57:16,958 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:57:26,016 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:57:26,017 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:57:26,017 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055317724]
[2024-06-20 19:57:26,017 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055317724] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:57:26,017 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:57:26,017 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:57:26,017 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299012044]
[2024-06-20 19:57:26,017 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:57:26,018 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:57:26,018 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:57:26,018 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:57:26,018 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:57:26,157 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 19:57:26,158 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 466 transitions, 7495 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 19:57:26,158 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:57:26,158 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 19:57:26,158 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:57:27,572 INFO  L124   PetriNetUnfolderBase]: 2889/4485 cut-off events.
[2024-06-20 19:57:27,572 INFO  L125   PetriNetUnfolderBase]: For 236406/236406 co-relation queries the response was YES.
[2024-06-20 19:57:27,605 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43494 conditions, 4485 events. 2889/4485 cut-off events. For 236406/236406 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 24935 event pairs, 568 based on Foata normal form. 6/4485 useless extension candidates. Maximal degree in co-relation 43364. Up to 4180 conditions per place. 
[2024-06-20 19:57:27,627 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 440 selfloop transitions, 33 changer transitions 0/478 dead transitions.
[2024-06-20 19:57:27,627 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 478 transitions, 8504 flow
[2024-06-20 19:57:27,629 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:57:27,629 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:57:27,630 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions.
[2024-06-20 19:57:27,630 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45121951219512196
[2024-06-20 19:57:27,630 INFO  L175             Difference]: Start difference. First operand has 274 places, 466 transitions, 7495 flow. Second operand 6 states and 111 transitions.
[2024-06-20 19:57:27,630 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 478 transitions, 8504 flow
[2024-06-20 19:57:28,157 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 478 transitions, 8284 flow, removed 29 selfloop flow, removed 6 redundant places.
[2024-06-20 19:57:28,163 INFO  L231             Difference]: Finished difference. Result has 274 places, 468 transitions, 7377 flow
[2024-06-20 19:57:28,163 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7275, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=466, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7377, PETRI_PLACES=274, PETRI_TRANSITIONS=468}
[2024-06-20 19:57:28,164 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 232 predicate places.
[2024-06-20 19:57:28,164 INFO  L495      AbstractCegarLoop]: Abstraction has has 274 places, 468 transitions, 7377 flow
[2024-06-20 19:57:28,164 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 19:57:28,164 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:57:28,164 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:57:28,164 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-20 19:57:28,165 INFO  L420      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:57:28,165 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:57:28,165 INFO  L85        PathProgramCache]: Analyzing trace with hash -10230568, now seen corresponding path program 1 times
[2024-06-20 19:57:28,165 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:57:28,165 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588755459]
[2024-06-20 19:57:28,165 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:57:28,166 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:57:28,202 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:57:41,442 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:57:41,442 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:57:41,442 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588755459]
[2024-06-20 19:57:41,442 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588755459] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:57:41,442 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:57:41,442 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:57:41,443 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249285911]
[2024-06-20 19:57:41,443 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:57:41,443 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:57:41,443 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:57:41,443 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:57:41,443 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:57:41,553 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 19:57:41,553 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 468 transitions, 7377 flow. Second operand  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:57:41,554 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:57:41,554 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 19:57:41,554 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:57:43,226 INFO  L124   PetriNetUnfolderBase]: 2928/4553 cut-off events.
[2024-06-20 19:57:43,227 INFO  L125   PetriNetUnfolderBase]: For 240988/240988 co-relation queries the response was YES.
[2024-06-20 19:57:43,258 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43179 conditions, 4553 events. 2928/4553 cut-off events. For 240988/240988 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 25416 event pairs, 566 based on Foata normal form. 14/4565 useless extension candidates. Maximal degree in co-relation 43050. Up to 4092 conditions per place. 
[2024-06-20 19:57:43,279 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 420 selfloop transitions, 66 changer transitions 0/491 dead transitions.
[2024-06-20 19:57:43,280 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 491 transitions, 8537 flow
[2024-06-20 19:57:43,280 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:57:43,280 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:57:43,281 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions.
[2024-06-20 19:57:43,281 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4808362369337979
[2024-06-20 19:57:43,281 INFO  L175             Difference]: Start difference. First operand has 274 places, 468 transitions, 7377 flow. Second operand 7 states and 138 transitions.
[2024-06-20 19:57:43,281 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 491 transitions, 8537 flow
[2024-06-20 19:57:43,688 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 491 transitions, 8458 flow, removed 11 selfloop flow, removed 4 redundant places.
[2024-06-20 19:57:43,695 INFO  L231             Difference]: Finished difference. Result has 277 places, 470 transitions, 7482 flow
[2024-06-20 19:57:43,695 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7298, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7482, PETRI_PLACES=277, PETRI_TRANSITIONS=470}
[2024-06-20 19:57:43,695 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 235 predicate places.
[2024-06-20 19:57:43,695 INFO  L495      AbstractCegarLoop]: Abstraction has has 277 places, 470 transitions, 7482 flow
[2024-06-20 19:57:43,696 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:57:43,696 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:57:43,696 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:57:43,696 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-20 19:57:43,696 INFO  L420      AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:57:43,696 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:57:43,696 INFO  L85        PathProgramCache]: Analyzing trace with hash -823143596, now seen corresponding path program 1 times
[2024-06-20 19:57:43,697 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:57:43,697 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094692569]
[2024-06-20 19:57:43,697 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:57:43,697 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:57:43,771 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:57:52,794 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:57:52,794 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:57:52,794 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094692569]
[2024-06-20 19:57:52,794 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094692569] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:57:52,794 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:57:52,794 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:57:52,794 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949001334]
[2024-06-20 19:57:52,794 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:57:52,795 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:57:52,795 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:57:52,795 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:57:52,795 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:57:52,973 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 19:57:52,974 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 470 transitions, 7482 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 19:57:52,974 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:57:52,974 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 19:57:52,974 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:57:54,751 INFO  L124   PetriNetUnfolderBase]: 2945/4580 cut-off events.
[2024-06-20 19:57:54,751 INFO  L125   PetriNetUnfolderBase]: For 239317/239317 co-relation queries the response was YES.
[2024-06-20 19:57:54,780 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43742 conditions, 4580 events. 2945/4580 cut-off events. For 239317/239317 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 25548 event pairs, 391 based on Foata normal form. 4/4582 useless extension candidates. Maximal degree in co-relation 43612. Up to 4139 conditions per place. 
[2024-06-20 19:57:54,802 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 480 selfloop transitions, 27 changer transitions 0/512 dead transitions.
[2024-06-20 19:57:54,802 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 512 transitions, 8780 flow
[2024-06-20 19:57:54,804 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:57:54,804 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:57:54,805 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions.
[2024-06-20 19:57:54,805 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45799457994579945
[2024-06-20 19:57:54,805 INFO  L175             Difference]: Start difference. First operand has 277 places, 470 transitions, 7482 flow. Second operand 9 states and 169 transitions.
[2024-06-20 19:57:54,805 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 512 transitions, 8780 flow
[2024-06-20 19:57:55,225 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 512 transitions, 8630 flow, removed 14 selfloop flow, removed 5 redundant places.
[2024-06-20 19:57:55,232 INFO  L231             Difference]: Finished difference. Result has 283 places, 478 transitions, 7588 flow
[2024-06-20 19:57:55,232 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7332, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7588, PETRI_PLACES=283, PETRI_TRANSITIONS=478}
[2024-06-20 19:57:55,233 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 241 predicate places.
[2024-06-20 19:57:55,233 INFO  L495      AbstractCegarLoop]: Abstraction has has 283 places, 478 transitions, 7588 flow
[2024-06-20 19:57:55,233 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 19:57:55,233 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:57:55,233 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:57:55,233 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-20 19:57:55,233 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 19:57:55,234 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:57:55,234 INFO  L85        PathProgramCache]: Analyzing trace with hash -1612333168, now seen corresponding path program 2 times
[2024-06-20 19:57:55,234 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:57:55,234 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960305415]
[2024-06-20 19:57:55,234 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:57:55,234 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:57:55,286 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:58:03,469 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:58:03,469 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:58:03,469 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960305415]
[2024-06-20 19:58:03,469 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960305415] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:58:03,469 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:58:03,469 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:58:03,469 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175316736]
[2024-06-20 19:58:03,469 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:58:03,469 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:58:03,470 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:58:03,470 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:58:03,470 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:58:03,676 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 19:58:03,676 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 478 transitions, 7588 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 19:58:03,676 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:58:03,676 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 19:58:03,676 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:58:05,644 INFO  L124   PetriNetUnfolderBase]: 3006/4676 cut-off events.
[2024-06-20 19:58:05,644 INFO  L125   PetriNetUnfolderBase]: For 263150/263150 co-relation queries the response was YES.
[2024-06-20 19:58:05,673 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44818 conditions, 4676 events. 3006/4676 cut-off events. For 263150/263150 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 26260 event pairs, 518 based on Foata normal form. 16/4690 useless extension candidates. Maximal degree in co-relation 44685. Up to 4213 conditions per place. 
[2024-06-20 19:58:05,694 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 458 selfloop transitions, 57 changer transitions 0/520 dead transitions.
[2024-06-20 19:58:05,694 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 520 transitions, 8954 flow
[2024-06-20 19:58:05,695 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:58:05,695 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:58:05,696 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 201 transitions.
[2024-06-20 19:58:05,696 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4902439024390244
[2024-06-20 19:58:05,696 INFO  L175             Difference]: Start difference. First operand has 283 places, 478 transitions, 7588 flow. Second operand 10 states and 201 transitions.
[2024-06-20 19:58:05,696 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 520 transitions, 8954 flow
[2024-06-20 19:58:06,098 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 520 transitions, 8814 flow, removed 64 selfloop flow, removed 3 redundant places.
[2024-06-20 19:58:06,105 INFO  L231             Difference]: Finished difference. Result has 290 places, 481 transitions, 7697 flow
[2024-06-20 19:58:06,106 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7448, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7697, PETRI_PLACES=290, PETRI_TRANSITIONS=481}
[2024-06-20 19:58:06,106 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 248 predicate places.
[2024-06-20 19:58:06,106 INFO  L495      AbstractCegarLoop]: Abstraction has has 290 places, 481 transitions, 7697 flow
[2024-06-20 19:58:06,106 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 19:58:06,107 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:58:06,107 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:58:06,107 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-20 19:58:06,107 INFO  L420      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:58:06,107 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:58:06,107 INFO  L85        PathProgramCache]: Analyzing trace with hash -734577836, now seen corresponding path program 3 times
[2024-06-20 19:58:06,107 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:58:06,108 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235334387]
[2024-06-20 19:58:06,108 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:58:06,108 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:58:06,168 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:58:16,283 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:58:16,284 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:58:16,284 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235334387]
[2024-06-20 19:58:16,284 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235334387] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:58:16,284 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:58:16,284 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:58:16,284 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316070779]
[2024-06-20 19:58:16,285 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:58:16,285 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:58:16,285 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:58:16,285 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:58:16,285 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:58:16,448 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 19:58:16,448 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 481 transitions, 7697 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 19:58:16,449 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:58:16,449 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 19:58:16,449 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:58:18,424 INFO  L124   PetriNetUnfolderBase]: 3075/4783 cut-off events.
[2024-06-20 19:58:18,424 INFO  L125   PetriNetUnfolderBase]: For 276812/276812 co-relation queries the response was YES.
[2024-06-20 19:58:18,460 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45937 conditions, 4783 events. 3075/4783 cut-off events. For 276812/276812 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 26955 event pairs, 509 based on Foata normal form. 16/4797 useless extension candidates. Maximal degree in co-relation 45802. Up to 4162 conditions per place. 
[2024-06-20 19:58:18,484 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 465 selfloop transitions, 60 changer transitions 0/530 dead transitions.
[2024-06-20 19:58:18,484 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 530 transitions, 9239 flow
[2024-06-20 19:58:18,485 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:58:18,485 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:58:18,485 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 205 transitions.
[2024-06-20 19:58:18,486 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5
[2024-06-20 19:58:18,486 INFO  L175             Difference]: Start difference. First operand has 290 places, 481 transitions, 7697 flow. Second operand 10 states and 205 transitions.
[2024-06-20 19:58:18,486 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 530 transitions, 9239 flow
[2024-06-20 19:58:18,987 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 530 transitions, 9040 flow, removed 46 selfloop flow, removed 8 redundant places.
[2024-06-20 19:58:18,995 INFO  L231             Difference]: Finished difference. Result has 293 places, 487 transitions, 7852 flow
[2024-06-20 19:58:18,995 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7498, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=422, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7852, PETRI_PLACES=293, PETRI_TRANSITIONS=487}
[2024-06-20 19:58:18,995 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 251 predicate places.
[2024-06-20 19:58:18,996 INFO  L495      AbstractCegarLoop]: Abstraction has has 293 places, 487 transitions, 7852 flow
[2024-06-20 19:58:18,996 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 19:58:18,996 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:58:18,996 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:58:18,996 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-20 19:58:18,996 INFO  L420      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:58:18,997 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:58:18,997 INFO  L85        PathProgramCache]: Analyzing trace with hash 1039717494, now seen corresponding path program 1 times
[2024-06-20 19:58:18,997 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:58:18,997 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654618974]
[2024-06-20 19:58:18,997 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:58:18,997 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:58:19,063 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:58:27,441 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:58:27,441 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:58:27,441 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654618974]
[2024-06-20 19:58:27,441 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654618974] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:58:27,441 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:58:27,441 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:58:27,441 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366272656]
[2024-06-20 19:58:27,441 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:58:27,442 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:58:27,442 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:58:27,442 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:58:27,442 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:58:27,764 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 19:58:27,765 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 487 transitions, 7852 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 19:58:27,765 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:58:27,765 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 19:58:27,765 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:58:29,888 INFO  L124   PetriNetUnfolderBase]: 3279/5126 cut-off events.
[2024-06-20 19:58:29,888 INFO  L125   PetriNetUnfolderBase]: For 350876/350876 co-relation queries the response was YES.
[2024-06-20 19:58:29,926 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 49215 conditions, 5126 events. 3279/5126 cut-off events. For 350876/350876 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 29362 event pairs, 618 based on Foata normal form. 65/5189 useless extension candidates. Maximal degree in co-relation 49078. Up to 4196 conditions per place. 
[2024-06-20 19:58:29,951 INFO  L140   encePairwiseOnDemand]: 26/41 looper letters, 431 selfloop transitions, 103 changer transitions 7/546 dead transitions.
[2024-06-20 19:58:29,951 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 546 transitions, 9618 flow
[2024-06-20 19:58:29,951 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:58:29,952 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:58:29,952 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 212 transitions.
[2024-06-20 19:58:29,952 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5170731707317073
[2024-06-20 19:58:29,952 INFO  L175             Difference]: Start difference. First operand has 293 places, 487 transitions, 7852 flow. Second operand 10 states and 212 transitions.
[2024-06-20 19:58:29,952 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 546 transitions, 9618 flow
[2024-06-20 19:58:30,519 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 546 transitions, 9380 flow, removed 86 selfloop flow, removed 6 redundant places.
[2024-06-20 19:58:30,527 INFO  L231             Difference]: Finished difference. Result has 300 places, 498 transitions, 8295 flow
[2024-06-20 19:58:30,527 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7614, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=487, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8295, PETRI_PLACES=300, PETRI_TRANSITIONS=498}
[2024-06-20 19:58:30,527 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 258 predicate places.
[2024-06-20 19:58:30,527 INFO  L495      AbstractCegarLoop]: Abstraction has has 300 places, 498 transitions, 8295 flow
[2024-06-20 19:58:30,528 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 19:58:30,528 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:58:30,528 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:58:30,528 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-20 19:58:30,528 INFO  L420      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:58:30,529 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:58:30,529 INFO  L85        PathProgramCache]: Analyzing trace with hash 1756580154, now seen corresponding path program 4 times
[2024-06-20 19:58:30,529 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:58:30,529 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268954241]
[2024-06-20 19:58:30,529 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:58:30,529 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:58:30,609 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:58:38,802 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:58:38,803 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:58:38,803 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268954241]
[2024-06-20 19:58:38,803 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268954241] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:58:38,803 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:58:38,803 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:58:38,803 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558076788]
[2024-06-20 19:58:38,803 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:58:38,804 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:58:38,804 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:58:38,804 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:58:38,804 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:58:38,948 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41
[2024-06-20 19:58:38,949 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 498 transitions, 8295 flow. Second operand  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:58:38,949 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:58:38,949 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41
[2024-06-20 19:58:38,949 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:58:40,895 INFO  L124   PetriNetUnfolderBase]: 3276/5130 cut-off events.
[2024-06-20 19:58:40,895 INFO  L125   PetriNetUnfolderBase]: For 315742/315742 co-relation queries the response was YES.
[2024-06-20 19:58:40,940 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 50414 conditions, 5130 events. 3276/5130 cut-off events. For 315742/315742 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 29319 event pairs, 646 based on Foata normal form. 4/5132 useless extension candidates. Maximal degree in co-relation 50272. Up to 4780 conditions per place. 
[2024-06-20 19:58:40,969 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 505 selfloop transitions, 26 changer transitions 0/536 dead transitions.
[2024-06-20 19:58:40,970 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 536 transitions, 9647 flow
[2024-06-20 19:58:40,972 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:58:40,972 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:58:40,972 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions.
[2024-06-20 19:58:40,972 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4796747967479675
[2024-06-20 19:58:40,973 INFO  L175             Difference]: Start difference. First operand has 300 places, 498 transitions, 8295 flow. Second operand 9 states and 177 transitions.
[2024-06-20 19:58:40,973 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 536 transitions, 9647 flow
[2024-06-20 19:58:41,789 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 536 transitions, 9277 flow, removed 149 selfloop flow, removed 4 redundant places.
[2024-06-20 19:58:41,797 INFO  L231             Difference]: Finished difference. Result has 308 places, 506 transitions, 8205 flow
[2024-06-20 19:58:41,797 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7925, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=498, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=472, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8205, PETRI_PLACES=308, PETRI_TRANSITIONS=506}
[2024-06-20 19:58:41,797 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 266 predicate places.
[2024-06-20 19:58:41,797 INFO  L495      AbstractCegarLoop]: Abstraction has has 308 places, 506 transitions, 8205 flow
[2024-06-20 19:58:41,798 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:58:41,798 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:58:41,798 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:58:41,798 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-20 19:58:41,798 INFO  L420      AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:58:41,799 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:58:41,799 INFO  L85        PathProgramCache]: Analyzing trace with hash 1158616374, now seen corresponding path program 5 times
[2024-06-20 19:58:41,799 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:58:41,799 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033912794]
[2024-06-20 19:58:41,799 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:58:41,799 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:58:41,857 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:58:51,012 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:58:51,012 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:58:51,012 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033912794]
[2024-06-20 19:58:51,013 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033912794] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:58:51,013 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:58:51,013 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:58:51,013 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501610923]
[2024-06-20 19:58:51,013 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:58:51,013 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:58:51,014 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:58:51,016 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:58:51,016 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:58:51,168 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 19:58:51,173 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 506 transitions, 8205 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 19:58:51,173 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:58:51,174 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 19:58:51,175 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:58:53,286 INFO  L124   PetriNetUnfolderBase]: 3337/5219 cut-off events.
[2024-06-20 19:58:53,287 INFO  L125   PetriNetUnfolderBase]: For 336689/336689 co-relation queries the response was YES.
[2024-06-20 19:58:53,328 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51077 conditions, 5219 events. 3337/5219 cut-off events. For 336689/336689 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 29910 event pairs, 631 based on Foata normal form. 16/5233 useless extension candidates. Maximal degree in co-relation 50930. Up to 4651 conditions per place. 
[2024-06-20 19:58:53,354 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 459 selfloop transitions, 83 changer transitions 0/547 dead transitions.
[2024-06-20 19:58:53,355 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 547 transitions, 9657 flow
[2024-06-20 19:58:53,355 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:58:53,355 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:58:53,355 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 203 transitions.
[2024-06-20 19:58:53,356 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4951219512195122
[2024-06-20 19:58:53,356 INFO  L175             Difference]: Start difference. First operand has 308 places, 506 transitions, 8205 flow. Second operand 10 states and 203 transitions.
[2024-06-20 19:58:53,356 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 547 transitions, 9657 flow
[2024-06-20 19:58:53,997 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 547 transitions, 9563 flow, removed 32 selfloop flow, removed 4 redundant places.
[2024-06-20 19:58:54,006 INFO  L231             Difference]: Finished difference. Result has 314 places, 509 transitions, 8433 flow
[2024-06-20 19:58:54,006 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8111, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=506, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8433, PETRI_PLACES=314, PETRI_TRANSITIONS=509}
[2024-06-20 19:58:54,006 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 272 predicate places.
[2024-06-20 19:58:54,007 INFO  L495      AbstractCegarLoop]: Abstraction has has 314 places, 509 transitions, 8433 flow
[2024-06-20 19:58:54,007 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 19:58:54,007 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:58:54,007 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:58:54,007 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-20 19:58:54,008 INFO  L420      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:58:54,008 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:58:54,008 INFO  L85        PathProgramCache]: Analyzing trace with hash -615673004, now seen corresponding path program 6 times
[2024-06-20 19:58:54,008 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:58:54,008 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292363882]
[2024-06-20 19:58:54,008 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:58:54,009 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:58:54,085 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:59:03,027 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:59:03,027 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:59:03,027 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292363882]
[2024-06-20 19:59:03,027 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292363882] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:59:03,028 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:59:03,028 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:59:03,028 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615812340]
[2024-06-20 19:59:03,028 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:59:03,029 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:59:03,029 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:59:03,029 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:59:03,029 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:59:03,356 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 19:59:03,356 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 509 transitions, 8433 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 19:59:03,356 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:59:03,356 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 19:59:03,356 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:59:05,578 INFO  L124   PetriNetUnfolderBase]: 3494/5469 cut-off events.
[2024-06-20 19:59:05,578 INFO  L125   PetriNetUnfolderBase]: For 380216/380216 co-relation queries the response was YES.
[2024-06-20 19:59:05,619 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 54875 conditions, 5469 events. 3494/5469 cut-off events. For 380216/380216 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 31656 event pairs, 657 based on Foata normal form. 16/5483 useless extension candidates. Maximal degree in co-relation 54727. Up to 4716 conditions per place. 
[2024-06-20 19:59:05,648 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 482 selfloop transitions, 81 changer transitions 0/568 dead transitions.
[2024-06-20 19:59:05,648 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 568 transitions, 10765 flow
[2024-06-20 19:59:05,649 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:59:05,649 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:59:05,649 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 193 transitions.
[2024-06-20 19:59:05,649 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5230352303523035
[2024-06-20 19:59:05,650 INFO  L175             Difference]: Start difference. First operand has 314 places, 509 transitions, 8433 flow. Second operand 9 states and 193 transitions.
[2024-06-20 19:59:05,650 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 568 transitions, 10765 flow
[2024-06-20 19:59:06,440 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 568 transitions, 10515 flow, removed 45 selfloop flow, removed 8 redundant places.
[2024-06-20 19:59:06,448 INFO  L231             Difference]: Finished difference. Result has 318 places, 524 transitions, 9028 flow
[2024-06-20 19:59:06,448 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8183, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9028, PETRI_PLACES=318, PETRI_TRANSITIONS=524}
[2024-06-20 19:59:06,449 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 276 predicate places.
[2024-06-20 19:59:06,449 INFO  L495      AbstractCegarLoop]: Abstraction has has 318 places, 524 transitions, 9028 flow
[2024-06-20 19:59:06,449 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 19:59:06,449 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:59:06,449 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:59:06,449 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-20 19:59:06,449 INFO  L420      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:59:06,450 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:59:06,450 INFO  L85        PathProgramCache]: Analyzing trace with hash 1357924116, now seen corresponding path program 2 times
[2024-06-20 19:59:06,450 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:59:06,450 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745832123]
[2024-06-20 19:59:06,450 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:59:06,450 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:59:06,522 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:59:16,203 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:59:16,204 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:59:16,204 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745832123]
[2024-06-20 19:59:16,204 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745832123] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:59:16,204 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:59:16,204 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:59:16,204 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141991063]
[2024-06-20 19:59:16,204 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:59:16,205 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:59:16,205 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:59:16,205 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:59:16,205 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:59:16,382 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-20 19:59:16,383 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 524 transitions, 9028 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 19:59:16,383 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:59:16,383 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-20 19:59:16,383 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:59:18,863 INFO  L124   PetriNetUnfolderBase]: 3684/5777 cut-off events.
[2024-06-20 19:59:18,864 INFO  L125   PetriNetUnfolderBase]: For 471058/471058 co-relation queries the response was YES.
[2024-06-20 19:59:18,912 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 58531 conditions, 5777 events. 3684/5777 cut-off events. For 471058/471058 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 33774 event pairs, 734 based on Foata normal form. 58/5833 useless extension candidates. Maximal degree in co-relation 58379. Up to 4942 conditions per place. 
[2024-06-20 19:59:19,079 INFO  L140   encePairwiseOnDemand]: 26/41 looper letters, 472 selfloop transitions, 89 changer transitions 5/571 dead transitions.
[2024-06-20 19:59:19,079 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 571 transitions, 10568 flow
[2024-06-20 19:59:19,080 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-20 19:59:19,080 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-20 19:59:19,080 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 212 transitions.
[2024-06-20 19:59:19,081 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4700665188470067
[2024-06-20 19:59:19,081 INFO  L175             Difference]: Start difference. First operand has 318 places, 524 transitions, 9028 flow. Second operand 11 states and 212 transitions.
[2024-06-20 19:59:19,081 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 571 transitions, 10568 flow
[2024-06-20 19:59:19,964 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 571 transitions, 10384 flow, removed 65 selfloop flow, removed 4 redundant places.
[2024-06-20 19:59:19,972 INFO  L231             Difference]: Finished difference. Result has 325 places, 525 transitions, 9148 flow
[2024-06-20 19:59:19,972 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8844, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9148, PETRI_PLACES=325, PETRI_TRANSITIONS=525}
[2024-06-20 19:59:19,973 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 283 predicate places.
[2024-06-20 19:59:19,973 INFO  L495      AbstractCegarLoop]: Abstraction has has 325 places, 525 transitions, 9148 flow
[2024-06-20 19:59:19,973 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 19:59:19,973 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:59:19,973 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:59:19,973 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-20 19:59:19,973 INFO  L420      AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:59:19,974 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:59:19,974 INFO  L85        PathProgramCache]: Analyzing trace with hash -408598832, now seen corresponding path program 3 times
[2024-06-20 19:59:19,974 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:59:19,974 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503437337]
[2024-06-20 19:59:19,974 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:59:19,974 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:59:20,037 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:59:29,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 19:59:29,982 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:59:29,982 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503437337]
[2024-06-20 19:59:29,982 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503437337] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:59:29,982 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:59:29,982 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:59:29,982 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573437271]
[2024-06-20 19:59:29,982 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:59:29,983 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:59:29,983 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:59:29,984 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:59:29,984 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:59:30,281 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 19:59:30,282 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 525 transitions, 9148 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 19:59:30,282 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:59:30,282 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 19:59:30,282 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:59:33,197 INFO  L124   PetriNetUnfolderBase]: 4397/6972 cut-off events.
[2024-06-20 19:59:33,198 INFO  L125   PetriNetUnfolderBase]: For 618358/618358 co-relation queries the response was YES.
[2024-06-20 19:59:33,249 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 73065 conditions, 6972 events. 4397/6972 cut-off events. For 618358/618358 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 42489 event pairs, 907 based on Foata normal form. 48/7018 useless extension candidates. Maximal degree in co-relation 72912. Up to 4740 conditions per place. 
[2024-06-20 19:59:33,283 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 447 selfloop transitions, 145 changer transitions 0/597 dead transitions.
[2024-06-20 19:59:33,283 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 597 transitions, 11862 flow
[2024-06-20 19:59:33,284 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-20 19:59:33,284 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-20 19:59:33,284 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 235 transitions.
[2024-06-20 19:59:33,284 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5210643015521065
[2024-06-20 19:59:33,285 INFO  L175             Difference]: Start difference. First operand has 325 places, 525 transitions, 9148 flow. Second operand 11 states and 235 transitions.
[2024-06-20 19:59:33,285 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 597 transitions, 11862 flow
[2024-06-20 19:59:34,408 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 597 transitions, 11610 flow, removed 39 selfloop flow, removed 9 redundant places.
[2024-06-20 19:59:34,417 INFO  L231             Difference]: Finished difference. Result has 331 places, 541 transitions, 9981 flow
[2024-06-20 19:59:34,417 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8896, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=131, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9981, PETRI_PLACES=331, PETRI_TRANSITIONS=541}
[2024-06-20 19:59:34,418 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 289 predicate places.
[2024-06-20 19:59:34,418 INFO  L495      AbstractCegarLoop]: Abstraction has has 331 places, 541 transitions, 9981 flow
[2024-06-20 19:59:34,418 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 19:59:34,418 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:59:34,418 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:59:34,418 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-20 19:59:34,418 INFO  L420      AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:59:34,419 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:59:34,419 INFO  L85        PathProgramCache]: Analyzing trace with hash 1763937756, now seen corresponding path program 4 times
[2024-06-20 19:59:34,419 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:59:34,419 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621867872]
[2024-06-20 19:59:34,419 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:59:34,419 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:59:34,486 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:59:44,199 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:59:44,199 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:59:44,199 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621867872]
[2024-06-20 19:59:44,199 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621867872] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:59:44,199 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:59:44,199 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:59:44,199 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259008431]
[2024-06-20 19:59:44,199 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:59:44,199 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:59:44,199 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:59:44,200 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:59:44,200 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:59:44,453 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 19:59:44,454 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 541 transitions, 9981 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 19:59:44,454 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:59:44,454 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 19:59:44,454 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:59:47,579 INFO  L124   PetriNetUnfolderBase]: 4619/7364 cut-off events.
[2024-06-20 19:59:47,580 INFO  L125   PetriNetUnfolderBase]: For 679338/679338 co-relation queries the response was YES.
[2024-06-20 19:59:47,636 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 78510 conditions, 7364 events. 4619/7364 cut-off events. For 679338/679338 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 45838 event pairs, 1119 based on Foata normal form. 59/7421 useless extension candidates. Maximal degree in co-relation 78352. Up to 6275 conditions per place. 
[2024-06-20 19:59:47,670 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 445 selfloop transitions, 141 changer transitions 3/594 dead transitions.
[2024-06-20 19:59:47,671 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 594 transitions, 12031 flow
[2024-06-20 19:59:47,671 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-20 19:59:47,671 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-20 19:59:47,672 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 230 transitions.
[2024-06-20 19:59:47,672 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5099778270509978
[2024-06-20 19:59:47,672 INFO  L175             Difference]: Start difference. First operand has 331 places, 541 transitions, 9981 flow. Second operand 11 states and 230 transitions.
[2024-06-20 19:59:47,672 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 594 transitions, 12031 flow
[2024-06-20 19:59:48,946 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 594 transitions, 11815 flow, removed 87 selfloop flow, removed 3 redundant places.
[2024-06-20 19:59:48,954 INFO  L231             Difference]: Finished difference. Result has 340 places, 545 transitions, 10308 flow
[2024-06-20 19:59:48,955 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=9807, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10308, PETRI_PLACES=340, PETRI_TRANSITIONS=545}
[2024-06-20 19:59:48,955 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 298 predicate places.
[2024-06-20 19:59:48,955 INFO  L495      AbstractCegarLoop]: Abstraction has has 340 places, 545 transitions, 10308 flow
[2024-06-20 19:59:48,956 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 19:59:48,956 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:59:48,956 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:59:48,956 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-20 19:59:48,956 INFO  L420      AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:59:48,956 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:59:48,956 INFO  L85        PathProgramCache]: Analyzing trace with hash -2050586672, now seen corresponding path program 5 times
[2024-06-20 19:59:48,957 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:59:48,957 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377615080]
[2024-06-20 19:59:48,957 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:59:48,957 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:59:49,023 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:00:00,219 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:00:00,219 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:00:00,219 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377615080]
[2024-06-20 20:00:00,220 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377615080] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:00:00,220 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:00:00,220 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 20:00:00,220 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603970980]
[2024-06-20 20:00:00,220 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:00:00,220 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 20:00:00,220 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:00:00,221 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 20:00:00,221 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-20 20:00:00,416 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 20:00:00,417 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 545 transitions, 10308 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 20:00:00,417 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:00:00,417 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 20:00:00,417 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:00:03,406 INFO  L124   PetriNetUnfolderBase]: 4778/7653 cut-off events.
[2024-06-20 20:00:03,407 INFO  L125   PetriNetUnfolderBase]: For 740336/740336 co-relation queries the response was YES.
[2024-06-20 20:00:03,472 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 79216 conditions, 7653 events. 4778/7653 cut-off events. For 740336/740336 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 48351 event pairs, 1232 based on Foata normal form. 106/7757 useless extension candidates. Maximal degree in co-relation 79055. Up to 6547 conditions per place. 
[2024-06-20 20:00:03,508 INFO  L140   encePairwiseOnDemand]: 26/41 looper letters, 519 selfloop transitions, 62 changer transitions 7/593 dead transitions.
[2024-06-20 20:00:03,508 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 593 transitions, 11981 flow
[2024-06-20 20:00:03,508 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-20 20:00:03,509 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-20 20:00:03,509 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 222 transitions.
[2024-06-20 20:00:03,509 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49223946784922396
[2024-06-20 20:00:03,509 INFO  L175             Difference]: Start difference. First operand has 340 places, 545 transitions, 10308 flow. Second operand 11 states and 222 transitions.
[2024-06-20 20:00:03,509 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 593 transitions, 11981 flow
[2024-06-20 20:00:04,990 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 593 transitions, 11590 flow, removed 61 selfloop flow, removed 8 redundant places.
[2024-06-20 20:00:04,999 INFO  L231             Difference]: Finished difference. Result has 343 places, 546 transitions, 10229 flow
[2024-06-20 20:00:04,999 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=9917, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=483, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10229, PETRI_PLACES=343, PETRI_TRANSITIONS=546}
[2024-06-20 20:00:04,999 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 301 predicate places.
[2024-06-20 20:00:04,999 INFO  L495      AbstractCegarLoop]: Abstraction has has 343 places, 546 transitions, 10229 flow
[2024-06-20 20:00:05,000 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 20:00:05,000 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:00:05,000 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 20:00:05,000 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-20 20:00:05,000 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 20:00:05,000 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:00:05,001 INFO  L85        PathProgramCache]: Analyzing trace with hash 816444828, now seen corresponding path program 7 times
[2024-06-20 20:00:05,001 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:00:05,001 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022101334]
[2024-06-20 20:00:05,001 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:00:05,001 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:00:05,071 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:00:13,216 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 20:00:13,217 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:00:13,217 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022101334]
[2024-06-20 20:00:13,217 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022101334] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:00:13,217 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:00:13,217 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:00:13,217 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418873511]
[2024-06-20 20:00:13,217 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:00:13,218 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:00:13,219 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:00:13,219 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:00:13,219 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:00:13,326 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41
[2024-06-20 20:00:13,327 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 546 transitions, 10229 flow. Second operand  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:00:13,327 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:00:13,327 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41
[2024-06-20 20:00:13,327 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:00:16,022 INFO  L124   PetriNetUnfolderBase]: 4766/7637 cut-off events.
[2024-06-20 20:00:16,022 INFO  L125   PetriNetUnfolderBase]: For 591911/591911 co-relation queries the response was YES.
[2024-06-20 20:00:16,087 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 78491 conditions, 7637 events. 4766/7637 cut-off events. For 591911/591911 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 48212 event pairs, 1278 based on Foata normal form. 4/7635 useless extension candidates. Maximal degree in co-relation 78329. Up to 7152 conditions per place. 
[2024-06-20 20:00:16,126 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 534 selfloop transitions, 46 changer transitions 0/585 dead transitions.
[2024-06-20 20:00:16,127 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 585 transitions, 11714 flow
[2024-06-20 20:00:16,129 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:00:16,129 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:00:16,129 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions.
[2024-06-20 20:00:16,129 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48509485094850946
[2024-06-20 20:00:16,129 INFO  L175             Difference]: Start difference. First operand has 343 places, 546 transitions, 10229 flow. Second operand 9 states and 179 transitions.
[2024-06-20 20:00:16,129 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 585 transitions, 11714 flow
[2024-06-20 20:00:17,929 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 585 transitions, 11471 flow, removed 76 selfloop flow, removed 7 redundant places.
[2024-06-20 20:00:17,937 INFO  L231             Difference]: Finished difference. Result has 346 places, 557 transitions, 10340 flow
[2024-06-20 20:00:17,938 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=9986, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=503, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10340, PETRI_PLACES=346, PETRI_TRANSITIONS=557}
[2024-06-20 20:00:17,938 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 304 predicate places.
[2024-06-20 20:00:17,938 INFO  L495      AbstractCegarLoop]: Abstraction has has 346 places, 557 transitions, 10340 flow
[2024-06-20 20:00:17,938 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:00:17,938 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:00:17,939 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 20:00:17,939 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-20 20:00:17,939 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 20:00:17,939 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:00:17,939 INFO  L85        PathProgramCache]: Analyzing trace with hash 616998888, now seen corresponding path program 8 times
[2024-06-20 20:00:17,939 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:00:17,940 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098599173]
[2024-06-20 20:00:17,940 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:00:17,940 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:00:18,094 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:00:27,398 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 20:00:27,398 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:00:27,398 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098599173]
[2024-06-20 20:00:27,398 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098599173] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:00:27,398 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:00:27,398 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:00:27,399 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539893895]
[2024-06-20 20:00:27,399 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:00:27,399 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:00:27,399 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:00:27,399 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:00:27,399 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:00:27,524 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 20:00:27,524 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 557 transitions, 10340 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 20:00:27,524 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:00:27,524 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 20:00:27,524 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:00:30,706 INFO  L124   PetriNetUnfolderBase]: 4874/7798 cut-off events.
[2024-06-20 20:00:30,706 INFO  L125   PetriNetUnfolderBase]: For 624969/624969 co-relation queries the response was YES.
[2024-06-20 20:00:30,766 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 79938 conditions, 7798 events. 4874/7798 cut-off events. For 624969/624969 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 49306 event pairs, 1297 based on Foata normal form. 16/7808 useless extension candidates. Maximal degree in co-relation 79774. Up to 6876 conditions per place. 
[2024-06-20 20:00:30,801 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 477 selfloop transitions, 127 changer transitions 0/609 dead transitions.
[2024-06-20 20:00:30,802 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 609 transitions, 12305 flow
[2024-06-20 20:00:30,802 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:00:30,802 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:00:30,803 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 189 transitions.
[2024-06-20 20:00:30,803 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5121951219512195
[2024-06-20 20:00:30,803 INFO  L175             Difference]: Start difference. First operand has 346 places, 557 transitions, 10340 flow. Second operand 9 states and 189 transitions.
[2024-06-20 20:00:30,803 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 609 transitions, 12305 flow
[2024-06-20 20:00:32,105 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 609 transitions, 12190 flow, removed 43 selfloop flow, removed 3 redundant places.
[2024-06-20 20:00:32,114 INFO  L231             Difference]: Finished difference. Result has 354 places, 569 transitions, 10951 flow
[2024-06-20 20:00:32,114 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=10225, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10951, PETRI_PLACES=354, PETRI_TRANSITIONS=569}
[2024-06-20 20:00:32,115 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 312 predicate places.
[2024-06-20 20:00:32,115 INFO  L495      AbstractCegarLoop]: Abstraction has has 354 places, 569 transitions, 10951 flow
[2024-06-20 20:00:32,115 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 20:00:32,115 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:00:32,115 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 20:00:32,115 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-20 20:00:32,115 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 20:00:32,116 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:00:32,116 INFO  L85        PathProgramCache]: Analyzing trace with hash 616995168, now seen corresponding path program 9 times
[2024-06-20 20:00:32,116 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:00:32,116 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554745174]
[2024-06-20 20:00:32,116 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:00:32,116 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:00:32,172 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:00:41,919 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 20:00:41,919 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:00:41,919 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554745174]
[2024-06-20 20:00:41,919 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554745174] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:00:41,919 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:00:41,920 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:00:41,920 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529082585]
[2024-06-20 20:00:41,920 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:00:41,920 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:00:41,920 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:00:41,920 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:00:41,921 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:00:42,107 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 20:00:42,107 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 569 transitions, 10951 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 20:00:42,107 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:00:42,107 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 20:00:42,108 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:00:45,141 INFO  L124   PetriNetUnfolderBase]: 5051/8069 cut-off events.
[2024-06-20 20:00:45,142 INFO  L125   PetriNetUnfolderBase]: For 691294/691294 co-relation queries the response was YES.
[2024-06-20 20:00:45,221 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 85229 conditions, 8069 events. 5051/8069 cut-off events. For 691294/691294 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 51225 event pairs, 1297 based on Foata normal form. 16/8079 useless extension candidates. Maximal degree in co-relation 85061. Up to 6867 conditions per place. 
[2024-06-20 20:00:45,263 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 483 selfloop transitions, 135 changer transitions 0/623 dead transitions.
[2024-06-20 20:00:45,263 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 623 transitions, 13300 flow
[2024-06-20 20:00:45,264 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:00:45,264 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:00:45,264 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 194 transitions.
[2024-06-20 20:00:45,264 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5257452574525745
[2024-06-20 20:00:45,264 INFO  L175             Difference]: Start difference. First operand has 354 places, 569 transitions, 10951 flow. Second operand 9 states and 194 transitions.
[2024-06-20 20:00:45,264 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 623 transitions, 13300 flow
[2024-06-20 20:00:46,809 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 623 transitions, 13124 flow, removed 77 selfloop flow, removed 2 redundant places.
[2024-06-20 20:00:46,819 INFO  L231             Difference]: Finished difference. Result has 362 places, 577 transitions, 11479 flow
[2024-06-20 20:00:46,819 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=10781, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=569, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11479, PETRI_PLACES=362, PETRI_TRANSITIONS=577}
[2024-06-20 20:00:46,819 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 320 predicate places.
[2024-06-20 20:00:46,820 INFO  L495      AbstractCegarLoop]: Abstraction has has 362 places, 577 transitions, 11479 flow
[2024-06-20 20:00:46,820 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 20:00:46,820 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:00:46,820 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 20:00:46,820 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2024-06-20 20:00:46,820 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 20:00:46,820 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:00:46,821 INFO  L85        PathProgramCache]: Analyzing trace with hash -1794668230, now seen corresponding path program 10 times
[2024-06-20 20:00:46,821 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:00:46,821 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751754465]
[2024-06-20 20:00:46,821 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:00:46,821 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:00:46,889 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:00:55,046 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 20:00:55,046 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:00:55,046 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751754465]
[2024-06-20 20:00:55,046 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751754465] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:00:55,046 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:00:55,046 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:00:55,047 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467605574]
[2024-06-20 20:00:55,047 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:00:55,047 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:00:55,047 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:00:55,047 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:00:55,047 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:00:55,159 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41
[2024-06-20 20:00:55,159 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 577 transitions, 11479 flow. Second operand  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:00:55,160 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:00:55,160 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41
[2024-06-20 20:00:55,160 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:00:58,101 INFO  L124   PetriNetUnfolderBase]: 5043/8058 cut-off events.
[2024-06-20 20:00:58,101 INFO  L125   PetriNetUnfolderBase]: For 669419/669419 co-relation queries the response was YES.
[2024-06-20 20:00:58,185 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 85249 conditions, 8058 events. 5043/8058 cut-off events. For 669419/669419 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 51193 event pairs, 1385 based on Foata normal form. 4/8056 useless extension candidates. Maximal degree in co-relation 85078. Up to 7571 conditions per place. 
[2024-06-20 20:00:58,227 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 554 selfloop transitions, 48 changer transitions 0/607 dead transitions.
[2024-06-20 20:00:58,228 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 607 transitions, 12881 flow
[2024-06-20 20:00:58,230 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:00:58,230 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:00:58,230 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions.
[2024-06-20 20:00:58,232 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4796747967479675
[2024-06-20 20:00:58,232 INFO  L175             Difference]: Start difference. First operand has 362 places, 577 transitions, 11479 flow. Second operand 9 states and 177 transitions.
[2024-06-20 20:00:58,232 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 607 transitions, 12881 flow
[2024-06-20 20:00:59,668 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 607 transitions, 12589 flow, removed 83 selfloop flow, removed 4 redundant places.
[2024-06-20 20:00:59,677 INFO  L231             Difference]: Finished difference. Result has 367 places, 579 transitions, 11394 flow
[2024-06-20 20:00:59,677 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=11203, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=529, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11394, PETRI_PLACES=367, PETRI_TRANSITIONS=579}
[2024-06-20 20:00:59,677 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 325 predicate places.
[2024-06-20 20:00:59,678 INFO  L495      AbstractCegarLoop]: Abstraction has has 367 places, 579 transitions, 11394 flow
[2024-06-20 20:00:59,678 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:00:59,678 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:00:59,678 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 20:00:59,678 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2024-06-20 20:00:59,678 INFO  L420      AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:00:59,678 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:00:59,678 INFO  L85        PathProgramCache]: Analyzing trace with hash 816450780, now seen corresponding path program 6 times
[2024-06-20 20:00:59,679 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:00:59,679 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140181851]
[2024-06-20 20:00:59,679 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:00:59,679 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:00:59,741 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:01:09,935 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 20:01:09,935 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:01:09,935 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140181851]
[2024-06-20 20:01:09,935 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140181851] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:01:09,935 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:01:09,935 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 20:01:09,936 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159428142]
[2024-06-20 20:01:09,936 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:01:09,936 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 20:01:09,936 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:01:09,936 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 20:01:09,936 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-20 20:01:10,236 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 20:01:10,236 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 579 transitions, 11394 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 20:01:10,236 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:01:10,236 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 20:01:10,236 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:01:13,638 INFO  L124   PetriNetUnfolderBase]: 5259/8419 cut-off events.
[2024-06-20 20:01:13,639 INFO  L125   PetriNetUnfolderBase]: For 798412/798412 co-relation queries the response was YES.
[2024-06-20 20:01:13,727 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 88398 conditions, 8419 events. 5259/8419 cut-off events. For 798412/798412 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 54043 event pairs, 1389 based on Foata normal form. 58/8475 useless extension candidates. Maximal degree in co-relation 88225. Up to 7333 conditions per place. 
[2024-06-20 20:01:13,770 INFO  L140   encePairwiseOnDemand]: 26/41 looper letters, 515 selfloop transitions, 112 changer transitions 5/637 dead transitions.
[2024-06-20 20:01:13,770 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 637 transitions, 13311 flow
[2024-06-20 20:01:13,771 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-20 20:01:13,771 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-20 20:01:13,771 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 232 transitions.
[2024-06-20 20:01:13,771 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5144124168514412
[2024-06-20 20:01:13,771 INFO  L175             Difference]: Start difference. First operand has 367 places, 579 transitions, 11394 flow. Second operand 11 states and 232 transitions.
[2024-06-20 20:01:13,771 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 637 transitions, 13311 flow
[2024-06-20 20:01:15,493 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 637 transitions, 13167 flow, removed 37 selfloop flow, removed 4 redundant places.
[2024-06-20 20:01:15,502 INFO  L231             Difference]: Finished difference. Result has 375 places, 585 transitions, 11689 flow
[2024-06-20 20:01:15,503 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=11250, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=467, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11689, PETRI_PLACES=375, PETRI_TRANSITIONS=585}
[2024-06-20 20:01:15,503 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 333 predicate places.
[2024-06-20 20:01:15,503 INFO  L495      AbstractCegarLoop]: Abstraction has has 375 places, 585 transitions, 11689 flow
[2024-06-20 20:01:15,507 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 20:01:15,507 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:01:15,507 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 20:01:15,507 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2024-06-20 20:01:15,507 INFO  L420      AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:01:15,508 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:01:15,508 INFO  L85        PathProgramCache]: Analyzing trace with hash -1538882340, now seen corresponding path program 7 times
[2024-06-20 20:01:15,508 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:01:15,508 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110145176]
[2024-06-20 20:01:15,508 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:01:15,508 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:01:15,584 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:01:26,273 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:01:26,273 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:01:26,273 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110145176]
[2024-06-20 20:01:26,273 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110145176] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:01:26,273 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:01:26,273 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 20:01:26,273 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36697321]
[2024-06-20 20:01:26,273 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:01:26,273 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 20:01:26,273 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:01:26,274 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 20:01:26,274 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-20 20:01:26,563 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 20:01:26,563 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 585 transitions, 11689 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 20:01:26,563 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:01:26,563 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 20:01:26,564 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:01:30,309 INFO  L124   PetriNetUnfolderBase]: 5835/9408 cut-off events.
[2024-06-20 20:01:30,309 INFO  L125   PetriNetUnfolderBase]: For 1001290/1001290 co-relation queries the response was YES.
[2024-06-20 20:01:30,404 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 103123 conditions, 9408 events. 5835/9408 cut-off events. For 1001290/1001290 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 61949 event pairs, 1428 based on Foata normal form. 48/9454 useless extension candidates. Maximal degree in co-relation 102948. Up to 6972 conditions per place. 
[2024-06-20 20:01:30,452 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 370 selfloop transitions, 282 changer transitions 0/657 dead transitions.
[2024-06-20 20:01:30,452 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 657 transitions, 14711 flow
[2024-06-20 20:01:30,453 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-20 20:01:30,453 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-20 20:01:30,453 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 244 transitions.
[2024-06-20 20:01:30,453 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.541019955654102
[2024-06-20 20:01:30,453 INFO  L175             Difference]: Start difference. First operand has 375 places, 585 transitions, 11689 flow. Second operand 11 states and 244 transitions.
[2024-06-20 20:01:30,453 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 657 transitions, 14711 flow
[2024-06-20 20:01:32,784 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 657 transitions, 14397 flow, removed 52 selfloop flow, removed 7 redundant places.
[2024-06-20 20:01:32,794 INFO  L231             Difference]: Finished difference. Result has 382 places, 596 transitions, 12659 flow
[2024-06-20 20:01:32,794 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=11375, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=273, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=12659, PETRI_PLACES=382, PETRI_TRANSITIONS=596}
[2024-06-20 20:01:32,795 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 340 predicate places.
[2024-06-20 20:01:32,795 INFO  L495      AbstractCegarLoop]: Abstraction has has 382 places, 596 transitions, 12659 flow
[2024-06-20 20:01:32,795 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 20:01:32,795 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:01:32,795 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 20:01:32,795 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62
[2024-06-20 20:01:32,795 INFO  L420      AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:01:32,796 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:01:32,796 INFO  L85        PathProgramCache]: Analyzing trace with hash -1539149250, now seen corresponding path program 8 times
[2024-06-20 20:01:32,796 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:01:32,796 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375333183]
[2024-06-20 20:01:32,796 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:01:32,796 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:01:32,859 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:01:43,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 20:01:43,024 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:01:43,024 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375333183]
[2024-06-20 20:01:43,024 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375333183] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:01:43,024 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:01:43,024 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 20:01:43,024 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126229052]
[2024-06-20 20:01:43,024 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:01:43,025 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 20:01:43,025 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:01:43,028 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 20:01:43,028 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-20 20:01:43,344 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 20:01:43,344 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 596 transitions, 12659 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 20:01:43,344 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:01:43,344 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 20:01:43,344 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:01:47,078 INFO  L124   PetriNetUnfolderBase]: 5882/9495 cut-off events.
[2024-06-20 20:01:47,079 INFO  L125   PetriNetUnfolderBase]: For 1015905/1015905 co-relation queries the response was YES.
[2024-06-20 20:01:47,183 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 105633 conditions, 9495 events. 5882/9495 cut-off events. For 1015905/1015905 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 62851 event pairs, 1653 based on Foata normal form. 58/9551 useless extension candidates. Maximal degree in co-relation 105454. Up to 7957 conditions per place. 
[2024-06-20 20:01:47,235 INFO  L140   encePairwiseOnDemand]: 26/41 looper letters, 482 selfloop transitions, 165 changer transitions 0/652 dead transitions.
[2024-06-20 20:01:47,235 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 652 transitions, 14795 flow
[2024-06-20 20:01:47,236 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-20 20:01:47,236 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-20 20:01:47,236 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 234 transitions.
[2024-06-20 20:01:47,237 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5188470066518847
[2024-06-20 20:01:47,237 INFO  L175             Difference]: Start difference. First operand has 382 places, 596 transitions, 12659 flow. Second operand 11 states and 234 transitions.
[2024-06-20 20:01:47,237 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 652 transitions, 14795 flow
[2024-06-20 20:01:49,568 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 652 transitions, 14374 flow, removed 103 selfloop flow, removed 5 redundant places.
[2024-06-20 20:01:49,578 INFO  L231             Difference]: Finished difference. Result has 388 places, 597 transitions, 12666 flow
[2024-06-20 20:01:49,578 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=12248, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=596, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=12666, PETRI_PLACES=388, PETRI_TRANSITIONS=597}
[2024-06-20 20:01:49,579 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 346 predicate places.
[2024-06-20 20:01:49,579 INFO  L495      AbstractCegarLoop]: Abstraction has has 388 places, 597 transitions, 12666 flow
[2024-06-20 20:01:49,579 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 20:01:49,579 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:01:49,579 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 20:01:49,579 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63
[2024-06-20 20:01:49,580 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 20:01:49,580 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:01:49,580 INFO  L85        PathProgramCache]: Analyzing trace with hash -1787310628, now seen corresponding path program 9 times
[2024-06-20 20:01:49,580 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:01:49,580 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695552929]
[2024-06-20 20:01:49,581 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:01:49,581 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:01:49,646 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:01:59,184 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 20:01:59,184 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:01:59,184 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695552929]
[2024-06-20 20:01:59,184 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695552929] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:01:59,184 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:01:59,184 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 20:01:59,184 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550751430]
[2024-06-20 20:01:59,184 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:01:59,185 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 20:01:59,185 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:01:59,185 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 20:01:59,185 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-20 20:01:59,436 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 20:01:59,436 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 597 transitions, 12666 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 20:01:59,437 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:01:59,437 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 20:01:59,437 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:02:03,683 INFO  L124   PetriNetUnfolderBase]: 6107/9888 cut-off events.
[2024-06-20 20:02:03,683 INFO  L125   PetriNetUnfolderBase]: For 1052554/1052554 co-relation queries the response was YES.
[2024-06-20 20:02:03,775 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 109640 conditions, 9888 events. 6107/9888 cut-off events. For 1052554/1052554 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 66422 event pairs, 1741 based on Foata normal form. 58/9944 useless extension candidates. Maximal degree in co-relation 109459. Up to 8368 conditions per place. 
[2024-06-20 20:02:03,822 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 443 selfloop transitions, 204 changer transitions 0/652 dead transitions.
[2024-06-20 20:02:03,823 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 652 transitions, 14970 flow
[2024-06-20 20:02:03,823 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-20 20:02:03,824 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-20 20:02:03,824 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 237 transitions.
[2024-06-20 20:02:03,824 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5254988913525499
[2024-06-20 20:02:03,824 INFO  L175             Difference]: Start difference. First operand has 388 places, 597 transitions, 12666 flow. Second operand 11 states and 237 transitions.
[2024-06-20 20:02:03,824 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 652 transitions, 14970 flow
[2024-06-20 20:02:06,171 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 652 transitions, 14590 flow, removed 47 selfloop flow, removed 8 redundant places.
[2024-06-20 20:02:06,182 INFO  L231             Difference]: Finished difference. Result has 391 places, 599 transitions, 12870 flow
[2024-06-20 20:02:06,182 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=12292, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=597, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=202, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=12870, PETRI_PLACES=391, PETRI_TRANSITIONS=599}
[2024-06-20 20:02:06,183 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 349 predicate places.
[2024-06-20 20:02:06,183 INFO  L495      AbstractCegarLoop]: Abstraction has has 391 places, 599 transitions, 12870 flow
[2024-06-20 20:02:06,183 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 20:02:06,183 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:02:06,183 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 20:02:06,183 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64
[2024-06-20 20:02:06,183 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 20:02:06,184 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:02:06,184 INFO  L85        PathProgramCache]: Analyzing trace with hash -1794453028, now seen corresponding path program 10 times
[2024-06-20 20:02:06,184 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:02:06,184 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056951319]
[2024-06-20 20:02:06,184 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:02:06,184 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:02:06,267 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:02:18,819 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 20:02:18,820 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:02:18,820 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056951319]
[2024-06-20 20:02:18,820 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056951319] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:02:18,820 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:02:18,820 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 20:02:18,820 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649557414]
[2024-06-20 20:02:18,820 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:02:18,820 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 20:02:18,821 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:02:18,821 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 20:02:18,821 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-20 20:02:19,120 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 20:02:19,120 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 599 transitions, 12870 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 20:02:19,120 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:02:19,120 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 20:02:19,120 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:02:23,692 INFO  L124   PetriNetUnfolderBase]: 6882/11206 cut-off events.
[2024-06-20 20:02:23,693 INFO  L125   PetriNetUnfolderBase]: For 1299880/1299880 co-relation queries the response was YES.
[2024-06-20 20:02:23,827 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 126914 conditions, 11206 events. 6882/11206 cut-off events. For 1299880/1299880 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 77541 event pairs, 1961 based on Foata normal form. 54/11258 useless extension candidates. Maximal degree in co-relation 126732. Up to 8790 conditions per place. 
[2024-06-20 20:02:23,891 INFO  L140   encePairwiseOnDemand]: 26/41 looper letters, 532 selfloop transitions, 132 changer transitions 0/669 dead transitions.
[2024-06-20 20:02:23,891 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 669 transitions, 15696 flow
[2024-06-20 20:02:23,892 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-20 20:02:23,892 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-20 20:02:23,892 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 241 transitions.
[2024-06-20 20:02:23,892 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5343680709534369
[2024-06-20 20:02:23,893 INFO  L175             Difference]: Start difference. First operand has 391 places, 599 transitions, 12870 flow. Second operand 11 states and 241 transitions.
[2024-06-20 20:02:23,893 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 669 transitions, 15696 flow
[2024-06-20 20:02:27,347 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 669 transitions, 15300 flow, removed 54 selfloop flow, removed 7 redundant places.
[2024-06-20 20:02:27,358 INFO  L231             Difference]: Finished difference. Result has 396 places, 606 transitions, 13228 flow
[2024-06-20 20:02:27,358 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=12475, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=469, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=13228, PETRI_PLACES=396, PETRI_TRANSITIONS=606}
[2024-06-20 20:02:27,359 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 354 predicate places.
[2024-06-20 20:02:27,359 INFO  L495      AbstractCegarLoop]: Abstraction has has 396 places, 606 transitions, 13228 flow
[2024-06-20 20:02:27,359 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 20:02:27,359 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:02:27,359 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 20:02:27,359 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65
[2024-06-20 20:02:27,360 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 20:02:27,360 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:02:27,360 INFO  L85        PathProgramCache]: Analyzing trace with hash 1510898738, now seen corresponding path program 11 times
[2024-06-20 20:02:27,360 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:02:27,360 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499419323]
[2024-06-20 20:02:27,360 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:02:27,360 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:02:27,425 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:02:36,928 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:02:36,928 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:02:36,928 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499419323]
[2024-06-20 20:02:36,928 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499419323] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:02:36,929 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:02:36,933 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 20:02:36,933 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946439960]
[2024-06-20 20:02:36,933 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:02:36,933 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 20:02:36,933 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:02:36,934 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 20:02:36,934 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-20 20:02:37,254 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 20:02:37,254 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 606 transitions, 13228 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 20:02:37,254 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:02:37,254 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 20:02:37,254 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:02:42,749 INFO  L124   PetriNetUnfolderBase]: 7097/11580 cut-off events.
[2024-06-20 20:02:42,750 INFO  L125   PetriNetUnfolderBase]: For 1360637/1360637 co-relation queries the response was YES.
[2024-06-20 20:02:42,855 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 130954 conditions, 11580 events. 7097/11580 cut-off events. For 1360637/1360637 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 80941 event pairs, 2245 based on Foata normal form. 58/11636 useless extension candidates. Maximal degree in co-relation 130770. Up to 10013 conditions per place. 
[2024-06-20 20:02:42,910 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 455 selfloop transitions, 200 changer transitions 3/663 dead transitions.
[2024-06-20 20:02:42,910 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 663 transitions, 15595 flow
[2024-06-20 20:02:42,911 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-20 20:02:42,911 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-20 20:02:42,911 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 238 transitions.
[2024-06-20 20:02:42,912 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5277161862527716
[2024-06-20 20:02:42,912 INFO  L175             Difference]: Start difference. First operand has 396 places, 606 transitions, 13228 flow. Second operand 11 states and 238 transitions.
[2024-06-20 20:02:42,912 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 663 transitions, 15595 flow
[2024-06-20 20:02:45,688 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 663 transitions, 15252 flow, removed 77 selfloop flow, removed 7 redundant places.
[2024-06-20 20:02:45,698 INFO  L231             Difference]: Finished difference. Result has 400 places, 607 transitions, 13451 flow
[2024-06-20 20:02:45,699 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=12885, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=198, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=13451, PETRI_PLACES=400, PETRI_TRANSITIONS=607}
[2024-06-20 20:02:45,699 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 358 predicate places.
[2024-06-20 20:02:45,699 INFO  L495      AbstractCegarLoop]: Abstraction has has 400 places, 607 transitions, 13451 flow
[2024-06-20 20:02:45,700 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 20:02:45,700 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:02:45,700 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 20:02:45,700 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66
[2024-06-20 20:02:45,700 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 20:02:45,700 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:02:45,700 INFO  L85        PathProgramCache]: Analyzing trace with hash 1503756338, now seen corresponding path program 12 times
[2024-06-20 20:02:45,701 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:02:45,701 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961575767]
[2024-06-20 20:02:45,701 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:02:45,701 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:02:45,778 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:02:58,434 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 20:02:58,434 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:02:58,435 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961575767]
[2024-06-20 20:02:58,435 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961575767] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:02:58,435 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:02:58,435 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 20:02:58,435 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968082422]
[2024-06-20 20:02:58,435 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:02:58,435 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 20:02:58,436 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:02:58,436 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 20:02:58,436 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-20 20:02:58,647 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 20:02:58,647 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 607 transitions, 13451 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 20:02:58,647 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:02:58,648 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 20:02:58,648 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:03:05,047 INFO  L124   PetriNetUnfolderBase]: 7765/12726 cut-off events.
[2024-06-20 20:03:05,047 INFO  L125   PetriNetUnfolderBase]: For 1598119/1598119 co-relation queries the response was YES.
[2024-06-20 20:03:05,173 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 147145 conditions, 12726 events. 7765/12726 cut-off events. For 1598119/1598119 co-relation queries the response was YES. Maximal size of possible extension queue 613. Compared 91040 event pairs, 2443 based on Foata normal form. 54/12778 useless extension candidates. Maximal degree in co-relation 146959. Up to 9948 conditions per place. 
[2024-06-20 20:03:05,236 INFO  L140   encePairwiseOnDemand]: 26/41 looper letters, 532 selfloop transitions, 137 changer transitions 0/674 dead transitions.
[2024-06-20 20:03:05,237 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 674 transitions, 16098 flow
[2024-06-20 20:03:05,237 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-20 20:03:05,237 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-20 20:03:05,238 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 241 transitions.
[2024-06-20 20:03:05,238 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5343680709534369
[2024-06-20 20:03:05,238 INFO  L175             Difference]: Start difference. First operand has 400 places, 607 transitions, 13451 flow. Second operand 11 states and 241 transitions.
[2024-06-20 20:03:05,238 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 674 transitions, 16098 flow
[2024-06-20 20:03:08,552 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 674 transitions, 15589 flow, removed 58 selfloop flow, removed 9 redundant places.
[2024-06-20 20:03:08,585 INFO  L231             Difference]: Finished difference. Result has 403 places, 613 transitions, 13656 flow
[2024-06-20 20:03:08,585 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=12942, PETRI_DIFFERENCE_MINUEND_PLACES=391, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=472, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=13656, PETRI_PLACES=403, PETRI_TRANSITIONS=613}
[2024-06-20 20:03:08,586 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 361 predicate places.
[2024-06-20 20:03:08,586 INFO  L495      AbstractCegarLoop]: Abstraction has has 403 places, 613 transitions, 13656 flow
[2024-06-20 20:03:08,586 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 20:03:08,586 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:03:08,586 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 20:03:08,586 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67
[2024-06-20 20:03:08,586 INFO  L420      AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:03:08,587 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:03:08,587 INFO  L85        PathProgramCache]: Analyzing trace with hash -1794662278, now seen corresponding path program 13 times
[2024-06-20 20:03:08,587 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:03:08,587 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813680009]
[2024-06-20 20:03:08,587 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:03:08,587 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:03:08,683 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:03:19,203 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:03:19,204 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:03:19,204 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813680009]
[2024-06-20 20:03:19,204 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813680009] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:03:19,204 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:03:19,204 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 20:03:19,204 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198929618]
[2024-06-20 20:03:19,205 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:03:19,205 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 20:03:19,205 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:03:19,205 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 20:03:19,205 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-20 20:03:19,458 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 20:03:19,458 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 613 transitions, 13656 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 20:03:19,458 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:03:19,458 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 20:03:19,459 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:03:25,372 INFO  L124   PetriNetUnfolderBase]: 7926/13013 cut-off events.
[2024-06-20 20:03:25,372 INFO  L125   PetriNetUnfolderBase]: For 1623278/1623278 co-relation queries the response was YES.
[2024-06-20 20:03:25,628 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 149085 conditions, 13013 events. 7926/13013 cut-off events. For 1623278/1623278 co-relation queries the response was YES. Maximal size of possible extension queue 633. Compared 93951 event pairs, 2704 based on Foata normal form. 58/13069 useless extension candidates. Maximal degree in co-relation 148897. Up to 11694 conditions per place. 
[2024-06-20 20:03:25,703 INFO  L140   encePairwiseOnDemand]: 26/41 looper letters, 548 selfloop transitions, 114 changer transitions 0/667 dead transitions.
[2024-06-20 20:03:25,703 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 667 transitions, 15742 flow
[2024-06-20 20:03:25,704 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-20 20:03:25,704 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-20 20:03:25,705 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 231 transitions.
[2024-06-20 20:03:25,705 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5121951219512195
[2024-06-20 20:03:25,705 INFO  L175             Difference]: Start difference. First operand has 403 places, 613 transitions, 13656 flow. Second operand 11 states and 231 transitions.
[2024-06-20 20:03:25,705 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 667 transitions, 15742 flow
[2024-06-20 20:03:29,437 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 667 transitions, 15438 flow, removed 86 selfloop flow, removed 6 redundant places.
[2024-06-20 20:03:29,449 INFO  L231             Difference]: Finished difference. Result has 408 places, 615 transitions, 13741 flow
[2024-06-20 20:03:29,450 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=13352, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=613, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=499, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=13741, PETRI_PLACES=408, PETRI_TRANSITIONS=615}
[2024-06-20 20:03:29,450 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 366 predicate places.
[2024-06-20 20:03:29,450 INFO  L495      AbstractCegarLoop]: Abstraction has has 408 places, 615 transitions, 13741 flow
[2024-06-20 20:03:29,450 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 20:03:29,451 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:03:29,451 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 20:03:29,451 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68
[2024-06-20 20:03:29,451 INFO  L420      AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:03:29,451 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:03:29,451 INFO  L85        PathProgramCache]: Analyzing trace with hash -538086802, now seen corresponding path program 14 times
[2024-06-20 20:03:29,451 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:03:29,452 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309074132]
[2024-06-20 20:03:29,452 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:03:29,452 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:03:29,530 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
Killed by 15