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


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


Checking for ERROR reachability
Using default analysis
Version 76401ed0
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false
--- Real Ultimate output ---
This is Ultimate 0.2.4-tmp.fs.goblint-validation-76401ed-m
[2024-06-20 19:39:47,885 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-20 19:39:47,949 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-20 19:39:47,953 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-20 19:39:47,954 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-20 19:39:47,975 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-20 19:39:47,976 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-20 19:39:47,976 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-20 19:39:47,977 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-20 19:39:47,980 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-20 19:39:47,980 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-20 19:39:47,980 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-20 19:39:47,981 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-20 19:39:47,982 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-20 19:39:47,982 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-20 19:39:47,982 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-20 19:39:47,982 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-20 19:39:47,983 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-20 19:39:47,983 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-20 19:39:47,983 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-20 19:39:47,983 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-20 19:39:47,984 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-20 19:39:47,984 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-20 19:39:47,984 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-20 19:39:47,984 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-20 19:39:47,984 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-20 19:39:47,984 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-20 19:39:47,985 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-20 19:39:47,985 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-20 19:39:47,985 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-20 19:39:47,986 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-20 19:39:47,986 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-20 19:39:47,986 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-20 19:39:47,987 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-20 19:39:47,987 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-20 19:39:47,987 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-20 19:39:47,987 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-20 19:39:47,987 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-20 19:39:47,987 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-20 19:39:47,988 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-20 19:39:47,988 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-20 19:39:47,988 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-20 19:39:47,988 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-20 19:39:47,988 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:39:48,185 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-20 19:39:48,205 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-20 19:39:48,207 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-20 19:39:48,208 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-20 19:39:48,208 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-20 19:39:48,209 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i
[2024-06-20 19:39:49,257 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-20 19:39:49,448 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-20 19:39:49,448 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i
[2024-06-20 19:39:49,463 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1018d11fb/5a3664981af54fae9434bd41548858e8/FLAG1c59b9ea6
[2024-06-20 19:39:49,475 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1018d11fb/5a3664981af54fae9434bd41548858e8
[2024-06-20 19:39:49,477 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-20 19:39:49,478 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-20 19:39:49,480 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/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.yml/witness.yml
[2024-06-20 19:39:49,644 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-20 19:39:49,645 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-20 19:39:49,646 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-20 19:39:49,646 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-20 19:39:49,650 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-20 19:39:49,650 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:39:49" (1/2) ...
[2024-06-20 19:39:49,651 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ed41597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:39:49, skipping insertion in model container
[2024-06-20 19:39:49,651 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:39:49" (1/2) ...
[2024-06-20 19:39:49,653 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@77f99236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:39:49, skipping insertion in model container
[2024-06-20 19:39:49,653 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:39:49" (2/2) ...
[2024-06-20 19:39:49,653 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ed41597 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:39:49, skipping insertion in model container
[2024-06-20 19:39:49,653 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:39:49" (2/2) ...
[2024-06-20 19:39:49,653 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-20 19:39:49,725 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-20 19:39:49,726 INFO  L97    edCorrectnessWitness]: Location invariant before [L824-L824] (((((((((((((((((! multithreaded || x$r_buff1_thd3 == (_Bool)0) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || (0 <= __unbuffered_p0_EAX && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_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_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (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 )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 )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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (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) && (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_buff1_thd0 == (_Bool)0)) && (! 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) && x$w_buff0 <= 127) && x$w_buff1 <= 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) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))
[2024-06-20 19:39:49,727 INFO  L97    edCorrectnessWitness]: Location invariant before [L823-L823] (((((((((((((((((! multithreaded || x$r_buff1_thd3 == (_Bool)0) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || (0 <= __unbuffered_p0_EAX && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_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_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (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 )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 )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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (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) && (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_buff1_thd0 == (_Bool)0)) && (! 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) && x$w_buff0 <= 127) && x$w_buff1 <= 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) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))
[2024-06-20 19:39:49,728 INFO  L97    edCorrectnessWitness]: Location invariant before [L821-L821] (((((((((((((((((! multithreaded || x$r_buff1_thd3 == (_Bool)0) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || (0 <= __unbuffered_p0_EAX && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_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_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (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 )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 )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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (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) && (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_buff1_thd0 == (_Bool)0)) && (! 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) && x$w_buff0 <= 127) && x$w_buff1 <= 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) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))
[2024-06-20 19:39:49,728 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-20 19:39:49,728 INFO  L106   edCorrectnessWitness]: ghost_update [L819-L819] multithreaded = 1;
[2024-06-20 19:39:49,757 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-20 19:39:50,049 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-20 19:39:50,058 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:39:50,337 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-20 19:39:50,397 INFO  L206         MainTranslator]: Completed translation
[2024-06-20 19:39:50,398 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:39:50 WrapperNode
[2024-06-20 19:39:50,398 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-20 19:39:50,399 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-20 19:39:50,399 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-20 19:39:50,399 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-20 19:39:50,404 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:39:50" (1/1) ...
[2024-06-20 19:39:50,435 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:39:50" (1/1) ...
[2024-06-20 19:39:50,521 INFO  L138                Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 143
[2024-06-20 19:39:50,521 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-20 19:39:50,523 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-20 19:39:50,523 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-20 19:39:50,523 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-20 19:39:50,532 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:39:50" (1/1) ...
[2024-06-20 19:39:50,532 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:39:50" (1/1) ...
[2024-06-20 19:39:50,558 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:39:50" (1/1) ...
[2024-06-20 19:39:50,595 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:39:50,595 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:39:50" (1/1) ...
[2024-06-20 19:39:50,595 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:39:50" (1/1) ...
[2024-06-20 19:39:50,622 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:39:50" (1/1) ...
[2024-06-20 19:39:50,626 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:39:50" (1/1) ...
[2024-06-20 19:39:50,637 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:39:50" (1/1) ...
[2024-06-20 19:39:50,642 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:39:50" (1/1) ...
[2024-06-20 19:39:50,657 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-20 19:39:50,658 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-20 19:39:50,658 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-20 19:39:50,658 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-20 19:39:50,659 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:39:50" (1/1) ...
[2024-06-20 19:39:50,664 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-20 19:39:50,671 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-20 19:39:50,685 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:39:50,703 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:39:50,724 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-20 19:39:50,724 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-20 19:39:50,724 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-20 19:39:50,724 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-20 19:39:50,724 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-20 19:39:50,725 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-20 19:39:50,725 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-20 19:39:50,725 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-20 19:39:50,725 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-20 19:39:50,725 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-20 19:39:50,726 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-20 19:39:50,726 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-20 19:39:50,727 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:39:50,820 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-20 19:39:50,822 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-20 19:39:51,898 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-20 19:39:51,899 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-20 19:39:52,137 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-20 19:39:52,137 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-20 19:39:52,138 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:39:52 BoogieIcfgContainer
[2024-06-20 19:39:52,138 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-20 19:39:52,140 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-20 19:39:52,140 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-20 19:39:52,142 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-20 19:39:52,143 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.06 07:39:49" (1/4) ...
[2024-06-20 19:39:52,143 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ddab383 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 07:39:52, skipping insertion in model container
[2024-06-20 19:39:52,144 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:39:49" (2/4) ...
[2024-06-20 19:39:52,144 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ddab383 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 07:39:52, skipping insertion in model container
[2024-06-20 19:39:52,144 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:39:50" (3/4) ...
[2024-06-20 19:39:52,145 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ddab383 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 07:39:52, skipping insertion in model container
[2024-06-20 19:39:52,145 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:39:52" (4/4) ...
[2024-06-20 19:39:52,146 INFO  L112   eAbstractionObserver]: Analyzing ICFG safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i
[2024-06-20 19:39:52,159 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-20 19:39:52,159 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-20 19:39:52,159 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-20 19:39:52,240 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-20 19:39:52,277 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 50 places, 40 transitions, 92 flow
[2024-06-20 19:39:52,321 INFO  L124   PetriNetUnfolderBase]: 0/37 cut-off events.
[2024-06-20 19:39:52,322 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-20 19:39:52,323 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 0/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-20 19:39:52,323 INFO  L82        GeneralOperation]: Start removeDead. Operand has 50 places, 40 transitions, 92 flow
[2024-06-20 19:39:52,351 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 41 places, 31 transitions, 71 flow
[2024-06-20 19:39:52,362 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-20 19:39:52,368 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;@2eaa6eb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-20 19:39:52,369 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-20 19:39:52,392 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-20 19:39:52,392 INFO  L124   PetriNetUnfolderBase]: 0/5 cut-off events.
[2024-06-20 19:39:52,392 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-20 19:39:52,393 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:39:52,393 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1]
[2024-06-20 19:39:52,394 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:39:52,399 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:39:52,400 INFO  L85        PathProgramCache]: Analyzing trace with hash 368623954, now seen corresponding path program 1 times
[2024-06-20 19:39:52,406 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:39:52,407 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652379078]
[2024-06-20 19:39:52,407 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:39:52,407 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:39:52,811 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:39:56,954 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:39:56,955 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:39:56,955 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652379078]
[2024-06-20 19:39:56,956 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652379078] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:39:56,956 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:39:56,956 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-20 19:39:56,958 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392444719]
[2024-06-20 19:39:56,958 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:39:56,964 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-20 19:39:56,968 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:39:56,992 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-20 19:39:56,993 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-20 19:39:57,073 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40
[2024-06-20 19:39:57,075 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 71 flow. Second operand  has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:39:57,075 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:39:57,075 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40
[2024-06-20 19:39:57,076 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:39:57,715 INFO  L124   PetriNetUnfolderBase]: 1152/1746 cut-off events.
[2024-06-20 19:39:57,716 INFO  L125   PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES.
[2024-06-20 19:39:57,720 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3563 conditions, 1746 events. 1152/1746 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8021 event pairs, 785 based on Foata normal form. 1/1711 useless extension candidates. Maximal degree in co-relation 3551. Up to 1732 conditions per place. 
[2024-06-20 19:39:57,728 INFO  L140   encePairwiseOnDemand]: 33/40 looper letters, 31 selfloop transitions, 4 changer transitions 0/41 dead transitions.
[2024-06-20 19:39:57,728 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 167 flow
[2024-06-20 19:39:57,729 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-20 19:39:57,731 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-20 19:39:57,736 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions.
[2024-06-20 19:39:57,737 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5916666666666667
[2024-06-20 19:39:57,738 INFO  L175             Difference]: Start difference. First operand has 41 places, 31 transitions, 71 flow. Second operand 3 states and 71 transitions.
[2024-06-20 19:39:57,739 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 167 flow
[2024-06-20 19:39:57,741 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 41 transitions, 162 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-20 19:39:57,742 INFO  L231             Difference]: Finished difference. Result has 41 places, 34 transitions, 98 flow
[2024-06-20 19:39:57,744 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=41, PETRI_TRANSITIONS=34}
[2024-06-20 19:39:57,746 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places.
[2024-06-20 19:39:57,746 INFO  L495      AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 98 flow
[2024-06-20 19:39:57,746 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:39:57,747 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:39:57,747 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:39:57,747 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-20 19:39:57,747 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:39:57,748 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:39:57,748 INFO  L85        PathProgramCache]: Analyzing trace with hash -554505855, now seen corresponding path program 1 times
[2024-06-20 19:39:57,748 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:39:57,748 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479289720]
[2024-06-20 19:39:57,748 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:39:57,748 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:39:57,792 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:40:00,718 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:40:00,719 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:40:00,720 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479289720]
[2024-06-20 19:40:00,720 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479289720] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:40:00,720 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:40:00,720 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-20 19:40:00,720 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640710070]
[2024-06-20 19:40:00,721 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:40:00,722 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-20 19:40:00,722 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:40:00,723 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-20 19:40:00,723 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2024-06-20 19:40:00,826 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40
[2024-06-20 19:40:00,826 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 98 flow. Second operand  has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:40:00,826 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:40:00,826 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40
[2024-06-20 19:40:00,827 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:40:01,564 INFO  L124   PetriNetUnfolderBase]: 1389/2094 cut-off events.
[2024-06-20 19:40:01,565 INFO  L125   PetriNetUnfolderBase]: For 402/426 co-relation queries the response was YES.
[2024-06-20 19:40:01,567 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4828 conditions, 2094 events. 1389/2094 cut-off events. For 402/426 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9522 event pairs, 621 based on Foata normal form. 13/2101 useless extension candidates. Maximal degree in co-relation 4816. Up to 2033 conditions per place. 
[2024-06-20 19:40:01,574 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 41 selfloop transitions, 7 changer transitions 0/53 dead transitions.
[2024-06-20 19:40:01,574 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 53 transitions, 244 flow
[2024-06-20 19:40:01,575 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-20 19:40:01,575 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-20 19:40:01,576 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions.
[2024-06-20 19:40:01,576 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.56875
[2024-06-20 19:40:01,576 INFO  L175             Difference]: Start difference. First operand has 41 places, 34 transitions, 98 flow. Second operand 4 states and 91 transitions.
[2024-06-20 19:40:01,576 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 53 transitions, 244 flow
[2024-06-20 19:40:01,577 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 53 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-20 19:40:01,578 INFO  L231             Difference]: Finished difference. Result has 44 places, 37 transitions, 134 flow
[2024-06-20 19:40:01,578 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=44, PETRI_TRANSITIONS=37}
[2024-06-20 19:40:01,579 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places.
[2024-06-20 19:40:01,579 INFO  L495      AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 134 flow
[2024-06-20 19:40:01,579 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:40:01,579 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:40:01,579 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:40:01,580 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-20 19:40:01,580 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:40:01,580 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:40:01,580 INFO  L85        PathProgramCache]: Analyzing trace with hash -1773745506, now seen corresponding path program 1 times
[2024-06-20 19:40:01,581 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:40:01,581 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104546769]
[2024-06-20 19:40:01,581 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:40:01,581 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:40:01,664 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:40:05,181 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:40:05,181 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:40:05,181 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104546769]
[2024-06-20 19:40:05,181 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104546769] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:40:05,182 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:40:05,182 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:40:05,182 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314404309]
[2024-06-20 19:40:05,182 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:40:05,183 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:40:05,183 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:40:05,183 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:40:05,184 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:40:05,289 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40
[2024-06-20 19:40:05,290 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 134 flow. Second operand  has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:40:05,290 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:40:05,290 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40
[2024-06-20 19:40:05,290 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:40:06,022 INFO  L124   PetriNetUnfolderBase]: 1380/2079 cut-off events.
[2024-06-20 19:40:06,023 INFO  L125   PetriNetUnfolderBase]: For 1135/1178 co-relation queries the response was YES.
[2024-06-20 19:40:06,026 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5319 conditions, 2079 events. 1380/2079 cut-off events. For 1135/1178 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9386 event pairs, 481 based on Foata normal form. 18/2091 useless extension candidates. Maximal degree in co-relation 5305. Up to 1988 conditions per place. 
[2024-06-20 19:40:06,034 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 45 selfloop transitions, 9 changer transitions 0/59 dead transitions.
[2024-06-20 19:40:06,034 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 59 transitions, 300 flow
[2024-06-20 19:40:06,037 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 19:40:06,037 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 19:40:06,038 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions.
[2024-06-20 19:40:06,038 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.535
[2024-06-20 19:40:06,038 INFO  L175             Difference]: Start difference. First operand has 44 places, 37 transitions, 134 flow. Second operand 5 states and 107 transitions.
[2024-06-20 19:40:06,038 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 59 transitions, 300 flow
[2024-06-20 19:40:06,040 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 59 transitions, 286 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-06-20 19:40:06,041 INFO  L231             Difference]: Finished difference. Result has 46 places, 38 transitions, 155 flow
[2024-06-20 19:40:06,041 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=46, PETRI_TRANSITIONS=38}
[2024-06-20 19:40:06,042 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 5 predicate places.
[2024-06-20 19:40:06,042 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 155 flow
[2024-06-20 19:40:06,042 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:40:06,042 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:40:06,042 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:40:06,043 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-20 19:40:06,043 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:40:06,043 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:40:06,043 INFO  L85        PathProgramCache]: Analyzing trace with hash -546325912, now seen corresponding path program 1 times
[2024-06-20 19:40:06,043 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:40:06,044 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874528717]
[2024-06-20 19:40:06,044 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:40:06,044 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:40:06,081 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:40:11,359 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:40:11,360 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:40:11,363 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874528717]
[2024-06-20 19:40:11,363 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874528717] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:40:11,363 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:40:11,363 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-20 19:40:11,364 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453041270]
[2024-06-20 19:40:11,364 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:40:11,364 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-20 19:40:11,365 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:40:11,366 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-20 19:40:11,366 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-06-20 19:40:11,486 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40
[2024-06-20 19:40:11,486 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 155 flow. Second operand  has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:40:11,486 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:40:11,486 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40
[2024-06-20 19:40:11,486 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:40:12,075 INFO  L124   PetriNetUnfolderBase]: 1126/1706 cut-off events.
[2024-06-20 19:40:12,076 INFO  L125   PetriNetUnfolderBase]: For 1636/1639 co-relation queries the response was YES.
[2024-06-20 19:40:12,078 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4743 conditions, 1706 events. 1126/1706 cut-off events. For 1636/1639 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7635 event pairs, 594 based on Foata normal form. 4/1707 useless extension candidates. Maximal degree in co-relation 4727. Up to 1683 conditions per place. 
[2024-06-20 19:40:12,085 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 39 selfloop transitions, 8 changer transitions 0/52 dead transitions.
[2024-06-20 19:40:12,085 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 52 transitions, 291 flow
[2024-06-20 19:40:12,086 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 19:40:12,086 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 19:40:12,086 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions.
[2024-06-20 19:40:12,087 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.445
[2024-06-20 19:40:12,087 INFO  L175             Difference]: Start difference. First operand has 46 places, 38 transitions, 155 flow. Second operand 5 states and 89 transitions.
[2024-06-20 19:40:12,087 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 52 transitions, 291 flow
[2024-06-20 19:40:12,088 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 52 transitions, 268 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-06-20 19:40:12,089 INFO  L231             Difference]: Finished difference. Result has 48 places, 41 transitions, 176 flow
[2024-06-20 19:40:12,089 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=176, PETRI_PLACES=48, PETRI_TRANSITIONS=41}
[2024-06-20 19:40:12,090 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places.
[2024-06-20 19:40:12,090 INFO  L495      AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 176 flow
[2024-06-20 19:40:12,090 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:40:12,090 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:40:12,091 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:40:12,091 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-20 19:40:12,091 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:40:12,091 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:40:12,091 INFO  L85        PathProgramCache]: Analyzing trace with hash 243767570, now seen corresponding path program 1 times
[2024-06-20 19:40:12,092 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:40:12,092 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233513609]
[2024-06-20 19:40:12,092 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:40:12,092 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:40:12,126 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:40:17,509 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:40:17,510 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:40:17,510 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233513609]
[2024-06-20 19:40:17,510 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233513609] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:40:17,511 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:40:17,511 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:40:17,511 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865630101]
[2024-06-20 19:40:17,511 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:40:17,512 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:40:17,512 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:40:17,513 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:40:17,513 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:40:17,593 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:40:17,593 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 176 flow. Second operand  has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:40:17,593 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:40:17,593 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:40:17,593 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:40:18,404 INFO  L124   PetriNetUnfolderBase]: 1594/2383 cut-off events.
[2024-06-20 19:40:18,405 INFO  L125   PetriNetUnfolderBase]: For 3233/3233 co-relation queries the response was YES.
[2024-06-20 19:40:18,409 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6964 conditions, 2383 events. 1594/2383 cut-off events. For 3233/3233 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10768 event pairs, 784 based on Foata normal form. 2/2383 useless extension candidates. Maximal degree in co-relation 6946. Up to 2353 conditions per place. 
[2024-06-20 19:40:18,418 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 51 selfloop transitions, 11 changer transitions 0/65 dead transitions.
[2024-06-20 19:40:18,418 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 65 transitions, 364 flow
[2024-06-20 19:40:18,419 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:40:18,419 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:40:18,421 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions.
[2024-06-20 19:40:18,421 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3958333333333333
[2024-06-20 19:40:18,422 INFO  L175             Difference]: Start difference. First operand has 48 places, 41 transitions, 176 flow. Second operand 6 states and 95 transitions.
[2024-06-20 19:40:18,422 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 65 transitions, 364 flow
[2024-06-20 19:40:18,426 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 65 transitions, 342 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-06-20 19:40:18,428 INFO  L231             Difference]: Finished difference. Result has 53 places, 50 transitions, 228 flow
[2024-06-20 19:40:18,429 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=228, PETRI_PLACES=53, PETRI_TRANSITIONS=50}
[2024-06-20 19:40:18,431 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places.
[2024-06-20 19:40:18,431 INFO  L495      AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 228 flow
[2024-06-20 19:40:18,431 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:40:18,435 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:40:18,436 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:40:18,436 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-20 19:40:18,436 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:40:18,436 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:40:18,436 INFO  L85        PathProgramCache]: Analyzing trace with hash -1033138233, now seen corresponding path program 1 times
[2024-06-20 19:40:18,437 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:40:18,437 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367742058]
[2024-06-20 19:40:18,437 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:40:18,437 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:40:18,476 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:40:24,583 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:40:24,584 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:40:24,584 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367742058]
[2024-06-20 19:40:24,584 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367742058] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:40:24,584 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:40:24,584 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:40:24,584 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574565592]
[2024-06-20 19:40:24,584 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:40:24,585 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:40:24,585 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:40:24,585 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:40:24,585 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:40:24,714 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:40:24,714 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 228 flow. Second operand  has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:40:24,714 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:40:24,714 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:40:24,714 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:40:25,558 INFO  L124   PetriNetUnfolderBase]: 1589/2376 cut-off events.
[2024-06-20 19:40:25,559 INFO  L125   PetriNetUnfolderBase]: For 4362/4362 co-relation queries the response was YES.
[2024-06-20 19:40:25,562 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7531 conditions, 2376 events. 1589/2376 cut-off events. For 4362/4362 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10768 event pairs, 766 based on Foata normal form. 2/2376 useless extension candidates. Maximal degree in co-relation 7510. Up to 2337 conditions per place. 
[2024-06-20 19:40:25,570 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 55 selfloop transitions, 14 changer transitions 0/72 dead transitions.
[2024-06-20 19:40:25,570 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 72 transitions, 424 flow
[2024-06-20 19:40:25,571 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:40:25,571 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:40:25,571 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions.
[2024-06-20 19:40:25,572 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3892857142857143
[2024-06-20 19:40:25,572 INFO  L175             Difference]: Start difference. First operand has 53 places, 50 transitions, 228 flow. Second operand 7 states and 109 transitions.
[2024-06-20 19:40:25,572 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 72 transitions, 424 flow
[2024-06-20 19:40:25,574 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 72 transitions, 422 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-20 19:40:25,575 INFO  L231             Difference]: Finished difference. Result has 59 places, 53 transitions, 278 flow
[2024-06-20 19:40:25,575 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=278, PETRI_PLACES=59, PETRI_TRANSITIONS=53}
[2024-06-20 19:40:25,575 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places.
[2024-06-20 19:40:25,575 INFO  L495      AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 278 flow
[2024-06-20 19:40:25,576 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:40:25,576 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:40:25,576 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:40:25,576 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-20 19:40:25,576 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:40:25,576 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:40:25,576 INFO  L85        PathProgramCache]: Analyzing trace with hash 741202137, now seen corresponding path program 1 times
[2024-06-20 19:40:25,577 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:40:25,577 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214208031]
[2024-06-20 19:40:25,577 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:40:25,577 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:40:25,619 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:40:30,966 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:40:30,967 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:40:30,967 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214208031]
[2024-06-20 19:40:30,967 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214208031] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:40:30,967 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:40:30,967 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:40:30,967 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473004321]
[2024-06-20 19:40:30,967 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:40:30,967 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:40:30,967 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:40:30,968 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:40:30,968 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:40:31,085 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:40:31,085 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 278 flow. Second operand  has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 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:40:31,085 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:40:31,085 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:40:31,085 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:40:31,953 INFO  L124   PetriNetUnfolderBase]: 1575/2372 cut-off events.
[2024-06-20 19:40:31,953 INFO  L125   PetriNetUnfolderBase]: For 6855/6946 co-relation queries the response was YES.
[2024-06-20 19:40:31,958 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8269 conditions, 2372 events. 1575/2372 cut-off events. For 6855/6946 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 10947 event pairs, 573 based on Foata normal form. 27/2344 useless extension candidates. Maximal degree in co-relation 8245. Up to 2240 conditions per place. 
[2024-06-20 19:40:31,974 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 56 selfloop transitions, 15 changer transitions 0/79 dead transitions.
[2024-06-20 19:40:31,975 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 79 transitions, 502 flow
[2024-06-20 19:40:31,977 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:40:31,977 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:40:31,978 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions.
[2024-06-20 19:40:31,978 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44166666666666665
[2024-06-20 19:40:31,978 INFO  L175             Difference]: Start difference. First operand has 59 places, 53 transitions, 278 flow. Second operand 6 states and 106 transitions.
[2024-06-20 19:40:31,978 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 79 transitions, 502 flow
[2024-06-20 19:40:31,981 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 79 transitions, 474 flow, removed 2 selfloop flow, removed 5 redundant places.
[2024-06-20 19:40:31,982 INFO  L231             Difference]: Finished difference. Result has 61 places, 59 transitions, 328 flow
[2024-06-20 19:40:31,982 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=328, PETRI_PLACES=61, PETRI_TRANSITIONS=59}
[2024-06-20 19:40:31,983 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 20 predicate places.
[2024-06-20 19:40:31,983 INFO  L495      AbstractCegarLoop]: Abstraction has has 61 places, 59 transitions, 328 flow
[2024-06-20 19:40:31,984 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 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:40:31,984 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:40:31,984 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:40:31,984 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-20 19:40:31,984 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:40:31,984 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:40:31,985 INFO  L85        PathProgramCache]: Analyzing trace with hash -1420365805, now seen corresponding path program 1 times
[2024-06-20 19:40:31,985 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:40:31,985 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887921978]
[2024-06-20 19:40:31,985 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:40:31,985 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:40:32,023 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:40:37,159 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:40:37,159 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:40:37,159 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887921978]
[2024-06-20 19:40:37,160 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887921978] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:40:37,160 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:40:37,160 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:40:37,160 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552246090]
[2024-06-20 19:40:37,160 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:40:37,160 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:40:37,161 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:40:37,161 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:40:37,161 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:40:37,272 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:40:37,273 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 59 transitions, 328 flow. Second operand  has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:40:37,273 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:40:37,273 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:40:37,273 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:40:38,197 INFO  L124   PetriNetUnfolderBase]: 1771/2634 cut-off events.
[2024-06-20 19:40:38,198 INFO  L125   PetriNetUnfolderBase]: For 8236/8245 co-relation queries the response was YES.
[2024-06-20 19:40:38,203 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9768 conditions, 2634 events. 1771/2634 cut-off events. For 8236/8245 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 12098 event pairs, 538 based on Foata normal form. 14/2644 useless extension candidates. Maximal degree in co-relation 9742. Up to 2461 conditions per place. 
[2024-06-20 19:40:38,211 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 68 selfloop transitions, 30 changer transitions 0/101 dead transitions.
[2024-06-20 19:40:38,212 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 101 transitions, 716 flow
[2024-06-20 19:40:38,212 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:40:38,212 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:40:38,213 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions.
[2024-06-20 19:40:38,213 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43214285714285716
[2024-06-20 19:40:38,213 INFO  L175             Difference]: Start difference. First operand has 61 places, 59 transitions, 328 flow. Second operand 7 states and 121 transitions.
[2024-06-20 19:40:38,213 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 101 transitions, 716 flow
[2024-06-20 19:40:38,217 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 101 transitions, 691 flow, removed 6 selfloop flow, removed 2 redundant places.
[2024-06-20 19:40:38,218 INFO  L231             Difference]: Finished difference. Result has 68 places, 78 transitions, 527 flow
[2024-06-20 19:40:38,219 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=527, PETRI_PLACES=68, PETRI_TRANSITIONS=78}
[2024-06-20 19:40:38,219 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 27 predicate places.
[2024-06-20 19:40:38,219 INFO  L495      AbstractCegarLoop]: Abstraction has has 68 places, 78 transitions, 527 flow
[2024-06-20 19:40:38,219 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:40:38,220 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:40:38,220 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:40:38,220 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-20 19:40:38,220 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:40:38,220 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:40:38,220 INFO  L85        PathProgramCache]: Analyzing trace with hash -1420365991, now seen corresponding path program 2 times
[2024-06-20 19:40:38,220 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:40:38,221 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518659543]
[2024-06-20 19:40:38,221 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:40:38,221 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:40:38,265 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:40:42,616 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:40:42,616 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:40:42,616 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518659543]
[2024-06-20 19:40:42,616 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518659543] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:40:42,616 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:40:42,616 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:40:42,616 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380118916]
[2024-06-20 19:40:42,617 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:40:42,617 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:40:42,618 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:40:42,618 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:40:42,618 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:40:42,748 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:40:42,748 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 78 transitions, 527 flow. Second operand  has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 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:40:42,748 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:40:42,749 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:40:42,749 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:40:43,626 INFO  L124   PetriNetUnfolderBase]: 1729/2591 cut-off events.
[2024-06-20 19:40:43,626 INFO  L125   PetriNetUnfolderBase]: For 13050/13149 co-relation queries the response was YES.
[2024-06-20 19:40:43,631 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11126 conditions, 2591 events. 1729/2591 cut-off events. For 13050/13149 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 11992 event pairs, 578 based on Foata normal form. 25/2564 useless extension candidates. Maximal degree in co-relation 11096. Up to 2358 conditions per place. 
[2024-06-20 19:40:43,638 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 70 selfloop transitions, 25 changer transitions 0/105 dead transitions.
[2024-06-20 19:40:43,638 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 105 transitions, 872 flow
[2024-06-20 19:40:43,652 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:40:43,652 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:40:43,653 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions.
[2024-06-20 19:40:43,653 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45416666666666666
[2024-06-20 19:40:43,653 INFO  L175             Difference]: Start difference. First operand has 68 places, 78 transitions, 527 flow. Second operand 6 states and 109 transitions.
[2024-06-20 19:40:43,653 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 105 transitions, 872 flow
[2024-06-20 19:40:43,664 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 105 transitions, 843 flow, removed 11 selfloop flow, removed 2 redundant places.
[2024-06-20 19:40:43,665 INFO  L231             Difference]: Finished difference. Result has 72 places, 84 transitions, 619 flow
[2024-06-20 19:40:43,665 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=619, PETRI_PLACES=72, PETRI_TRANSITIONS=84}
[2024-06-20 19:40:43,666 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 31 predicate places.
[2024-06-20 19:40:43,666 INFO  L495      AbstractCegarLoop]: Abstraction has has 72 places, 84 transitions, 619 flow
[2024-06-20 19:40:43,666 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 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:40:43,666 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:40:43,667 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:40:43,667 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-20 19:40:43,667 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:40:43,667 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:40:43,667 INFO  L85        PathProgramCache]: Analyzing trace with hash -1962521359, now seen corresponding path program 2 times
[2024-06-20 19:40:43,670 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:40:43,673 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432330985]
[2024-06-20 19:40:43,673 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:40:43,673 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:40:43,702 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:40:48,969 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:40:48,969 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:40:48,969 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432330985]
[2024-06-20 19:40:48,970 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432330985] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:40:48,970 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:40:48,970 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:40:48,970 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106886006]
[2024-06-20 19:40:48,970 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:40:48,970 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:40:48,970 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:40:48,971 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:40:48,971 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:40:49,091 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:40:49,091 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 84 transitions, 619 flow. Second operand  has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:40:49,091 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:40:49,091 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:40:49,091 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:40:49,922 INFO  L124   PetriNetUnfolderBase]: 1790/2662 cut-off events.
[2024-06-20 19:40:49,922 INFO  L125   PetriNetUnfolderBase]: For 14407/14416 co-relation queries the response was YES.
[2024-06-20 19:40:49,929 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11948 conditions, 2662 events. 1790/2662 cut-off events. For 14407/14416 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 12119 event pairs, 625 based on Foata normal form. 8/2666 useless extension candidates. Maximal degree in co-relation 11916. Up to 2568 conditions per place. 
[2024-06-20 19:40:49,939 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 91 selfloop transitions, 27 changer transitions 0/121 dead transitions.
[2024-06-20 19:40:49,940 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 121 transitions, 1085 flow
[2024-06-20 19:40:49,940 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:40:49,940 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:40:49,942 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions.
[2024-06-20 19:40:49,942 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40714285714285714
[2024-06-20 19:40:49,942 INFO  L175             Difference]: Start difference. First operand has 72 places, 84 transitions, 619 flow. Second operand 7 states and 114 transitions.
[2024-06-20 19:40:49,942 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 121 transitions, 1085 flow
[2024-06-20 19:40:49,953 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 121 transitions, 1055 flow, removed 9 selfloop flow, removed 2 redundant places.
[2024-06-20 19:40:49,957 INFO  L231             Difference]: Finished difference. Result has 80 places, 100 transitions, 843 flow
[2024-06-20 19:40:49,958 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=843, PETRI_PLACES=80, PETRI_TRANSITIONS=100}
[2024-06-20 19:40:49,959 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 39 predicate places.
[2024-06-20 19:40:49,961 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 100 transitions, 843 flow
[2024-06-20 19:40:49,961 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:40:49,961 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:40:49,961 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:40:49,961 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-20 19:40:49,961 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:40:49,962 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:40:49,962 INFO  L85        PathProgramCache]: Analyzing trace with hash -1962758509, now seen corresponding path program 3 times
[2024-06-20 19:40:49,962 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:40:49,962 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495689524]
[2024-06-20 19:40:49,962 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:40:49,963 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:40:49,992 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:40:55,667 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:40:55,667 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:40:55,667 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495689524]
[2024-06-20 19:40:55,667 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495689524] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:40:55,667 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:40:55,668 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:40:55,668 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479038943]
[2024-06-20 19:40:55,668 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:40:55,668 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:40:55,668 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:40:55,669 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:40:55,669 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:40:55,883 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:40:55,883 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 100 transitions, 843 flow. Second operand  has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:40:55,883 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:40:55,883 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:40:55,883 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:40:56,831 INFO  L124   PetriNetUnfolderBase]: 1841/2733 cut-off events.
[2024-06-20 19:40:56,831 INFO  L125   PetriNetUnfolderBase]: For 18018/18033 co-relation queries the response was YES.
[2024-06-20 19:40:56,837 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13014 conditions, 2733 events. 1841/2733 cut-off events. For 18018/18033 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 12469 event pairs, 621 based on Foata normal form. 15/2744 useless extension candidates. Maximal degree in co-relation 12977. Up to 2609 conditions per place. 
[2024-06-20 19:40:56,845 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 98 selfloop transitions, 35 changer transitions 0/136 dead transitions.
[2024-06-20 19:40:56,845 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 136 transitions, 1299 flow
[2024-06-20 19:40:56,846 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:40:56,846 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:40:56,846 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions.
[2024-06-20 19:40:56,846 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.409375
[2024-06-20 19:40:56,846 INFO  L175             Difference]: Start difference. First operand has 80 places, 100 transitions, 843 flow. Second operand 8 states and 131 transitions.
[2024-06-20 19:40:56,847 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 136 transitions, 1299 flow
[2024-06-20 19:40:56,861 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 136 transitions, 1255 flow, removed 21 selfloop flow, removed 1 redundant places.
[2024-06-20 19:40:56,863 INFO  L231             Difference]: Finished difference. Result has 89 places, 113 transitions, 1031 flow
[2024-06-20 19:40:56,863 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=799, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1031, PETRI_PLACES=89, PETRI_TRANSITIONS=113}
[2024-06-20 19:40:56,864 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 48 predicate places.
[2024-06-20 19:40:56,864 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 113 transitions, 1031 flow
[2024-06-20 19:40:56,864 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:40:56,864 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:40:56,864 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:40:56,865 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-20 19:40:56,865 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:40:56,865 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:40:56,865 INFO  L85        PathProgramCache]: Analyzing trace with hash -1962512431, now seen corresponding path program 1 times
[2024-06-20 19:40:56,865 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:40:56,865 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554939274]
[2024-06-20 19:40:56,865 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:40:56,865 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:40:56,897 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:41:02,955 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:41:02,956 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:41:02,956 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554939274]
[2024-06-20 19:41:02,956 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554939274] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:41:02,956 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:41:02,956 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:41:02,956 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556352917]
[2024-06-20 19:41:02,956 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:41:02,956 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:41:02,957 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:41:02,957 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:41:02,957 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:41:03,121 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:41:03,122 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 113 transitions, 1031 flow. Second operand  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:41:03,122 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:41:03,122 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:41:03,122 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:41:04,090 INFO  L124   PetriNetUnfolderBase]: 1833/2719 cut-off events.
[2024-06-20 19:41:04,090 INFO  L125   PetriNetUnfolderBase]: For 22176/22176 co-relation queries the response was YES.
[2024-06-20 19:41:04,097 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13949 conditions, 2719 events. 1833/2719 cut-off events. For 22176/22176 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 12346 event pairs, 596 based on Foata normal form. 4/2721 useless extension candidates. Maximal degree in co-relation 13907. Up to 2662 conditions per place. 
[2024-06-20 19:41:04,106 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 120 selfloop transitions, 16 changer transitions 0/139 dead transitions.
[2024-06-20 19:41:04,106 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 139 transitions, 1385 flow
[2024-06-20 19:41:04,108 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:41:04,108 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:41:04,109 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions.
[2024-06-20 19:41:04,109 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.384375
[2024-06-20 19:41:04,109 INFO  L175             Difference]: Start difference. First operand has 89 places, 113 transitions, 1031 flow. Second operand 8 states and 123 transitions.
[2024-06-20 19:41:04,109 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 139 transitions, 1385 flow
[2024-06-20 19:41:04,132 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 139 transitions, 1304 flow, removed 28 selfloop flow, removed 3 redundant places.
[2024-06-20 19:41:04,134 INFO  L231             Difference]: Finished difference. Result has 94 places, 115 transitions, 1015 flow
[2024-06-20 19:41:04,134 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=950, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1015, PETRI_PLACES=94, PETRI_TRANSITIONS=115}
[2024-06-20 19:41:04,135 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 53 predicate places.
[2024-06-20 19:41:04,135 INFO  L495      AbstractCegarLoop]: Abstraction has has 94 places, 115 transitions, 1015 flow
[2024-06-20 19:41:04,135 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:41:04,135 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:41:04,135 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:41:04,135 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-20 19:41:04,135 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:41:04,136 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:41:04,136 INFO  L85        PathProgramCache]: Analyzing trace with hash 647715542, now seen corresponding path program 1 times
[2024-06-20 19:41:04,136 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:41:04,136 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295559804]
[2024-06-20 19:41:04,136 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:41:04,136 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:41:04,180 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:41:09,496 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:41:09,497 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:41:09,497 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295559804]
[2024-06-20 19:41:09,497 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295559804] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:41:09,497 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:41:09,497 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:41:09,504 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017338654]
[2024-06-20 19:41:09,504 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:41:09,504 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:41:09,505 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:41:09,505 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:41:09,505 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:41:09,639 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:41:09,640 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 115 transitions, 1015 flow. Second operand  has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:41:09,640 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:41:09,640 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:41:09,640 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:41:10,597 INFO  L124   PetriNetUnfolderBase]: 1747/2611 cut-off events.
[2024-06-20 19:41:10,598 INFO  L125   PetriNetUnfolderBase]: For 24907/25023 co-relation queries the response was YES.
[2024-06-20 19:41:10,605 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13692 conditions, 2611 events. 1747/2611 cut-off events. For 24907/25023 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 11945 event pairs, 574 based on Foata normal form. 53/2636 useless extension candidates. Maximal degree in co-relation 13648. Up to 2449 conditions per place. 
[2024-06-20 19:41:10,613 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 100 selfloop transitions, 19 changer transitions 0/134 dead transitions.
[2024-06-20 19:41:10,613 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 134 transitions, 1303 flow
[2024-06-20 19:41:10,615 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:41:10,615 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:41:10,615 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions.
[2024-06-20 19:41:10,615 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44166666666666665
[2024-06-20 19:41:10,615 INFO  L175             Difference]: Start difference. First operand has 94 places, 115 transitions, 1015 flow. Second operand 6 states and 106 transitions.
[2024-06-20 19:41:10,615 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 134 transitions, 1303 flow
[2024-06-20 19:41:10,634 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 134 transitions, 1248 flow, removed 13 selfloop flow, removed 6 redundant places.
[2024-06-20 19:41:10,636 INFO  L231             Difference]: Finished difference. Result has 94 places, 115 transitions, 1010 flow
[2024-06-20 19:41:10,636 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=960, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1010, PETRI_PLACES=94, PETRI_TRANSITIONS=115}
[2024-06-20 19:41:10,637 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 53 predicate places.
[2024-06-20 19:41:10,637 INFO  L495      AbstractCegarLoop]: Abstraction has has 94 places, 115 transitions, 1010 flow
[2024-06-20 19:41:10,637 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:41:10,637 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:41:10,637 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:41:10,637 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-20 19:41:10,638 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:41:10,638 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:41:10,638 INFO  L85        PathProgramCache]: Analyzing trace with hash 81821207, now seen corresponding path program 1 times
[2024-06-20 19:41:10,638 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:41:10,638 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888186897]
[2024-06-20 19:41:10,638 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:41:10,638 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:41:10,667 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:41:16,292 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:41:16,292 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:41:16,292 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888186897]
[2024-06-20 19:41:16,292 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888186897] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:41:16,292 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:41:16,292 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:41:16,293 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541205924]
[2024-06-20 19:41:16,293 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:41:16,293 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:41:16,293 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:41:16,293 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:41:16,293 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:41:16,391 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:41:16,392 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 115 transitions, 1010 flow. Second operand  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:41:16,392 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:41:16,392 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:41:16,392 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:41:17,590 INFO  L124   PetriNetUnfolderBase]: 1999/2955 cut-off events.
[2024-06-20 19:41:17,590 INFO  L125   PetriNetUnfolderBase]: For 29537/29552 co-relation queries the response was YES.
[2024-06-20 19:41:17,599 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15623 conditions, 2955 events. 1999/2955 cut-off events. For 29537/29552 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 13569 event pairs, 542 based on Foata normal form. 20/2969 useless extension candidates. Maximal degree in co-relation 15578. Up to 2686 conditions per place. 
[2024-06-20 19:41:17,609 INFO  L140   encePairwiseOnDemand]: 25/40 looper letters, 130 selfloop transitions, 37 changer transitions 0/170 dead transitions.
[2024-06-20 19:41:17,609 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 170 transitions, 1713 flow
[2024-06-20 19:41:17,609 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:41:17,609 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:41:17,610 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions.
[2024-06-20 19:41:17,610 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4305555555555556
[2024-06-20 19:41:17,610 INFO  L175             Difference]: Start difference. First operand has 94 places, 115 transitions, 1010 flow. Second operand 9 states and 155 transitions.
[2024-06-20 19:41:17,610 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 170 transitions, 1713 flow
[2024-06-20 19:41:17,636 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 170 transitions, 1649 flow, removed 2 selfloop flow, removed 5 redundant places.
[2024-06-20 19:41:17,638 INFO  L231             Difference]: Finished difference. Result has 100 places, 134 transitions, 1243 flow
[2024-06-20 19:41:17,638 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=952, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1243, PETRI_PLACES=100, PETRI_TRANSITIONS=134}
[2024-06-20 19:41:17,639 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 59 predicate places.
[2024-06-20 19:41:17,639 INFO  L495      AbstractCegarLoop]: Abstraction has has 100 places, 134 transitions, 1243 flow
[2024-06-20 19:41:17,639 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:41:17,639 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:41:17,639 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:41:17,639 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-20 19:41:17,640 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:41:17,640 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:41:17,644 INFO  L85        PathProgramCache]: Analyzing trace with hash -1081665306, now seen corresponding path program 1 times
[2024-06-20 19:41:17,644 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:41:17,644 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70361321]
[2024-06-20 19:41:17,644 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:41:17,644 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:41:17,684 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:41:23,451 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:41:23,452 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:41:23,452 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70361321]
[2024-06-20 19:41:23,452 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70361321] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:41:23,452 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:41:23,452 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:41:23,452 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099734989]
[2024-06-20 19:41:23,452 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:41:23,452 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:41:23,452 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:41:23,453 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:41:23,453 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:41:23,623 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:41:23,623 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 134 transitions, 1243 flow. Second operand  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:41:23,623 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:41:23,623 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:41:23,623 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:41:24,748 INFO  L124   PetriNetUnfolderBase]: 2048/3023 cut-off events.
[2024-06-20 19:41:24,749 INFO  L125   PetriNetUnfolderBase]: For 35752/35764 co-relation queries the response was YES.
[2024-06-20 19:41:24,757 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17528 conditions, 3023 events. 2048/3023 cut-off events. For 35752/35764 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 13889 event pairs, 597 based on Foata normal form. 16/3035 useless extension candidates. Maximal degree in co-relation 17480. Up to 2804 conditions per place. 
[2024-06-20 19:41:24,766 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 118 selfloop transitions, 46 changer transitions 0/167 dead transitions.
[2024-06-20 19:41:24,766 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 167 transitions, 1778 flow
[2024-06-20 19:41:24,766 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:41:24,767 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:41:24,767 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions.
[2024-06-20 19:41:24,767 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.434375
[2024-06-20 19:41:24,767 INFO  L175             Difference]: Start difference. First operand has 100 places, 134 transitions, 1243 flow. Second operand 8 states and 139 transitions.
[2024-06-20 19:41:24,767 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 167 transitions, 1778 flow
[2024-06-20 19:41:24,800 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 167 transitions, 1680 flow, removed 40 selfloop flow, removed 3 redundant places.
[2024-06-20 19:41:24,802 INFO  L231             Difference]: Finished difference. Result has 105 places, 140 transitions, 1339 flow
[2024-06-20 19:41:24,803 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1145, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1339, PETRI_PLACES=105, PETRI_TRANSITIONS=140}
[2024-06-20 19:41:24,803 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 64 predicate places.
[2024-06-20 19:41:24,803 INFO  L495      AbstractCegarLoop]: Abstraction has has 105 places, 140 transitions, 1339 flow
[2024-06-20 19:41:24,803 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:41:24,804 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:41:24,804 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:41:24,804 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-20 19:41:24,805 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:41:24,805 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:41:24,805 INFO  L85        PathProgramCache]: Analyzing trace with hash 81970937, now seen corresponding path program 2 times
[2024-06-20 19:41:24,805 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:41:24,805 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040905102]
[2024-06-20 19:41:24,805 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:41:24,805 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:41:24,837 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:41:30,215 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:41:30,215 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:41:30,215 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040905102]
[2024-06-20 19:41:30,215 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040905102] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:41:30,215 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:41:30,215 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:41:30,215 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537025282]
[2024-06-20 19:41:30,215 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:41:30,215 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:41:30,216 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:41:30,216 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:41:30,216 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:41:30,360 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:41:30,360 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 140 transitions, 1339 flow. Second operand  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:41:30,360 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:41:30,360 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:41:30,360 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:41:31,615 INFO  L124   PetriNetUnfolderBase]: 2493/3651 cut-off events.
[2024-06-20 19:41:31,616 INFO  L125   PetriNetUnfolderBase]: For 47703/47706 co-relation queries the response was YES.
[2024-06-20 19:41:31,626 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21949 conditions, 3651 events. 2493/3651 cut-off events. For 47703/47706 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 17092 event pairs, 516 based on Foata normal form. 20/3664 useless extension candidates. Maximal degree in co-relation 21899. Up to 2713 conditions per place. 
[2024-06-20 19:41:31,637 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 121 selfloop transitions, 77 changer transitions 0/201 dead transitions.
[2024-06-20 19:41:31,637 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 201 transitions, 2291 flow
[2024-06-20 19:41:31,638 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:41:31,638 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:41:31,639 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions.
[2024-06-20 19:41:31,640 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.475
[2024-06-20 19:41:31,640 INFO  L175             Difference]: Start difference. First operand has 105 places, 140 transitions, 1339 flow. Second operand 8 states and 152 transitions.
[2024-06-20 19:41:31,640 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 201 transitions, 2291 flow
[2024-06-20 19:41:31,681 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 201 transitions, 2155 flow, removed 28 selfloop flow, removed 6 redundant places.
[2024-06-20 19:41:31,684 INFO  L231             Difference]: Finished difference. Result has 108 places, 162 transitions, 1705 flow
[2024-06-20 19:41:31,684 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1203, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1705, PETRI_PLACES=108, PETRI_TRANSITIONS=162}
[2024-06-20 19:41:31,684 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 67 predicate places.
[2024-06-20 19:41:31,684 INFO  L495      AbstractCegarLoop]: Abstraction has has 108 places, 162 transitions, 1705 flow
[2024-06-20 19:41:31,685 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:41:31,685 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:41:31,685 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:41:31,685 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-20 19:41:31,685 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:41:31,685 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:41:31,686 INFO  L85        PathProgramCache]: Analyzing trace with hash -1081671103, now seen corresponding path program 3 times
[2024-06-20 19:41:31,686 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:41:31,686 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968430757]
[2024-06-20 19:41:31,686 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:41:31,686 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:41:31,715 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:41:37,055 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:41:37,056 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:41:37,056 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968430757]
[2024-06-20 19:41:37,056 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968430757] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:41:37,056 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:41:37,056 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:41:37,056 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786478258]
[2024-06-20 19:41:37,056 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:41:37,057 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:41:37,057 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:41:37,057 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:41:37,057 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:41:37,251 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:41:37,252 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 162 transitions, 1705 flow. Second operand  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:41:37,252 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:41:37,252 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:41:37,252 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:41:38,521 INFO  L124   PetriNetUnfolderBase]: 2593/3791 cut-off events.
[2024-06-20 19:41:38,521 INFO  L125   PetriNetUnfolderBase]: For 57147/57153 co-relation queries the response was YES.
[2024-06-20 19:41:38,533 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24639 conditions, 3791 events. 2593/3791 cut-off events. For 57147/57153 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 17840 event pairs, 590 based on Foata normal form. 12/3796 useless extension candidates. Maximal degree in co-relation 24587. Up to 2778 conditions per place. 
[2024-06-20 19:41:38,547 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 129 selfloop transitions, 79 changer transitions 0/211 dead transitions.
[2024-06-20 19:41:38,547 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 211 transitions, 2579 flow
[2024-06-20 19:41:38,549 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:41:38,549 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:41:38,550 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions.
[2024-06-20 19:41:38,550 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46875
[2024-06-20 19:41:38,550 INFO  L175             Difference]: Start difference. First operand has 108 places, 162 transitions, 1705 flow. Second operand 8 states and 150 transitions.
[2024-06-20 19:41:38,550 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 211 transitions, 2579 flow
[2024-06-20 19:41:38,609 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 211 transitions, 2464 flow, removed 51 selfloop flow, removed 2 redundant places.
[2024-06-20 19:41:38,612 INFO  L231             Difference]: Finished difference. Result has 116 places, 174 transitions, 2031 flow
[2024-06-20 19:41:38,612 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1600, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2031, PETRI_PLACES=116, PETRI_TRANSITIONS=174}
[2024-06-20 19:41:38,612 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 75 predicate places.
[2024-06-20 19:41:38,612 INFO  L495      AbstractCegarLoop]: Abstraction has has 116 places, 174 transitions, 2031 flow
[2024-06-20 19:41:38,613 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:41:38,613 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:41:38,614 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:41:38,614 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-20 19:41:38,614 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:41:38,615 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:41:38,615 INFO  L85        PathProgramCache]: Analyzing trace with hash -708351386, now seen corresponding path program 2 times
[2024-06-20 19:41:38,615 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:41:38,615 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658170264]
[2024-06-20 19:41:38,615 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:41:38,615 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:41:38,652 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:41:44,556 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:41:44,557 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:41:44,557 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658170264]
[2024-06-20 19:41:44,557 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658170264] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:41:44,557 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:41:44,557 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:41:44,557 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541287539]
[2024-06-20 19:41:44,558 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:41:44,558 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:41:44,558 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:41:44,558 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:41:44,558 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:41:44,679 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:41:44,679 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 174 transitions, 2031 flow. Second operand  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:41:44,679 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:41:44,679 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:41:44,679 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:41:45,830 INFO  L124   PetriNetUnfolderBase]: 2604/3804 cut-off events.
[2024-06-20 19:41:45,830 INFO  L125   PetriNetUnfolderBase]: For 63622/63634 co-relation queries the response was YES.
[2024-06-20 19:41:45,842 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26161 conditions, 3804 events. 2604/3804 cut-off events. For 63622/63634 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 17876 event pairs, 655 based on Foata normal form. 10/3810 useless extension candidates. Maximal degree in co-relation 26104. Up to 3669 conditions per place. 
[2024-06-20 19:41:45,855 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 166 selfloop transitions, 38 changer transitions 0/207 dead transitions.
[2024-06-20 19:41:45,855 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 207 transitions, 2683 flow
[2024-06-20 19:41:45,857 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:41:45,857 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:41:45,859 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions.
[2024-06-20 19:41:45,860 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.403125
[2024-06-20 19:41:45,860 INFO  L175             Difference]: Start difference. First operand has 116 places, 174 transitions, 2031 flow. Second operand 8 states and 129 transitions.
[2024-06-20 19:41:45,860 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 207 transitions, 2683 flow
[2024-06-20 19:41:45,927 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 207 transitions, 2517 flow, removed 44 selfloop flow, removed 4 redundant places.
[2024-06-20 19:41:45,930 INFO  L231             Difference]: Finished difference. Result has 121 places, 182 transitions, 2086 flow
[2024-06-20 19:41:45,930 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1866, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2086, PETRI_PLACES=121, PETRI_TRANSITIONS=182}
[2024-06-20 19:41:45,931 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 80 predicate places.
[2024-06-20 19:41:45,931 INFO  L495      AbstractCegarLoop]: Abstraction has has 121 places, 182 transitions, 2086 flow
[2024-06-20 19:41:45,931 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:41:45,931 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:41:45,931 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:41:45,931 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-20 19:41:45,931 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:41:45,932 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:41:45,932 INFO  L85        PathProgramCache]: Analyzing trace with hash -708618296, now seen corresponding path program 3 times
[2024-06-20 19:41:45,932 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:41:45,932 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183242398]
[2024-06-20 19:41:45,932 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:41:45,932 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:41:45,977 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:41:52,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:41:52,016 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:41:52,016 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183242398]
[2024-06-20 19:41:52,016 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183242398] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:41:52,016 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:41:52,016 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:41:52,016 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2680849]
[2024-06-20 19:41:52,016 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:41:52,017 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:41:52,017 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:41:52,017 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:41:52,017 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:41:52,158 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:41:52,159 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 182 transitions, 2086 flow. Second operand  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:41:52,159 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:41:52,159 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:41:52,159 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:41:53,399 INFO  L124   PetriNetUnfolderBase]: 2675/3911 cut-off events.
[2024-06-20 19:41:53,400 INFO  L125   PetriNetUnfolderBase]: For 70193/70199 co-relation queries the response was YES.
[2024-06-20 19:41:53,415 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26754 conditions, 3911 events. 2675/3911 cut-off events. For 70193/70199 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 18351 event pairs, 682 based on Foata normal form. 8/3912 useless extension candidates. Maximal degree in co-relation 26695. Up to 3552 conditions per place. 
[2024-06-20 19:41:53,430 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 184 selfloop transitions, 60 changer transitions 0/247 dead transitions.
[2024-06-20 19:41:53,430 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 247 transitions, 3259 flow
[2024-06-20 19:41:53,437 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:41:53,437 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:41:53,438 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions.
[2024-06-20 19:41:53,438 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4375
[2024-06-20 19:41:53,438 INFO  L175             Difference]: Start difference. First operand has 121 places, 182 transitions, 2086 flow. Second operand 8 states and 140 transitions.
[2024-06-20 19:41:53,438 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 247 transitions, 3259 flow
[2024-06-20 19:41:53,524 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 247 transitions, 3165 flow, removed 34 selfloop flow, removed 3 redundant places.
[2024-06-20 19:41:53,527 INFO  L231             Difference]: Finished difference. Result has 129 places, 215 transitions, 2683 flow
[2024-06-20 19:41:53,527 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2006, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2683, PETRI_PLACES=129, PETRI_TRANSITIONS=215}
[2024-06-20 19:41:53,527 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 88 predicate places.
[2024-06-20 19:41:53,528 INFO  L495      AbstractCegarLoop]: Abstraction has has 129 places, 215 transitions, 2683 flow
[2024-06-20 19:41:53,528 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:41:53,528 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:41:53,528 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:41:53,528 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-20 19:41:53,528 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:41:53,528 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:41:53,528 INFO  L85        PathProgramCache]: Analyzing trace with hash -715969946, now seen corresponding path program 4 times
[2024-06-20 19:41:53,528 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:41:53,528 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508553297]
[2024-06-20 19:41:53,528 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:41:53,529 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:41:53,562 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:41:59,258 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:41:59,258 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:41:59,258 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508553297]
[2024-06-20 19:41:59,258 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508553297] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:41:59,258 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:41:59,258 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:41:59,258 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440178786]
[2024-06-20 19:41:59,258 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:41:59,258 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:41:59,259 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:41:59,259 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:41:59,259 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:41:59,374 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:41:59,374 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 215 transitions, 2683 flow. Second operand  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:41:59,374 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:41:59,374 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:41:59,374 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:42:00,846 INFO  L124   PetriNetUnfolderBase]: 2881/4201 cut-off events.
[2024-06-20 19:42:00,846 INFO  L125   PetriNetUnfolderBase]: For 85364/85370 co-relation queries the response was YES.
[2024-06-20 19:42:00,862 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30202 conditions, 4201 events. 2881/4201 cut-off events. For 85364/85370 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 19909 event pairs, 666 based on Foata normal form. 17/4211 useless extension candidates. Maximal degree in co-relation 30137. Up to 3687 conditions per place. 
[2024-06-20 19:42:00,877 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 186 selfloop transitions, 79 changer transitions 0/268 dead transitions.
[2024-06-20 19:42:00,877 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 268 transitions, 3721 flow
[2024-06-20 19:42:00,877 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:42:00,877 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:42:00,878 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions.
[2024-06-20 19:42:00,878 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45
[2024-06-20 19:42:00,878 INFO  L175             Difference]: Start difference. First operand has 129 places, 215 transitions, 2683 flow. Second operand 9 states and 162 transitions.
[2024-06-20 19:42:00,878 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 268 transitions, 3721 flow
[2024-06-20 19:42:00,989 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 268 transitions, 3581 flow, removed 69 selfloop flow, removed 1 redundant places.
[2024-06-20 19:42:00,993 INFO  L231             Difference]: Finished difference. Result has 139 places, 233 transitions, 3051 flow
[2024-06-20 19:42:00,993 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2543, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3051, PETRI_PLACES=139, PETRI_TRANSITIONS=233}
[2024-06-20 19:42:00,993 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 98 predicate places.
[2024-06-20 19:42:00,993 INFO  L495      AbstractCegarLoop]: Abstraction has has 139 places, 233 transitions, 3051 flow
[2024-06-20 19:42:00,994 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:00,994 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:42:00,994 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:42:00,994 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-20 19:42:00,994 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:42:00,994 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:42:00,994 INFO  L85        PathProgramCache]: Analyzing trace with hash -715970163, now seen corresponding path program 4 times
[2024-06-20 19:42:00,994 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:42:00,994 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353372021]
[2024-06-20 19:42:00,995 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:42:00,995 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:42:01,024 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:42:06,889 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:42:06,889 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:42:06,889 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353372021]
[2024-06-20 19:42:06,889 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353372021] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:42:06,889 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:42:06,889 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:42:06,890 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8799764]
[2024-06-20 19:42:06,890 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:42:06,890 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:42:06,891 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:42:06,891 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:42:06,891 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:42:07,044 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:42:07,045 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 233 transitions, 3051 flow. Second operand  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:07,045 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:42:07,045 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:42:07,045 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:42:08,540 INFO  L124   PetriNetUnfolderBase]: 3049/4439 cut-off events.
[2024-06-20 19:42:08,541 INFO  L125   PetriNetUnfolderBase]: For 101699/101705 co-relation queries the response was YES.
[2024-06-20 19:42:08,558 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33485 conditions, 4439 events. 3049/4439 cut-off events. For 101699/101705 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 21191 event pairs, 667 based on Foata normal form. 22/4454 useless extension candidates. Maximal degree in co-relation 33415. Up to 3753 conditions per place. 
[2024-06-20 19:42:08,574 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 191 selfloop transitions, 90 changer transitions 0/284 dead transitions.
[2024-06-20 19:42:08,574 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 284 transitions, 4154 flow
[2024-06-20 19:42:08,574 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:42:08,574 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:42:08,575 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions.
[2024-06-20 19:42:08,575 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45555555555555555
[2024-06-20 19:42:08,575 INFO  L175             Difference]: Start difference. First operand has 139 places, 233 transitions, 3051 flow. Second operand 9 states and 164 transitions.
[2024-06-20 19:42:08,575 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 284 transitions, 4154 flow
[2024-06-20 19:42:08,714 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 284 transitions, 3896 flow, removed 115 selfloop flow, removed 3 redundant places.
[2024-06-20 19:42:08,718 INFO  L231             Difference]: Finished difference. Result has 145 places, 248 transitions, 3300 flow
[2024-06-20 19:42:08,718 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2829, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3300, PETRI_PLACES=145, PETRI_TRANSITIONS=248}
[2024-06-20 19:42:08,718 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 104 predicate places.
[2024-06-20 19:42:08,718 INFO  L495      AbstractCegarLoop]: Abstraction has has 145 places, 248 transitions, 3300 flow
[2024-06-20 19:42:08,719 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:08,719 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:42:08,719 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:42:08,719 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-20 19:42:08,719 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:42:08,719 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:42:08,719 INFO  L85        PathProgramCache]: Analyzing trace with hash -715975743, now seen corresponding path program 5 times
[2024-06-20 19:42:08,719 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:42:08,719 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897032105]
[2024-06-20 19:42:08,720 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:42:08,720 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:42:08,747 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:42:14,429 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:42:14,430 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:42:14,430 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897032105]
[2024-06-20 19:42:14,430 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897032105] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:42:14,430 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:42:14,430 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:42:14,430 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114466144]
[2024-06-20 19:42:14,430 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:42:14,431 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:42:14,431 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:42:14,431 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:42:14,431 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:42:14,608 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:42:14,608 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 248 transitions, 3300 flow. Second operand  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:14,608 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:42:14,608 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:42:14,608 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:42:16,076 INFO  L124   PetriNetUnfolderBase]: 3051/4441 cut-off events.
[2024-06-20 19:42:16,076 INFO  L125   PetriNetUnfolderBase]: For 102921/102927 co-relation queries the response was YES.
[2024-06-20 19:42:16,097 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33622 conditions, 4441 events. 3051/4441 cut-off events. For 102921/102927 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 21239 event pairs, 677 based on Foata normal form. 12/4446 useless extension candidates. Maximal degree in co-relation 33551. Up to 3761 conditions per place. 
[2024-06-20 19:42:16,176 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 195 selfloop transitions, 95 changer transitions 0/293 dead transitions.
[2024-06-20 19:42:16,176 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 293 transitions, 4158 flow
[2024-06-20 19:42:16,177 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:42:16,177 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:42:16,177 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions.
[2024-06-20 19:42:16,177 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4525
[2024-06-20 19:42:16,177 INFO  L175             Difference]: Start difference. First operand has 145 places, 248 transitions, 3300 flow. Second operand 10 states and 181 transitions.
[2024-06-20 19:42:16,178 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 293 transitions, 4158 flow
[2024-06-20 19:42:16,341 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 293 transitions, 3878 flow, removed 109 selfloop flow, removed 4 redundant places.
[2024-06-20 19:42:16,345 INFO  L231             Difference]: Finished difference. Result has 152 places, 252 transitions, 3322 flow
[2024-06-20 19:42:16,345 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3034, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3322, PETRI_PLACES=152, PETRI_TRANSITIONS=252}
[2024-06-20 19:42:16,345 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 111 predicate places.
[2024-06-20 19:42:16,345 INFO  L495      AbstractCegarLoop]: Abstraction has has 152 places, 252 transitions, 3322 flow
[2024-06-20 19:42:16,346 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:16,346 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:42:16,346 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:42:16,346 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-20 19:42:16,346 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:42:16,346 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:42:16,346 INFO  L85        PathProgramCache]: Analyzing trace with hash 854522587, now seen corresponding path program 6 times
[2024-06-20 19:42:16,346 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:42:16,347 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565840530]
[2024-06-20 19:42:16,347 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:42:16,347 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:42:16,375 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:42:22,038 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:42:22,039 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:42:22,039 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565840530]
[2024-06-20 19:42:22,039 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565840530] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:42:22,039 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:42:22,039 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:42:22,039 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429371049]
[2024-06-20 19:42:22,040 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:42:22,040 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:42:22,041 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:42:22,041 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:42:22,041 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:42:22,169 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:42:22,169 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 252 transitions, 3322 flow. Second operand  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:22,169 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:42:22,169 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:42:22,169 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:42:23,517 INFO  L124   PetriNetUnfolderBase]: 3025/4403 cut-off events.
[2024-06-20 19:42:23,517 INFO  L125   PetriNetUnfolderBase]: For 106226/106232 co-relation queries the response was YES.
[2024-06-20 19:42:23,537 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33537 conditions, 4403 events. 3025/4403 cut-off events. For 106226/106232 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 21050 event pairs, 701 based on Foata normal form. 10/4406 useless extension candidates. Maximal degree in co-relation 33463. Up to 3865 conditions per place. 
[2024-06-20 19:42:23,554 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 210 selfloop transitions, 80 changer transitions 0/293 dead transitions.
[2024-06-20 19:42:23,554 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 293 transitions, 4225 flow
[2024-06-20 19:42:23,556 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:42:23,556 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:42:23,556 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions.
[2024-06-20 19:42:23,556 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4375
[2024-06-20 19:42:23,556 INFO  L175             Difference]: Start difference. First operand has 152 places, 252 transitions, 3322 flow. Second operand 8 states and 140 transitions.
[2024-06-20 19:42:23,556 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 293 transitions, 4225 flow
[2024-06-20 19:42:23,684 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 293 transitions, 3995 flow, removed 29 selfloop flow, removed 8 redundant places.
[2024-06-20 19:42:23,688 INFO  L231             Difference]: Finished difference. Result has 153 places, 263 transitions, 3473 flow
[2024-06-20 19:42:23,688 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3098, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3473, PETRI_PLACES=153, PETRI_TRANSITIONS=263}
[2024-06-20 19:42:23,689 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 112 predicate places.
[2024-06-20 19:42:23,689 INFO  L495      AbstractCegarLoop]: Abstraction has has 153 places, 263 transitions, 3473 flow
[2024-06-20 19:42:23,689 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:23,689 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:42:23,689 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:42:23,689 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-20 19:42:23,690 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:42:23,690 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:42:23,690 INFO  L85        PathProgramCache]: Analyzing trace with hash -1426608859, now seen corresponding path program 1 times
[2024-06-20 19:42:23,690 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:42:23,690 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308025827]
[2024-06-20 19:42:23,690 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:42:23,690 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:42:23,715 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:42:32,457 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:42:32,457 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:42:32,457 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308025827]
[2024-06-20 19:42:32,457 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308025827] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:42:32,457 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:42:32,457 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:42:32,457 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281252164]
[2024-06-20 19:42:32,457 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:42:32,458 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:42:32,458 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:42:32,458 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:42:32,458 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:42:32,518 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:42:32,519 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 263 transitions, 3473 flow. Second operand  has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:32,519 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:42:32,519 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:42:32,519 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:42:33,758 INFO  L124   PetriNetUnfolderBase]: 3013/4384 cut-off events.
[2024-06-20 19:42:33,758 INFO  L125   PetriNetUnfolderBase]: For 109357/109369 co-relation queries the response was YES.
[2024-06-20 19:42:33,778 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33844 conditions, 4384 events. 3013/4384 cut-off events. For 109357/109369 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 21003 event pairs, 745 based on Foata normal form. 12/4392 useless extension candidates. Maximal degree in co-relation 33769. Up to 4335 conditions per place. 
[2024-06-20 19:42:33,793 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 257 selfloop transitions, 12 changer transitions 0/272 dead transitions.
[2024-06-20 19:42:33,793 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 272 transitions, 4035 flow
[2024-06-20 19:42:33,794 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 19:42:33,795 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 19:42:33,795 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions.
[2024-06-20 19:42:33,795 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.405
[2024-06-20 19:42:33,795 INFO  L175             Difference]: Start difference. First operand has 153 places, 263 transitions, 3473 flow. Second operand 5 states and 81 transitions.
[2024-06-20 19:42:33,795 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 272 transitions, 4035 flow
[2024-06-20 19:42:33,940 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 272 transitions, 3854 flow, removed 36 selfloop flow, removed 5 redundant places.
[2024-06-20 19:42:33,944 INFO  L231             Difference]: Finished difference. Result has 153 places, 263 transitions, 3323 flow
[2024-06-20 19:42:33,944 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3292, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3323, PETRI_PLACES=153, PETRI_TRANSITIONS=263}
[2024-06-20 19:42:33,944 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 112 predicate places.
[2024-06-20 19:42:33,944 INFO  L495      AbstractCegarLoop]: Abstraction has has 153 places, 263 transitions, 3323 flow
[2024-06-20 19:42:33,944 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:33,944 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:42:33,944 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:42:33,944 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-20 19:42:33,945 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:42:33,945 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:42:33,945 INFO  L85        PathProgramCache]: Analyzing trace with hash 712521624, now seen corresponding path program 1 times
[2024-06-20 19:42:33,945 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:42:33,945 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174045712]
[2024-06-20 19:42:33,945 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:42:33,945 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:42:33,980 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:42:39,861 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:42:39,861 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:42:39,861 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174045712]
[2024-06-20 19:42:39,861 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174045712] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:42:39,861 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:42:39,861 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:42:39,861 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996433328]
[2024-06-20 19:42:39,861 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:42:39,862 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:42:39,862 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:42:39,862 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:42:39,862 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:42:40,066 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:42:40,066 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 263 transitions, 3323 flow. Second operand  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:40,066 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:42:40,066 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:42:40,066 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:42:41,398 INFO  L124   PetriNetUnfolderBase]: 2960/4326 cut-off events.
[2024-06-20 19:42:41,398 INFO  L125   PetriNetUnfolderBase]: For 117246/117319 co-relation queries the response was YES.
[2024-06-20 19:42:41,419 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33414 conditions, 4326 events. 2960/4326 cut-off events. For 117246/117319 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 20892 event pairs, 582 based on Foata normal form. 18/4297 useless extension candidates. Maximal degree in co-relation 33338. Up to 4090 conditions per place. 
[2024-06-20 19:42:41,435 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 232 selfloop transitions, 20 changer transitions 0/289 dead transitions.
[2024-06-20 19:42:41,435 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 289 transitions, 3931 flow
[2024-06-20 19:42:41,437 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:42:41,437 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:42:41,437 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions.
[2024-06-20 19:42:41,437 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-20 19:42:41,437 INFO  L175             Difference]: Start difference. First operand has 153 places, 263 transitions, 3323 flow. Second operand 7 states and 120 transitions.
[2024-06-20 19:42:41,437 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 289 transitions, 3931 flow
[2024-06-20 19:42:41,588 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 289 transitions, 3907 flow, removed 0 selfloop flow, removed 4 redundant places.
[2024-06-20 19:42:41,591 INFO  L231             Difference]: Finished difference. Result has 156 places, 265 transitions, 3394 flow
[2024-06-20 19:42:41,592 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3299, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3394, PETRI_PLACES=156, PETRI_TRANSITIONS=265}
[2024-06-20 19:42:41,592 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 115 predicate places.
[2024-06-20 19:42:41,592 INFO  L495      AbstractCegarLoop]: Abstraction has has 156 places, 265 transitions, 3394 flow
[2024-06-20 19:42:41,592 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:41,592 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:42:41,592 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:42:41,592 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-20 19:42:41,593 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:42:41,593 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:42:41,593 INFO  L85        PathProgramCache]: Analyzing trace with hash 709843224, now seen corresponding path program 2 times
[2024-06-20 19:42:41,593 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:42:41,593 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905762503]
[2024-06-20 19:42:41,593 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:42:41,593 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:42:41,636 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:42:47,182 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:42:47,182 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:42:47,182 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905762503]
[2024-06-20 19:42:47,182 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905762503] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:42:47,182 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:42:47,182 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:42:47,182 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973991320]
[2024-06-20 19:42:47,182 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:42:47,183 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:42:47,183 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:42:47,183 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:42:47,183 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:42:47,297 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:42:47,298 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 265 transitions, 3394 flow. Second operand  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:47,298 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:42:47,298 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:42:47,298 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:42:48,620 INFO  L124   PetriNetUnfolderBase]: 2981/4359 cut-off events.
[2024-06-20 19:42:48,620 INFO  L125   PetriNetUnfolderBase]: For 125714/125786 co-relation queries the response was YES.
[2024-06-20 19:42:48,640 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34202 conditions, 4359 events. 2981/4359 cut-off events. For 125714/125786 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 21123 event pairs, 677 based on Foata normal form. 16/4324 useless extension candidates. Maximal degree in co-relation 34125. Up to 4109 conditions per place. 
[2024-06-20 19:42:48,656 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 222 selfloop transitions, 32 changer transitions 0/291 dead transitions.
[2024-06-20 19:42:48,656 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 291 transitions, 4014 flow
[2024-06-20 19:42:48,657 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:42:48,657 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:42:48,657 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions.
[2024-06-20 19:42:48,657 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43214285714285716
[2024-06-20 19:42:48,657 INFO  L175             Difference]: Start difference. First operand has 156 places, 265 transitions, 3394 flow. Second operand 7 states and 121 transitions.
[2024-06-20 19:42:48,658 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 291 transitions, 4014 flow
[2024-06-20 19:42:48,803 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 291 transitions, 3951 flow, removed 13 selfloop flow, removed 5 redundant places.
[2024-06-20 19:42:48,807 INFO  L231             Difference]: Finished difference. Result has 158 places, 267 transitions, 3459 flow
[2024-06-20 19:42:48,807 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3331, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3459, PETRI_PLACES=158, PETRI_TRANSITIONS=267}
[2024-06-20 19:42:48,808 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 117 predicate places.
[2024-06-20 19:42:48,808 INFO  L495      AbstractCegarLoop]: Abstraction has has 158 places, 267 transitions, 3459 flow
[2024-06-20 19:42:48,808 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:48,808 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:42:48,808 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:42:48,808 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-20 19:42:48,808 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:42:48,808 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:42:48,808 INFO  L85        PathProgramCache]: Analyzing trace with hash 709843348, now seen corresponding path program 1 times
[2024-06-20 19:42:48,808 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:42:48,809 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961605308]
[2024-06-20 19:42:48,809 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:42:48,809 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:42:48,844 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:42:54,395 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:42:54,395 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:42:54,395 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961605308]
[2024-06-20 19:42:54,395 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961605308] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:42:54,396 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:42:54,396 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:42:54,396 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185411588]
[2024-06-20 19:42:54,396 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:42:54,396 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:42:54,396 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:42:54,396 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:42:54,397 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:42:54,518 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:42:54,519 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 267 transitions, 3459 flow. Second operand  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:54,519 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:42:54,519 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:42:54,519 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:42:56,155 INFO  L124   PetriNetUnfolderBase]: 3077/4482 cut-off events.
[2024-06-20 19:42:56,155 INFO  L125   PetriNetUnfolderBase]: For 130709/130721 co-relation queries the response was YES.
[2024-06-20 19:42:56,174 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35273 conditions, 4482 events. 3077/4482 cut-off events. For 130709/130721 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 21610 event pairs, 672 based on Foata normal form. 13/4491 useless extension candidates. Maximal degree in co-relation 35195. Up to 4162 conditions per place. 
[2024-06-20 19:42:56,190 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 249 selfloop transitions, 62 changer transitions 0/314 dead transitions.
[2024-06-20 19:42:56,190 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 314 transitions, 4539 flow
[2024-06-20 19:42:56,190 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:42:56,190 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:42:56,191 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions.
[2024-06-20 19:42:56,191 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43333333333333335
[2024-06-20 19:42:56,191 INFO  L175             Difference]: Start difference. First operand has 158 places, 267 transitions, 3459 flow. Second operand 9 states and 156 transitions.
[2024-06-20 19:42:56,191 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 314 transitions, 4539 flow
[2024-06-20 19:42:56,370 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 314 transitions, 4439 flow, removed 20 selfloop flow, removed 5 redundant places.
[2024-06-20 19:42:56,376 INFO  L231             Difference]: Finished difference. Result has 164 places, 279 transitions, 3745 flow
[2024-06-20 19:42:56,376 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3363, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3745, PETRI_PLACES=164, PETRI_TRANSITIONS=279}
[2024-06-20 19:42:56,377 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 123 predicate places.
[2024-06-20 19:42:56,377 INFO  L495      AbstractCegarLoop]: Abstraction has has 164 places, 279 transitions, 3745 flow
[2024-06-20 19:42:56,377 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:42:56,377 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:42:56,377 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:42:56,377 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-20 19:42:56,377 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:42:56,377 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:42:56,377 INFO  L85        PathProgramCache]: Analyzing trace with hash -1758508190, now seen corresponding path program 1 times
[2024-06-20 19:42:56,378 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:42:56,378 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138491781]
[2024-06-20 19:42:56,378 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:42:56,378 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:42:56,416 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:43:02,685 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:43:02,686 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:43:02,686 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138491781]
[2024-06-20 19:43:02,686 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138491781] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:43:02,686 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:43:02,686 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:43:02,686 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224727708]
[2024-06-20 19:43:02,686 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:43:02,687 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:43:02,687 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:43:02,687 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:43:02,687 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:43:02,878 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:43:02,878 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 279 transitions, 3745 flow. Second operand  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:43:02,878 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:43:02,878 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:43:02,878 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:43:04,494 INFO  L124   PetriNetUnfolderBase]: 3137/4570 cut-off events.
[2024-06-20 19:43:04,494 INFO  L125   PetriNetUnfolderBase]: For 142059/142074 co-relation queries the response was YES.
[2024-06-20 19:43:04,515 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36899 conditions, 4570 events. 3137/4570 cut-off events. For 142059/142074 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 22115 event pairs, 644 based on Foata normal form. 20/4584 useless extension candidates. Maximal degree in co-relation 36818. Up to 4248 conditions per place. 
[2024-06-20 19:43:04,531 INFO  L140   encePairwiseOnDemand]: 24/40 looper letters, 270 selfloop transitions, 54 changer transitions 0/327 dead transitions.
[2024-06-20 19:43:04,531 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 327 transitions, 4823 flow
[2024-06-20 19:43:04,532 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:43:04,532 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:43:04,532 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 173 transitions.
[2024-06-20 19:43:04,532 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4325
[2024-06-20 19:43:04,532 INFO  L175             Difference]: Start difference. First operand has 164 places, 279 transitions, 3745 flow. Second operand 10 states and 173 transitions.
[2024-06-20 19:43:04,532 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 327 transitions, 4823 flow
[2024-06-20 19:43:04,732 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 327 transitions, 4683 flow, removed 48 selfloop flow, removed 4 redundant places.
[2024-06-20 19:43:04,736 INFO  L231             Difference]: Finished difference. Result has 170 places, 286 transitions, 3865 flow
[2024-06-20 19:43:04,736 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3605, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3865, PETRI_PLACES=170, PETRI_TRANSITIONS=286}
[2024-06-20 19:43:04,737 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 129 predicate places.
[2024-06-20 19:43:04,737 INFO  L495      AbstractCegarLoop]: Abstraction has has 170 places, 286 transitions, 3865 flow
[2024-06-20 19:43:04,737 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:43:04,737 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:43:04,737 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:43:04,737 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-20 19:43:04,737 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:43:04,738 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:43:04,738 INFO  L85        PathProgramCache]: Analyzing trace with hash 828108844, now seen corresponding path program 2 times
[2024-06-20 19:43:04,738 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:43:04,738 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709959349]
[2024-06-20 19:43:04,738 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:43:04,738 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:43:04,781 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:43:09,422 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:43:09,422 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:43:09,422 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709959349]
[2024-06-20 19:43:09,422 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709959349] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:43:09,422 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:43:09,422 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:43:09,422 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748751029]
[2024-06-20 19:43:09,423 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:43:09,423 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:43:09,423 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:43:09,423 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:43:09,423 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:43:09,616 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:43:09,616 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 286 transitions, 3865 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:43:09,616 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:43:09,616 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:43:09,616 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:43:11,092 INFO  L124   PetriNetUnfolderBase]: 3117/4545 cut-off events.
[2024-06-20 19:43:11,092 INFO  L125   PetriNetUnfolderBase]: For 146545/146551 co-relation queries the response was YES.
[2024-06-20 19:43:11,115 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36818 conditions, 4545 events. 3117/4545 cut-off events. For 146545/146551 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 21977 event pairs, 624 based on Foata normal form. 12/4550 useless extension candidates. Maximal degree in co-relation 36736. Up to 3680 conditions per place. 
[2024-06-20 19:43:11,131 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 197 selfloop transitions, 131 changer transitions 0/331 dead transitions.
[2024-06-20 19:43:11,131 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 331 transitions, 4973 flow
[2024-06-20 19:43:11,131 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:43:11,131 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:43:11,132 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions.
[2024-06-20 19:43:11,132 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46875
[2024-06-20 19:43:11,132 INFO  L175             Difference]: Start difference. First operand has 170 places, 286 transitions, 3865 flow. Second operand 8 states and 150 transitions.
[2024-06-20 19:43:11,132 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 331 transitions, 4973 flow
[2024-06-20 19:43:11,333 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 331 transitions, 4792 flow, removed 41 selfloop flow, removed 8 redundant places.
[2024-06-20 19:43:11,337 INFO  L231             Difference]: Finished difference. Result has 172 places, 296 transitions, 4256 flow
[2024-06-20 19:43:11,337 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3684, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4256, PETRI_PLACES=172, PETRI_TRANSITIONS=296}
[2024-06-20 19:43:11,338 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 131 predicate places.
[2024-06-20 19:43:11,338 INFO  L495      AbstractCegarLoop]: Abstraction has has 172 places, 296 transitions, 4256 flow
[2024-06-20 19:43:11,338 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:43:11,338 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:43:11,338 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:43:11,338 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-20 19:43:11,338 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:43:11,339 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:43:11,339 INFO  L85        PathProgramCache]: Analyzing trace with hash 828115602, now seen corresponding path program 1 times
[2024-06-20 19:43:11,339 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:43:11,339 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330428076]
[2024-06-20 19:43:11,339 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:43:11,339 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:43:11,391 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:43:18,625 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:43:18,625 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:43:18,625 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330428076]
[2024-06-20 19:43:18,625 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330428076] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:43:18,625 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:43:18,625 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:43:18,625 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581522589]
[2024-06-20 19:43:18,625 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:43:18,625 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:43:18,626 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:43:18,626 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:43:18,626 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:43:18,734 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:43:18,735 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 296 transitions, 4256 flow. Second operand  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:43:18,735 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:43:18,735 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:43:18,735 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:43:20,279 INFO  L124   PetriNetUnfolderBase]: 3270/4785 cut-off events.
[2024-06-20 19:43:20,280 INFO  L125   PetriNetUnfolderBase]: For 171631/171643 co-relation queries the response was YES.
[2024-06-20 19:43:20,306 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40044 conditions, 4785 events. 3270/4785 cut-off events. For 171631/171643 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 23489 event pairs, 655 based on Foata normal form. 40/4821 useless extension candidates. Maximal degree in co-relation 39959. Up to 4384 conditions per place. 
[2024-06-20 19:43:20,325 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 279 selfloop transitions, 54 changer transitions 0/336 dead transitions.
[2024-06-20 19:43:20,325 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 336 transitions, 5248 flow
[2024-06-20 19:43:20,325 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:43:20,326 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:43:20,326 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions.
[2024-06-20 19:43:20,326 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44166666666666665
[2024-06-20 19:43:20,326 INFO  L175             Difference]: Start difference. First operand has 172 places, 296 transitions, 4256 flow. Second operand 9 states and 159 transitions.
[2024-06-20 19:43:20,326 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 336 transitions, 5248 flow
[2024-06-20 19:43:20,562 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 336 transitions, 5072 flow, removed 31 selfloop flow, removed 4 redundant places.
[2024-06-20 19:43:20,566 INFO  L231             Difference]: Finished difference. Result has 177 places, 300 transitions, 4313 flow
[2024-06-20 19:43:20,566 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4080, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4313, PETRI_PLACES=177, PETRI_TRANSITIONS=300}
[2024-06-20 19:43:20,567 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 136 predicate places.
[2024-06-20 19:43:20,567 INFO  L495      AbstractCegarLoop]: Abstraction has has 177 places, 300 transitions, 4313 flow
[2024-06-20 19:43:20,567 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:43:20,567 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:43:20,567 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:43:20,567 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-20 19:43:20,567 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:43:20,567 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:43:20,567 INFO  L85        PathProgramCache]: Analyzing trace with hash 827930904, now seen corresponding path program 3 times
[2024-06-20 19:43:20,567 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:43:20,568 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424806048]
[2024-06-20 19:43:20,568 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:43:20,568 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:43:20,616 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:43:25,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:43:25,922 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:43:25,922 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424806048]
[2024-06-20 19:43:25,922 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424806048] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:43:25,922 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:43:25,922 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:43:25,923 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670981406]
[2024-06-20 19:43:25,923 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:43:25,923 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:43:25,923 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:43:25,923 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:43:25,924 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:43:26,083 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-20 19:43:26,083 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 300 transitions, 4313 flow. Second operand  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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:43:26,083 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:43:26,083 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-20 19:43:26,083 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:43:27,519 INFO  L124   PetriNetUnfolderBase]: 3178/4671 cut-off events.
[2024-06-20 19:43:27,520 INFO  L125   PetriNetUnfolderBase]: For 170499/170555 co-relation queries the response was YES.
[2024-06-20 19:43:27,542 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39575 conditions, 4671 events. 3178/4671 cut-off events. For 170499/170555 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 23101 event pairs, 643 based on Foata normal form. 10/4625 useless extension candidates. Maximal degree in co-relation 39489. Up to 4332 conditions per place. 
[2024-06-20 19:43:27,559 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 230 selfloop transitions, 55 changer transitions 0/324 dead transitions.
[2024-06-20 19:43:27,559 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 324 transitions, 4999 flow
[2024-06-20 19:43:27,560 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:43:27,560 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:43:27,560 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions.
[2024-06-20 19:43:27,560 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4357142857142857
[2024-06-20 19:43:27,560 INFO  L175             Difference]: Start difference. First operand has 177 places, 300 transitions, 4313 flow. Second operand 7 states and 122 transitions.
[2024-06-20 19:43:27,560 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 324 transitions, 4999 flow
[2024-06-20 19:43:27,819 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 324 transitions, 4852 flow, removed 25 selfloop flow, removed 7 redundant places.
[2024-06-20 19:43:27,823 INFO  L231             Difference]: Finished difference. Result has 177 places, 302 transitions, 4345 flow
[2024-06-20 19:43:27,824 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4166, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4345, PETRI_PLACES=177, PETRI_TRANSITIONS=302}
[2024-06-20 19:43:27,824 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 136 predicate places.
[2024-06-20 19:43:27,824 INFO  L495      AbstractCegarLoop]: Abstraction has has 177 places, 302 transitions, 4345 flow
[2024-06-20 19:43:27,824 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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:43:27,824 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:43:27,824 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:43:27,824 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-20 19:43:27,824 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:43:27,825 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:43:27,825 INFO  L85        PathProgramCache]: Analyzing trace with hash -492328976, now seen corresponding path program 2 times
[2024-06-20 19:43:27,825 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:43:27,825 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702451176]
[2024-06-20 19:43:27,825 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:43:27,825 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:43:27,857 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:43:33,877 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:43:33,877 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:43:33,877 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702451176]
[2024-06-20 19:43:33,878 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702451176] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:43:33,878 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:43:33,878 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:43:33,878 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389280538]
[2024-06-20 19:43:33,878 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:43:33,878 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:43:33,878 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:43:33,878 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:43:33,879 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:43:34,031 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:43:34,031 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 302 transitions, 4345 flow. Second operand  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:43:34,031 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:43:34,031 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:43:34,031 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:43:35,594 INFO  L124   PetriNetUnfolderBase]: 3349/4921 cut-off events.
[2024-06-20 19:43:35,594 INFO  L125   PetriNetUnfolderBase]: For 186642/186648 co-relation queries the response was YES.
[2024-06-20 19:43:35,616 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40996 conditions, 4921 events. 3349/4921 cut-off events. For 186642/186648 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 24480 event pairs, 714 based on Foata normal form. 26/4940 useless extension candidates. Maximal degree in co-relation 40909. Up to 4431 conditions per place. 
[2024-06-20 19:43:35,632 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 272 selfloop transitions, 66 changer transitions 0/341 dead transitions.
[2024-06-20 19:43:35,632 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 341 transitions, 5224 flow
[2024-06-20 19:43:35,634 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:43:35,634 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:43:35,634 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions.
[2024-06-20 19:43:35,634 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42777777777777776
[2024-06-20 19:43:35,635 INFO  L175             Difference]: Start difference. First operand has 177 places, 302 transitions, 4345 flow. Second operand 9 states and 154 transitions.
[2024-06-20 19:43:35,635 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 341 transitions, 5224 flow
[2024-06-20 19:43:35,882 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 341 transitions, 5087 flow, removed 17 selfloop flow, removed 5 redundant places.
[2024-06-20 19:43:35,886 INFO  L231             Difference]: Finished difference. Result has 181 places, 304 transitions, 4411 flow
[2024-06-20 19:43:35,887 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4208, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4411, PETRI_PLACES=181, PETRI_TRANSITIONS=304}
[2024-06-20 19:43:35,887 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 140 predicate places.
[2024-06-20 19:43:35,887 INFO  L495      AbstractCegarLoop]: Abstraction has has 181 places, 304 transitions, 4411 flow
[2024-06-20 19:43:35,887 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:43:35,887 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:43:35,888 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:43:35,888 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-20 19:43:35,888 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:43:35,888 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:43:35,888 INFO  L85        PathProgramCache]: Analyzing trace with hash -483758096, now seen corresponding path program 3 times
[2024-06-20 19:43:35,888 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:43:35,888 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043432106]
[2024-06-20 19:43:35,888 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:43:35,888 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:43:35,927 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:43:42,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:43:42,663 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:43:42,663 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043432106]
[2024-06-20 19:43:42,663 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043432106] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:43:42,663 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:43:42,663 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:43:42,663 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135847559]
[2024-06-20 19:43:42,663 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:43:42,663 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:43:42,663 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:43:42,664 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:43:42,664 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:43:42,927 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:43:42,927 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 304 transitions, 4411 flow. Second operand  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:43:42,927 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:43:42,927 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:43:42,927 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:43:44,441 INFO  L124   PetriNetUnfolderBase]: 3366/4945 cut-off events.
[2024-06-20 19:43:44,441 INFO  L125   PetriNetUnfolderBase]: For 188291/188303 co-relation queries the response was YES.
[2024-06-20 19:43:44,466 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41692 conditions, 4945 events. 3366/4945 cut-off events. For 188291/188303 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 24602 event pairs, 747 based on Foata normal form. 12/4953 useless extension candidates. Maximal degree in co-relation 41604. Up to 4702 conditions per place. 
[2024-06-20 19:43:44,485 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 288 selfloop transitions, 50 changer transitions 0/341 dead transitions.
[2024-06-20 19:43:44,485 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 341 transitions, 5466 flow
[2024-06-20 19:43:44,487 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:43:44,487 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:43:44,487 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions.
[2024-06-20 19:43:44,487 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4
[2024-06-20 19:43:44,487 INFO  L175             Difference]: Start difference. First operand has 181 places, 304 transitions, 4411 flow. Second operand 9 states and 144 transitions.
[2024-06-20 19:43:44,487 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 341 transitions, 5466 flow
[2024-06-20 19:43:44,776 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 341 transitions, 5295 flow, removed 26 selfloop flow, removed 6 redundant places.
[2024-06-20 19:43:44,780 INFO  L231             Difference]: Finished difference. Result has 185 places, 310 transitions, 4545 flow
[2024-06-20 19:43:44,780 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4259, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4545, PETRI_PLACES=185, PETRI_TRANSITIONS=310}
[2024-06-20 19:43:44,781 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 144 predicate places.
[2024-06-20 19:43:44,781 INFO  L495      AbstractCegarLoop]: Abstraction has has 185 places, 310 transitions, 4545 flow
[2024-06-20 19:43:44,781 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:43:44,781 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:43:44,781 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:43:44,781 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-20 19:43:44,781 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:43:44,781 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:43:44,781 INFO  L85        PathProgramCache]: Analyzing trace with hash -484054766, now seen corresponding path program 4 times
[2024-06-20 19:43:44,782 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:43:44,782 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532630223]
[2024-06-20 19:43:44,782 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:43:44,782 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:43:44,821 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:43:51,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:43:51,369 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:43:51,369 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532630223]
[2024-06-20 19:43:51,369 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532630223] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:43:51,369 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:43:51,369 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:43:51,369 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717912273]
[2024-06-20 19:43:51,370 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:43:51,370 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:43:51,370 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:43:51,370 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:43:51,370 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:43:51,589 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:43:51,589 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 310 transitions, 4545 flow. Second operand  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:43:51,589 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:43:51,589 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:43:51,590 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:43:53,189 INFO  L124   PetriNetUnfolderBase]: 3383/4972 cut-off events.
[2024-06-20 19:43:53,189 INFO  L125   PetriNetUnfolderBase]: For 196419/196431 co-relation queries the response was YES.
[2024-06-20 19:43:53,218 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42108 conditions, 4972 events. 3383/4972 cut-off events. For 196419/196431 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 24868 event pairs, 782 based on Foata normal form. 12/4980 useless extension candidates. Maximal degree in co-relation 42017. Up to 4799 conditions per place. 
[2024-06-20 19:43:53,239 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 295 selfloop transitions, 46 changer transitions 0/344 dead transitions.
[2024-06-20 19:43:53,239 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 344 transitions, 5375 flow
[2024-06-20 19:43:53,241 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:43:53,241 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:43:53,242 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 155 transitions.
[2024-06-20 19:43:53,242 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3875
[2024-06-20 19:43:53,242 INFO  L175             Difference]: Start difference. First operand has 185 places, 310 transitions, 4545 flow. Second operand 10 states and 155 transitions.
[2024-06-20 19:43:53,242 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 344 transitions, 5375 flow
[2024-06-20 19:43:53,538 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 344 transitions, 5191 flow, removed 67 selfloop flow, removed 5 redundant places.
[2024-06-20 19:43:53,542 INFO  L231             Difference]: Finished difference. Result has 190 places, 312 transitions, 4535 flow
[2024-06-20 19:43:53,542 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4387, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4535, PETRI_PLACES=190, PETRI_TRANSITIONS=312}
[2024-06-20 19:43:53,543 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 149 predicate places.
[2024-06-20 19:43:53,543 INFO  L495      AbstractCegarLoop]: Abstraction has has 190 places, 312 transitions, 4535 flow
[2024-06-20 19:43:53,543 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:43:53,543 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:43:53,543 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:43:53,543 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-20 19:43:53,543 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:43:53,543 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:43:53,544 INFO  L85        PathProgramCache]: Analyzing trace with hash -720230126, now seen corresponding path program 5 times
[2024-06-20 19:43:53,544 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:43:53,544 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682662837]
[2024-06-20 19:43:53,544 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:43:53,544 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:43:53,580 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:43:59,970 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:43:59,970 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:43:59,970 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682662837]
[2024-06-20 19:43:59,970 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682662837] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:43:59,970 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:43:59,970 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:43:59,970 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558362267]
[2024-06-20 19:43:59,971 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:43:59,971 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:43:59,971 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:43:59,971 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:43:59,971 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:44:00,124 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:44:00,125 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 312 transitions, 4535 flow. Second operand  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:44:00,125 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:44:00,125 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:44:00,125 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:44:01,844 INFO  L124   PetriNetUnfolderBase]: 3443/5068 cut-off events.
[2024-06-20 19:44:01,844 INFO  L125   PetriNetUnfolderBase]: For 211971/211983 co-relation queries the response was YES.
[2024-06-20 19:44:01,876 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42846 conditions, 5068 events. 3443/5068 cut-off events. For 211971/211983 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 25450 event pairs, 776 based on Foata normal form. 26/5090 useless extension candidates. Maximal degree in co-relation 42753. Up to 4825 conditions per place. 
[2024-06-20 19:44:01,898 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 306 selfloop transitions, 46 changer transitions 0/355 dead transitions.
[2024-06-20 19:44:01,898 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 355 transitions, 5557 flow
[2024-06-20 19:44:01,899 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:44:01,899 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:44:01,899 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 168 transitions.
[2024-06-20 19:44:01,899 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42
[2024-06-20 19:44:01,899 INFO  L175             Difference]: Start difference. First operand has 190 places, 312 transitions, 4535 flow. Second operand 10 states and 168 transitions.
[2024-06-20 19:44:01,900 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 355 transitions, 5557 flow
[2024-06-20 19:44:02,222 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 355 transitions, 5417 flow, removed 37 selfloop flow, removed 6 redundant places.
[2024-06-20 19:44:02,227 INFO  L231             Difference]: Finished difference. Result has 195 places, 317 transitions, 4608 flow
[2024-06-20 19:44:02,227 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4395, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4608, PETRI_PLACES=195, PETRI_TRANSITIONS=317}
[2024-06-20 19:44:02,228 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 154 predicate places.
[2024-06-20 19:44:02,228 INFO  L495      AbstractCegarLoop]: Abstraction has has 195 places, 317 transitions, 4608 flow
[2024-06-20 19:44:02,228 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:44:02,228 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:44:02,228 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:44:02,229 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-20 19:44:02,229 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:44:02,229 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:44:02,229 INFO  L85        PathProgramCache]: Analyzing trace with hash 528431172, now seen corresponding path program 1 times
[2024-06-20 19:44:02,229 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:44:02,229 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721862119]
[2024-06-20 19:44:02,229 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:44:02,229 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:44:02,271 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:44:08,257 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:44:08,258 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:44:08,258 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721862119]
[2024-06-20 19:44:08,258 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721862119] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:44:08,258 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:44:08,258 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:44:08,258 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113739467]
[2024-06-20 19:44:08,258 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:44:08,258 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:44:08,258 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:44:08,259 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:44:08,259 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:44:08,523 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:44:08,523 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 317 transitions, 4608 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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:44:08,523 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:44:08,523 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:44:08,524 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:44:10,523 INFO  L124   PetriNetUnfolderBase]: 3734/5513 cut-off events.
[2024-06-20 19:44:10,523 INFO  L125   PetriNetUnfolderBase]: For 244723/244735 co-relation queries the response was YES.
[2024-06-20 19:44:10,551 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47257 conditions, 5513 events. 3734/5513 cut-off events. For 244723/244735 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 28322 event pairs, 640 based on Foata normal form. 26/5535 useless extension candidates. Maximal degree in co-relation 47162. Up to 4957 conditions per place. 
[2024-06-20 19:44:10,571 INFO  L140   encePairwiseOnDemand]: 25/40 looper letters, 336 selfloop transitions, 42 changer transitions 0/381 dead transitions.
[2024-06-20 19:44:10,572 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 381 transitions, 6158 flow
[2024-06-20 19:44:10,572 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:44:10,572 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:44:10,572 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions.
[2024-06-20 19:44:10,573 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4525
[2024-06-20 19:44:10,573 INFO  L175             Difference]: Start difference. First operand has 195 places, 317 transitions, 4608 flow. Second operand 10 states and 181 transitions.
[2024-06-20 19:44:10,573 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 381 transitions, 6158 flow
[2024-06-20 19:44:10,876 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 381 transitions, 6029 flow, removed 27 selfloop flow, removed 7 redundant places.
[2024-06-20 19:44:10,881 INFO  L231             Difference]: Finished difference. Result has 200 places, 329 transitions, 4869 flow
[2024-06-20 19:44:10,882 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4479, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4869, PETRI_PLACES=200, PETRI_TRANSITIONS=329}
[2024-06-20 19:44:10,882 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 159 predicate places.
[2024-06-20 19:44:10,882 INFO  L495      AbstractCegarLoop]: Abstraction has has 200 places, 329 transitions, 4869 flow
[2024-06-20 19:44:10,882 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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:44:10,882 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:44:10,882 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:44:10,883 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-20 19:44:10,883 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:44:10,883 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:44:10,883 INFO  L85        PathProgramCache]: Analyzing trace with hash 1317097656, now seen corresponding path program 2 times
[2024-06-20 19:44:10,883 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:44:10,883 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185160505]
[2024-06-20 19:44:10,883 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:44:10,883 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:44:10,948 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:44:17,188 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:44:17,188 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:44:17,188 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185160505]
[2024-06-20 19:44:17,188 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185160505] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:44:17,188 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:44:17,188 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:44:17,189 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395358868]
[2024-06-20 19:44:17,189 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:44:17,189 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:44:17,189 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:44:17,189 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:44:17,189 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:44:17,372 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:44:17,373 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 329 transitions, 4869 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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:44:17,373 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:44:17,373 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:44:17,373 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:44:19,453 INFO  L124   PetriNetUnfolderBase]: 3817/5646 cut-off events.
[2024-06-20 19:44:19,453 INFO  L125   PetriNetUnfolderBase]: For 265412/265424 co-relation queries the response was YES.
[2024-06-20 19:44:19,483 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 49721 conditions, 5646 events. 3817/5646 cut-off events. For 265412/265424 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 29238 event pairs, 811 based on Foata normal form. 28/5670 useless extension candidates. Maximal degree in co-relation 49623. Up to 5181 conditions per place. 
[2024-06-20 19:44:19,507 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 304 selfloop transitions, 69 changer transitions 0/376 dead transitions.
[2024-06-20 19:44:19,507 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 376 transitions, 6065 flow
[2024-06-20 19:44:19,508 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:44:19,508 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:44:19,508 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions.
[2024-06-20 19:44:19,509 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.435
[2024-06-20 19:44:19,509 INFO  L175             Difference]: Start difference. First operand has 200 places, 329 transitions, 4869 flow. Second operand 10 states and 174 transitions.
[2024-06-20 19:44:19,509 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 376 transitions, 6065 flow
[2024-06-20 19:44:19,945 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 376 transitions, 5898 flow, removed 64 selfloop flow, removed 5 redundant places.
[2024-06-20 19:44:19,950 INFO  L231             Difference]: Finished difference. Result has 206 places, 332 transitions, 4995 flow
[2024-06-20 19:44:19,950 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4702, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4995, PETRI_PLACES=206, PETRI_TRANSITIONS=332}
[2024-06-20 19:44:19,951 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 165 predicate places.
[2024-06-20 19:44:19,951 INFO  L495      AbstractCegarLoop]: Abstraction has has 206 places, 332 transitions, 4995 flow
[2024-06-20 19:44:19,951 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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:44:19,951 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:44:19,951 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:44:19,951 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-20 19:44:19,951 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:44:19,952 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:44:19,952 INFO  L85        PathProgramCache]: Analyzing trace with hash -246047164, now seen corresponding path program 3 times
[2024-06-20 19:44:19,952 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:44:19,952 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17714847]
[2024-06-20 19:44:19,952 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:44:19,952 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:44:19,986 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:44:26,305 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:44:26,305 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:44:26,305 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17714847]
[2024-06-20 19:44:26,305 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17714847] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:44:26,305 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:44:26,305 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:44:26,305 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534606155]
[2024-06-20 19:44:26,305 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:44:26,306 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:44:26,306 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:44:26,306 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:44:26,306 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:44:26,541 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:44:26,541 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 332 transitions, 4995 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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:44:26,541 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:44:26,541 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:44:26,541 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:44:28,695 INFO  L124   PetriNetUnfolderBase]: 4103/6088 cut-off events.
[2024-06-20 19:44:28,696 INFO  L125   PetriNetUnfolderBase]: For 314396/314408 co-relation queries the response was YES.
[2024-06-20 19:44:28,735 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 54814 conditions, 6088 events. 4103/6088 cut-off events. For 314396/314408 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 32155 event pairs, 846 based on Foata normal form. 26/6110 useless extension candidates. Maximal degree in co-relation 54713. Up to 5300 conditions per place. 
[2024-06-20 19:44:28,764 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 325 selfloop transitions, 63 changer transitions 0/391 dead transitions.
[2024-06-20 19:44:28,764 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 391 transitions, 6580 flow
[2024-06-20 19:44:28,765 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:44:28,765 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:44:28,765 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 180 transitions.
[2024-06-20 19:44:28,765 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45
[2024-06-20 19:44:28,765 INFO  L175             Difference]: Start difference. First operand has 206 places, 332 transitions, 4995 flow. Second operand 10 states and 180 transitions.
[2024-06-20 19:44:28,765 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 391 transitions, 6580 flow
[2024-06-20 19:44:29,298 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 391 transitions, 6316 flow, removed 65 selfloop flow, removed 7 redundant places.
[2024-06-20 19:44:29,303 INFO  L231             Difference]: Finished difference. Result has 210 places, 340 transitions, 5156 flow
[2024-06-20 19:44:29,303 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4756, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5156, PETRI_PLACES=210, PETRI_TRANSITIONS=340}
[2024-06-20 19:44:29,304 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 169 predicate places.
[2024-06-20 19:44:29,304 INFO  L495      AbstractCegarLoop]: Abstraction has has 210 places, 340 transitions, 5156 flow
[2024-06-20 19:44:29,304 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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:44:29,304 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:44:29,304 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:44:29,304 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-20 19:44:29,304 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:44:29,304 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:44:29,305 INFO  L85        PathProgramCache]: Analyzing trace with hash 617150754, now seen corresponding path program 1 times
[2024-06-20 19:44:29,305 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:44:29,305 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112750632]
[2024-06-20 19:44:29,305 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:44:29,305 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:44:29,336 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:44:35,823 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:44:35,824 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:44:35,824 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112750632]
[2024-06-20 19:44:35,824 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112750632] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:44:35,824 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:44:35,824 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:44:35,824 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19560202]
[2024-06-20 19:44:35,824 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:44:35,824 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:44:35,824 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:44:35,825 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:44:35,825 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:44:36,039 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:44:36,040 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 340 transitions, 5156 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:44:36,040 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:44:36,040 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:44:36,040 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:44:38,333 INFO  L124   PetriNetUnfolderBase]: 4456/6682 cut-off events.
[2024-06-20 19:44:38,333 INFO  L125   PetriNetUnfolderBase]: For 365743/365749 co-relation queries the response was YES.
[2024-06-20 19:44:38,372 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 58159 conditions, 6682 events. 4456/6682 cut-off events. For 365743/365749 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 36307 event pairs, 869 based on Foata normal form. 76/6751 useless extension candidates. Maximal degree in co-relation 58057. Up to 5104 conditions per place. 
[2024-06-20 19:44:38,399 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 247 selfloop transitions, 140 changer transitions 0/390 dead transitions.
[2024-06-20 19:44:38,399 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 390 transitions, 6442 flow
[2024-06-20 19:44:38,399 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:44:38,399 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:44:38,400 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions.
[2024-06-20 19:44:38,400 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4777777777777778
[2024-06-20 19:44:38,400 INFO  L175             Difference]: Start difference. First operand has 210 places, 340 transitions, 5156 flow. Second operand 9 states and 172 transitions.
[2024-06-20 19:44:38,400 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 390 transitions, 6442 flow
[2024-06-20 19:44:38,964 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 390 transitions, 6257 flow, removed 58 selfloop flow, removed 6 redundant places.
[2024-06-20 19:44:38,969 INFO  L231             Difference]: Finished difference. Result has 213 places, 344 transitions, 5404 flow
[2024-06-20 19:44:38,969 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4971, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5404, PETRI_PLACES=213, PETRI_TRANSITIONS=344}
[2024-06-20 19:44:38,970 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 172 predicate places.
[2024-06-20 19:44:38,970 INFO  L495      AbstractCegarLoop]: Abstraction has has 213 places, 344 transitions, 5404 flow
[2024-06-20 19:44:38,970 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:44:38,970 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:44:38,970 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:44:38,970 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-20 19:44:38,971 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:44:38,971 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:44:38,971 INFO  L85        PathProgramCache]: Analyzing trace with hash 1459200726, now seen corresponding path program 4 times
[2024-06-20 19:44:38,971 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:44:38,971 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551163972]
[2024-06-20 19:44:38,971 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:44:38,971 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:44:39,014 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:44:45,754 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:44:45,754 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:44:45,754 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551163972]
[2024-06-20 19:44:45,754 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551163972] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:44:45,754 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:44:45,754 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:44:45,754 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673957920]
[2024-06-20 19:44:45,754 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:44:45,754 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:44:45,754 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:44:45,755 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:44:45,755 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:44:45,939 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:44:45,940 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 344 transitions, 5404 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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:44:45,940 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:44:45,940 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:44:45,940 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:44:48,167 INFO  L124   PetriNetUnfolderBase]: 4541/6817 cut-off events.
[2024-06-20 19:44:48,167 INFO  L125   PetriNetUnfolderBase]: For 340978/340984 co-relation queries the response was YES.
[2024-06-20 19:44:48,332 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 60030 conditions, 6817 events. 4541/6817 cut-off events. For 340978/340984 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 37236 event pairs, 989 based on Foata normal form. 20/6830 useless extension candidates. Maximal degree in co-relation 59926. Up to 5694 conditions per place. 
[2024-06-20 19:44:48,360 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 265 selfloop transitions, 124 changer transitions 0/392 dead transitions.
[2024-06-20 19:44:48,360 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 392 transitions, 6764 flow
[2024-06-20 19:44:48,361 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:44:48,361 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:44:48,361 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions.
[2024-06-20 19:44:48,361 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46944444444444444
[2024-06-20 19:44:48,361 INFO  L175             Difference]: Start difference. First operand has 213 places, 344 transitions, 5404 flow. Second operand 9 states and 169 transitions.
[2024-06-20 19:44:48,361 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 392 transitions, 6764 flow
[2024-06-20 19:44:48,892 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 392 transitions, 6451 flow, removed 28 selfloop flow, removed 7 redundant places.
[2024-06-20 19:44:48,898 INFO  L231             Difference]: Finished difference. Result has 215 places, 347 transitions, 5479 flow
[2024-06-20 19:44:48,898 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5091, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5479, PETRI_PLACES=215, PETRI_TRANSITIONS=347}
[2024-06-20 19:44:48,898 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 174 predicate places.
[2024-06-20 19:44:48,898 INFO  L495      AbstractCegarLoop]: Abstraction has has 215 places, 347 transitions, 5479 flow
[2024-06-20 19:44:48,899 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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:44:48,899 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:44:48,899 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:44:48,899 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-20 19:44:48,899 INFO  L420      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:44:48,900 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:44:48,900 INFO  L85        PathProgramCache]: Analyzing trace with hash -103944094, now seen corresponding path program 5 times
[2024-06-20 19:44:48,900 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:44:48,900 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010549485]
[2024-06-20 19:44:48,900 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:44:48,900 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:44:48,945 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:44:55,110 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:44:55,111 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:44:55,111 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010549485]
[2024-06-20 19:44:55,111 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010549485] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:44:55,111 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:44:55,111 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:44:55,111 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819835439]
[2024-06-20 19:44:55,111 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:44:55,111 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:44:55,111 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:44:55,112 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:44:55,112 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:44:55,280 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:44:55,281 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 347 transitions, 5479 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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:44:55,281 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:44:55,281 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:44:55,281 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:44:57,913 INFO  L124   PetriNetUnfolderBase]: 5235/7899 cut-off events.
[2024-06-20 19:44:57,913 INFO  L125   PetriNetUnfolderBase]: For 465654/465660 co-relation queries the response was YES.
[2024-06-20 19:44:57,964 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 72300 conditions, 7899 events. 5235/7899 cut-off events. For 465654/465660 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 44658 event pairs, 1155 based on Foata normal form. 20/7912 useless extension candidates. Maximal degree in co-relation 72195. Up to 5721 conditions per place. 
[2024-06-20 19:44:57,997 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 280 selfloop transitions, 126 changer transitions 0/409 dead transitions.
[2024-06-20 19:44:57,998 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 409 transitions, 7285 flow
[2024-06-20 19:44:57,998 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:44:57,998 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:44:57,998 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions.
[2024-06-20 19:44:57,999 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4888888888888889
[2024-06-20 19:44:57,999 INFO  L175             Difference]: Start difference. First operand has 215 places, 347 transitions, 5479 flow. Second operand 9 states and 176 transitions.
[2024-06-20 19:44:57,999 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 409 transitions, 7285 flow
[2024-06-20 19:44:58,645 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 409 transitions, 6955 flow, removed 44 selfloop flow, removed 7 redundant places.
[2024-06-20 19:44:58,651 INFO  L231             Difference]: Finished difference. Result has 218 places, 354 transitions, 5691 flow
[2024-06-20 19:44:58,651 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5149, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5691, PETRI_PLACES=218, PETRI_TRANSITIONS=354}
[2024-06-20 19:44:58,651 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 177 predicate places.
[2024-06-20 19:44:58,652 INFO  L495      AbstractCegarLoop]: Abstraction has has 218 places, 354 transitions, 5691 flow
[2024-06-20 19:44:58,652 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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:44:58,652 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:44:58,652 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:44:58,652 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-20 19:44:58,652 INFO  L420      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:44:58,652 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:44:58,653 INFO  L85        PathProgramCache]: Analyzing trace with hash -98433844, now seen corresponding path program 6 times
[2024-06-20 19:44:58,653 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:44:58,653 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070376836]
[2024-06-20 19:44:58,653 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:44:58,653 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:44:58,696 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:45:04,648 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:45:04,648 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:45:04,648 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070376836]
[2024-06-20 19:45:04,648 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070376836] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:45:04,648 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:45:04,648 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:45:04,648 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066114675]
[2024-06-20 19:45:04,648 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:45:04,648 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:45:04,649 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:45:04,649 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:45:04,658 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:45:04,882 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:45:04,882 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 354 transitions, 5691 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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:45:04,882 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:45:04,882 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:45:04,882 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:45:07,569 INFO  L124   PetriNetUnfolderBase]: 5411/8207 cut-off events.
[2024-06-20 19:45:07,569 INFO  L125   PetriNetUnfolderBase]: For 519697/519703 co-relation queries the response was YES.
[2024-06-20 19:45:07,619 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 72965 conditions, 8207 events. 5411/8207 cut-off events. For 519697/519703 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 47012 event pairs, 1251 based on Foata normal form. 94/8294 useless extension candidates. Maximal degree in co-relation 72858. Up to 6578 conditions per place. 
[2024-06-20 19:45:07,651 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 264 selfloop transitions, 136 changer transitions 0/403 dead transitions.
[2024-06-20 19:45:07,651 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 403 transitions, 7035 flow
[2024-06-20 19:45:07,651 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:45:07,652 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:45:07,652 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions.
[2024-06-20 19:45:07,652 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4777777777777778
[2024-06-20 19:45:07,652 INFO  L175             Difference]: Start difference. First operand has 218 places, 354 transitions, 5691 flow. Second operand 9 states and 172 transitions.
[2024-06-20 19:45:07,652 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 403 transitions, 7035 flow
[2024-06-20 19:45:08,352 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 403 transitions, 6689 flow, removed 84 selfloop flow, removed 6 redundant places.
[2024-06-20 19:45:08,357 INFO  L231             Difference]: Finished difference. Result has 221 places, 357 transitions, 5776 flow
[2024-06-20 19:45:08,358 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5371, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5776, PETRI_PLACES=221, PETRI_TRANSITIONS=357}
[2024-06-20 19:45:08,358 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 180 predicate places.
[2024-06-20 19:45:08,358 INFO  L495      AbstractCegarLoop]: Abstraction has has 221 places, 357 transitions, 5776 flow
[2024-06-20 19:45:08,361 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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:45:08,361 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:45:08,361 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:45:08,361 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-20 19:45:08,361 INFO  L420      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:45:08,361 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:45:08,362 INFO  L85        PathProgramCache]: Analyzing trace with hash -98218642, now seen corresponding path program 2 times
[2024-06-20 19:45:08,362 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:45:08,362 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525932693]
[2024-06-20 19:45:08,362 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:45:08,362 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:45:08,393 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:45:14,629 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:45:14,630 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:45:14,630 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525932693]
[2024-06-20 19:45:14,630 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525932693] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:45:14,630 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:45:14,630 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:45:14,630 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224044437]
[2024-06-20 19:45:14,630 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:45:14,632 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:45:14,632 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:45:14,632 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:45:14,632 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:45:14,823 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:45:14,824 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 357 transitions, 5776 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:45:14,824 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:45:14,824 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:45:14,824 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:45:17,763 INFO  L124   PetriNetUnfolderBase]: 5975/9139 cut-off events.
[2024-06-20 19:45:17,763 INFO  L125   PetriNetUnfolderBase]: For 567929/567935 co-relation queries the response was YES.
[2024-06-20 19:45:17,819 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 80108 conditions, 9139 events. 5975/9139 cut-off events. For 567929/567935 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 53997 event pairs, 1288 based on Foata normal form. 74/9206 useless extension candidates. Maximal degree in co-relation 80000. Up to 5335 conditions per place. 
[2024-06-20 19:45:17,855 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 265 selfloop transitions, 149 changer transitions 0/417 dead transitions.
[2024-06-20 19:45:17,855 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 417 transitions, 7506 flow
[2024-06-20 19:45:17,856 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:45:17,856 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:45:17,856 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions.
[2024-06-20 19:45:17,856 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49722222222222223
[2024-06-20 19:45:17,856 INFO  L175             Difference]: Start difference. First operand has 221 places, 357 transitions, 5776 flow. Second operand 9 states and 179 transitions.
[2024-06-20 19:45:17,856 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 417 transitions, 7506 flow
[2024-06-20 19:45:18,734 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 417 transitions, 7181 flow, removed 32 selfloop flow, removed 7 redundant places.
[2024-06-20 19:45:18,739 INFO  L231             Difference]: Finished difference. Result has 223 places, 362 transitions, 5999 flow
[2024-06-20 19:45:18,740 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5451, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5999, PETRI_PLACES=223, PETRI_TRANSITIONS=362}
[2024-06-20 19:45:18,740 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 182 predicate places.
[2024-06-20 19:45:18,740 INFO  L495      AbstractCegarLoop]: Abstraction has has 223 places, 362 transitions, 5999 flow
[2024-06-20 19:45:18,740 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:45:18,740 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:45:18,741 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:45:18,741 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-20 19:45:18,741 INFO  L420      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:45:18,741 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:45:18,741 INFO  L85        PathProgramCache]: Analyzing trace with hash -852511156, now seen corresponding path program 7 times
[2024-06-20 19:45:18,741 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:45:18,741 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348776937]
[2024-06-20 19:45:18,741 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:45:18,741 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:45:18,780 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:45:24,988 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:45:24,988 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:45:24,988 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348776937]
[2024-06-20 19:45:24,989 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348776937] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:45:24,989 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:45:24,989 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:45:24,989 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238181918]
[2024-06-20 19:45:24,989 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:45:24,989 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:45:24,989 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:45:24,989 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:45:24,989 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:45:25,193 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:45:25,193 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 362 transitions, 5999 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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:45:25,193 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:45:25,193 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:45:25,193 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:45:28,276 INFO  L124   PetriNetUnfolderBase]: 6359/9775 cut-off events.
[2024-06-20 19:45:28,276 INFO  L125   PetriNetUnfolderBase]: For 626832/626838 co-relation queries the response was YES.
[2024-06-20 19:45:28,336 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 84831 conditions, 9775 events. 6359/9775 cut-off events. For 626832/626838 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 59656 event pairs, 1863 based on Foata normal form. 94/9862 useless extension candidates. Maximal degree in co-relation 84722. Up to 8493 conditions per place. 
[2024-06-20 19:45:28,373 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 304 selfloop transitions, 103 changer transitions 0/410 dead transitions.
[2024-06-20 19:45:28,373 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 410 transitions, 7249 flow
[2024-06-20 19:45:28,374 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:45:28,374 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:45:28,374 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 184 transitions.
[2024-06-20 19:45:28,374 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46
[2024-06-20 19:45:28,374 INFO  L175             Difference]: Start difference. First operand has 223 places, 362 transitions, 5999 flow. Second operand 10 states and 184 transitions.
[2024-06-20 19:45:28,374 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 410 transitions, 7249 flow
[2024-06-20 19:45:29,230 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 410 transitions, 6988 flow, removed 48 selfloop flow, removed 5 redundant places.
[2024-06-20 19:45:29,236 INFO  L231             Difference]: Finished difference. Result has 228 places, 365 transitions, 6103 flow
[2024-06-20 19:45:29,236 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5738, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6103, PETRI_PLACES=228, PETRI_TRANSITIONS=365}
[2024-06-20 19:45:29,236 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 187 predicate places.
[2024-06-20 19:45:29,236 INFO  L495      AbstractCegarLoop]: Abstraction has has 228 places, 365 transitions, 6103 flow
[2024-06-20 19:45:29,236 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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:45:29,237 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:45:29,237 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:45:29,237 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-20 19:45:29,237 INFO  L420      AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:45:29,237 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:45:29,237 INFO  L85        PathProgramCache]: Analyzing trace with hash -852505204, now seen corresponding path program 3 times
[2024-06-20 19:45:29,238 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:45:29,238 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803982886]
[2024-06-20 19:45:29,238 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:45:29,238 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:45:29,269 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:45:36,275 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:45:36,275 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:45:36,275 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803982886]
[2024-06-20 19:45:36,275 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803982886] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:45:36,275 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:45:36,275 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:45:36,276 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237838508]
[2024-06-20 19:45:36,276 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:45:36,276 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:45:36,276 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:45:36,276 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:45:36,276 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:45:36,410 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:45:36,410 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 365 transitions, 6103 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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:45:36,410 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:45:36,410 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:45:36,410 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:45:39,633 INFO  L124   PetriNetUnfolderBase]: 6718/10362 cut-off events.
[2024-06-20 19:45:39,633 INFO  L125   PetriNetUnfolderBase]: For 639686/639692 co-relation queries the response was YES.
[2024-06-20 19:45:39,713 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 89116 conditions, 10362 events. 6718/10362 cut-off events. For 639686/639692 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 64176 event pairs, 1937 based on Foata normal form. 76/10431 useless extension candidates. Maximal degree in co-relation 89005. Up to 8537 conditions per place. 
[2024-06-20 19:45:39,758 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 310 selfloop transitions, 112 changer transitions 0/425 dead transitions.
[2024-06-20 19:45:39,758 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 425 transitions, 7473 flow
[2024-06-20 19:45:39,759 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-20 19:45:39,759 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-20 19:45:39,760 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 202 transitions.
[2024-06-20 19:45:39,760 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4590909090909091
[2024-06-20 19:45:39,760 INFO  L175             Difference]: Start difference. First operand has 228 places, 365 transitions, 6103 flow. Second operand 11 states and 202 transitions.
[2024-06-20 19:45:39,760 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 425 transitions, 7473 flow
[2024-06-20 19:45:41,005 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 425 transitions, 7168 flow, removed 48 selfloop flow, removed 8 redundant places.
[2024-06-20 19:45:41,010 INFO  L231             Difference]: Finished difference. Result has 231 places, 374 transitions, 6248 flow
[2024-06-20 19:45:41,011 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5812, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6248, PETRI_PLACES=231, PETRI_TRANSITIONS=374}
[2024-06-20 19:45:41,011 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 190 predicate places.
[2024-06-20 19:45:41,011 INFO  L495      AbstractCegarLoop]: Abstraction has has 231 places, 374 transitions, 6248 flow
[2024-06-20 19:45:41,011 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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:45:41,011 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:45:41,012 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:45:41,012 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-20 19:45:41,012 INFO  L420      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:45:41,012 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:45:41,012 INFO  L85        PathProgramCache]: Analyzing trace with hash -852295954, now seen corresponding path program 4 times
[2024-06-20 19:45:41,013 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:45:41,013 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626737431]
[2024-06-20 19:45:41,013 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:45:41,013 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:45:41,042 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:45:47,652 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:45:47,652 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:45:47,652 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626737431]
[2024-06-20 19:45:47,652 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626737431] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:45:47,652 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:45:47,652 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:45:47,652 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247061950]
[2024-06-20 19:45:47,652 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:45:47,653 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:45:47,653 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:45:47,653 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:45:47,653 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:45:47,917 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:45:47,917 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 374 transitions, 6248 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:45:47,917 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:45:47,917 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:45:47,917 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:45:51,323 INFO  L124   PetriNetUnfolderBase]: 7520/11652 cut-off events.
[2024-06-20 19:45:51,324 INFO  L125   PetriNetUnfolderBase]: For 776985/776991 co-relation queries the response was YES.
[2024-06-20 19:45:51,408 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 101885 conditions, 11652 events. 7520/11652 cut-off events. For 776985/776991 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 74122 event pairs, 2095 based on Foata normal form. 74/11719 useless extension candidates. Maximal degree in co-relation 101773. Up to 8381 conditions per place. 
[2024-06-20 19:45:51,458 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 316 selfloop transitions, 114 changer transitions 0/433 dead transitions.
[2024-06-20 19:45:51,458 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 433 transitions, 7946 flow
[2024-06-20 19:45:51,458 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:45:51,459 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:45:51,459 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions.
[2024-06-20 19:45:51,459 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.475
[2024-06-20 19:45:51,459 INFO  L175             Difference]: Start difference. First operand has 231 places, 374 transitions, 6248 flow. Second operand 10 states and 190 transitions.
[2024-06-20 19:45:51,459 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 433 transitions, 7946 flow
[2024-06-20 19:45:52,847 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 433 transitions, 7691 flow, removed 44 selfloop flow, removed 7 redundant places.
[2024-06-20 19:45:52,852 INFO  L231             Difference]: Finished difference. Result has 234 places, 379 transitions, 6498 flow
[2024-06-20 19:45:52,853 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5993, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6498, PETRI_PLACES=234, PETRI_TRANSITIONS=379}
[2024-06-20 19:45:52,853 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 193 predicate places.
[2024-06-20 19:45:52,853 INFO  L495      AbstractCegarLoop]: Abstraction has has 234 places, 379 transitions, 6498 flow
[2024-06-20 19:45:52,853 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:45:52,853 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:45:52,853 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:45:52,853 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-20 19:45:52,853 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:45:52,854 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:45:52,854 INFO  L85        PathProgramCache]: Analyzing trace with hash 848922140, now seen corresponding path program 8 times
[2024-06-20 19:45:52,854 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:45:52,854 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806728094]
[2024-06-20 19:45:52,854 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:45:52,854 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:45:52,897 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:45:59,465 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:45:59,465 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:45:59,465 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806728094]
[2024-06-20 19:45:59,465 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806728094] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:45:59,465 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:45:59,465 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:45:59,465 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86204584]
[2024-06-20 19:45:59,465 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:45:59,465 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:45:59,466 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:45:59,466 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:45:59,466 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:45:59,712 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:45:59,712 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 379 transitions, 6498 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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:45:59,712 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:45:59,712 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:45:59,712 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:46:03,379 INFO  L124   PetriNetUnfolderBase]: 7495/11621 cut-off events.
[2024-06-20 19:46:03,379 INFO  L125   PetriNetUnfolderBase]: For 725362/725368 co-relation queries the response was YES.
[2024-06-20 19:46:03,474 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 101102 conditions, 11621 events. 7495/11621 cut-off events. For 725362/725368 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 73981 event pairs, 2401 based on Foata normal form. 20/11634 useless extension candidates. Maximal degree in co-relation 100989. Up to 10808 conditions per place. 
[2024-06-20 19:46:03,523 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 320 selfloop transitions, 110 changer transitions 0/433 dead transitions.
[2024-06-20 19:46:03,523 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 433 transitions, 7908 flow
[2024-06-20 19:46:03,524 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-20 19:46:03,524 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-20 19:46:03,524 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 201 transitions.
[2024-06-20 19:46:03,524 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45681818181818185
[2024-06-20 19:46:03,524 INFO  L175             Difference]: Start difference. First operand has 234 places, 379 transitions, 6498 flow. Second operand 11 states and 201 transitions.
[2024-06-20 19:46:03,524 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 433 transitions, 7908 flow
[2024-06-20 19:46:04,973 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 433 transitions, 7655 flow, removed 63 selfloop flow, removed 6 redundant places.
[2024-06-20 19:46:04,979 INFO  L231             Difference]: Finished difference. Result has 239 places, 382 transitions, 6635 flow
[2024-06-20 19:46:04,980 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6255, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6635, PETRI_PLACES=239, PETRI_TRANSITIONS=382}
[2024-06-20 19:46:04,980 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 198 predicate places.
[2024-06-20 19:46:04,980 INFO  L495      AbstractCegarLoop]: Abstraction has has 239 places, 382 transitions, 6635 flow
[2024-06-20 19:46:04,980 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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:46:04,980 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:46:04,980 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:46:04,980 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-20 19:46:04,981 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:46:04,981 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:46:04,981 INFO  L85        PathProgramCache]: Analyzing trace with hash -2111597616, now seen corresponding path program 5 times
[2024-06-20 19:46:04,981 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:46:04,981 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675183027]
[2024-06-20 19:46:04,981 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:46:04,981 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:46:05,011 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:46:12,060 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:46:12,060 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:46:12,060 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675183027]
[2024-06-20 19:46:12,060 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675183027] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:46:12,060 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:46:12,060 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:46:12,060 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795889632]
[2024-06-20 19:46:12,060 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:46:12,061 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:46:12,061 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:46:12,061 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:46:12,061 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:46:12,238 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:46:12,238 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 382 transitions, 6635 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:46:12,238 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:46:12,238 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:46:12,238 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:46:15,866 INFO  L124   PetriNetUnfolderBase]: 7639/11861 cut-off events.
[2024-06-20 19:46:15,866 INFO  L125   PetriNetUnfolderBase]: For 765666/765672 co-relation queries the response was YES.
[2024-06-20 19:46:15,991 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 104195 conditions, 11861 events. 7639/11861 cut-off events. For 765666/765672 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 74967 event pairs, 2496 based on Foata normal form. 18/11872 useless extension candidates. Maximal degree in co-relation 104080. Up to 9683 conditions per place. 
[2024-06-20 19:46:16,390 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 327 selfloop transitions, 102 changer transitions 0/432 dead transitions.
[2024-06-20 19:46:16,390 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 432 transitions, 8114 flow
[2024-06-20 19:46:16,392 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:46:16,392 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:46:16,392 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions.
[2024-06-20 19:46:16,393 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4361111111111111
[2024-06-20 19:46:16,393 INFO  L175             Difference]: Start difference. First operand has 239 places, 382 transitions, 6635 flow. Second operand 9 states and 157 transitions.
[2024-06-20 19:46:16,393 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 432 transitions, 8114 flow
[2024-06-20 19:46:18,121 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 432 transitions, 7771 flow, removed 64 selfloop flow, removed 9 redundant places.
[2024-06-20 19:46:18,127 INFO  L231             Difference]: Finished difference. Result has 239 places, 384 transitions, 6645 flow
[2024-06-20 19:46:18,127 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6317, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6645, PETRI_PLACES=239, PETRI_TRANSITIONS=384}
[2024-06-20 19:46:18,128 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 198 predicate places.
[2024-06-20 19:46:18,128 INFO  L495      AbstractCegarLoop]: Abstraction has has 239 places, 384 transitions, 6645 flow
[2024-06-20 19:46:18,128 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:46:18,128 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:46:18,128 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:46:18,128 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-20 19:46:18,128 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:46:18,128 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:46:18,129 INFO  L85        PathProgramCache]: Analyzing trace with hash -2120794386, now seen corresponding path program 6 times
[2024-06-20 19:46:18,129 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:46:18,129 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248799206]
[2024-06-20 19:46:18,129 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:46:18,129 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:46:18,165 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:46:24,764 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:46:24,765 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:46:24,765 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248799206]
[2024-06-20 19:46:24,765 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248799206] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:46:24,765 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:46:24,765 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:46:24,765 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461551951]
[2024-06-20 19:46:24,765 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:46:24,765 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:46:24,765 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:46:24,765 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:46:24,766 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:46:24,903 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:46:24,903 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 384 transitions, 6645 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:46:24,903 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:46:24,903 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:46:24,903 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:46:28,444 INFO  L124   PetriNetUnfolderBase]: 7697/11959 cut-off events.
[2024-06-20 19:46:28,444 INFO  L125   PetriNetUnfolderBase]: For 787846/787852 co-relation queries the response was YES.
[2024-06-20 19:46:28,548 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 104802 conditions, 11959 events. 7697/11959 cut-off events. For 787846/787852 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 76942 event pairs, 2600 based on Foata normal form. 18/11970 useless extension candidates. Maximal degree in co-relation 104686. Up to 10943 conditions per place. 
[2024-06-20 19:46:28,603 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 336 selfloop transitions, 89 changer transitions 0/428 dead transitions.
[2024-06-20 19:46:28,603 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 428 transitions, 7964 flow
[2024-06-20 19:46:28,605 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:46:28,605 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:46:28,605 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions.
[2024-06-20 19:46:28,605 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44166666666666665
[2024-06-20 19:46:28,606 INFO  L175             Difference]: Start difference. First operand has 239 places, 384 transitions, 6645 flow. Second operand 9 states and 159 transitions.
[2024-06-20 19:46:28,606 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 428 transitions, 7964 flow
[2024-06-20 19:46:30,372 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 428 transitions, 7807 flow, removed 31 selfloop flow, removed 5 redundant places.
[2024-06-20 19:46:30,378 INFO  L231             Difference]: Finished difference. Result has 243 places, 385 transitions, 6733 flow
[2024-06-20 19:46:30,378 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6494, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6733, PETRI_PLACES=243, PETRI_TRANSITIONS=385}
[2024-06-20 19:46:30,378 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 202 predicate places.
[2024-06-20 19:46:30,379 INFO  L495      AbstractCegarLoop]: Abstraction has has 243 places, 385 transitions, 6733 flow
[2024-06-20 19:46:30,379 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:46:30,379 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:46:30,379 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:46:30,379 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-20 19:46:30,379 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:46:30,379 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:46:30,379 INFO  L85        PathProgramCache]: Analyzing trace with hash -858021406, now seen corresponding path program 9 times
[2024-06-20 19:46:30,379 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:46:30,379 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831817346]
[2024-06-20 19:46:30,379 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:46:30,380 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:46:30,418 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:46:37,194 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:46:37,194 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:46:37,194 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831817346]
[2024-06-20 19:46:37,194 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831817346] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:46:37,194 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:46:37,194 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:46:37,194 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67520239]
[2024-06-20 19:46:37,194 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:46:37,195 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:46:37,195 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:46:37,195 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:46:37,195 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:46:37,380 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:46:37,380 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 385 transitions, 6733 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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:46:37,380 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:46:37,380 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:46:37,380 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:46:41,856 INFO  L124   PetriNetUnfolderBase]: 8141/12647 cut-off events.
[2024-06-20 19:46:41,856 INFO  L125   PetriNetUnfolderBase]: For 900468/900474 co-relation queries the response was YES.
[2024-06-20 19:46:41,937 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 112930 conditions, 12647 events. 8141/12647 cut-off events. For 900468/900474 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 81831 event pairs, 2503 based on Foata normal form. 20/12660 useless extension candidates. Maximal degree in co-relation 112812. Up to 10489 conditions per place. 
[2024-06-20 19:46:41,985 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 332 selfloop transitions, 116 changer transitions 0/451 dead transitions.
[2024-06-20 19:46:41,985 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 451 transitions, 8507 flow
[2024-06-20 19:46:41,986 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-20 19:46:41,986 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-20 19:46:41,986 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 207 transitions.
[2024-06-20 19:46:41,987 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47045454545454546
[2024-06-20 19:46:41,987 INFO  L175             Difference]: Start difference. First operand has 243 places, 385 transitions, 6733 flow. Second operand 11 states and 207 transitions.
[2024-06-20 19:46:41,987 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 451 transitions, 8507 flow
[2024-06-20 19:46:43,739 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 451 transitions, 8288 flow, removed 24 selfloop flow, removed 7 redundant places.
[2024-06-20 19:46:43,746 INFO  L231             Difference]: Finished difference. Result has 248 places, 392 transitions, 7086 flow
[2024-06-20 19:46:43,746 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6514, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7086, PETRI_PLACES=248, PETRI_TRANSITIONS=392}
[2024-06-20 19:46:43,746 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 207 predicate places.
[2024-06-20 19:46:43,746 INFO  L495      AbstractCegarLoop]: Abstraction has has 248 places, 392 transitions, 7086 flow
[2024-06-20 19:46:43,746 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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:46:43,746 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:46:43,747 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:46:43,747 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-20 19:46:43,747 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:46:43,747 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:46:43,747 INFO  L85        PathProgramCache]: Analyzing trace with hash -857867584, now seen corresponding path program 7 times
[2024-06-20 19:46:43,747 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:46:43,747 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487004933]
[2024-06-20 19:46:43,747 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:46:43,747 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:46:43,779 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:46:50,830 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:46:50,830 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:46:50,830 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487004933]
[2024-06-20 19:46:50,830 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487004933] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:46:50,830 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:46:50,830 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:46:50,830 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308642450]
[2024-06-20 19:46:50,830 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:46:50,830 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:46:50,831 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:46:50,831 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:46:50,831 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:46:51,048 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:46:51,048 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 392 transitions, 7086 flow. Second operand  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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:46:51,048 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:46:51,048 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:46:51,048 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:46:55,249 INFO  L124   PetriNetUnfolderBase]: 8312/12956 cut-off events.
[2024-06-20 19:46:55,249 INFO  L125   PetriNetUnfolderBase]: For 984077/984083 co-relation queries the response was YES.
[2024-06-20 19:46:55,372 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 114939 conditions, 12956 events. 8312/12956 cut-off events. For 984077/984083 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 84568 event pairs, 2761 based on Foata normal form. 76/13025 useless extension candidates. Maximal degree in co-relation 114820. Up to 11637 conditions per place. 
[2024-06-20 19:46:55,430 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 337 selfloop transitions, 113 changer transitions 0/453 dead transitions.
[2024-06-20 19:46:55,430 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 453 transitions, 8558 flow
[2024-06-20 19:46:55,430 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-06-20 19:46:55,430 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-06-20 19:46:55,431 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 221 transitions.
[2024-06-20 19:46:55,431 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46041666666666664
[2024-06-20 19:46:55,431 INFO  L175             Difference]: Start difference. First operand has 248 places, 392 transitions, 7086 flow. Second operand 12 states and 221 transitions.
[2024-06-20 19:46:55,431 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 453 transitions, 8558 flow
[2024-06-20 19:46:57,783 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 453 transitions, 8255 flow, removed 84 selfloop flow, removed 7 redundant places.
[2024-06-20 19:46:57,789 INFO  L231             Difference]: Finished difference. Result has 253 places, 394 transitions, 7144 flow
[2024-06-20 19:46:57,790 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6783, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7144, PETRI_PLACES=253, PETRI_TRANSITIONS=394}
[2024-06-20 19:46:57,790 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 212 predicate places.
[2024-06-20 19:46:57,790 INFO  L495      AbstractCegarLoop]: Abstraction has has 253 places, 394 transitions, 7144 flow
[2024-06-20 19:46:57,790 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 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:46:57,790 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:46:57,790 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:46:57,790 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-20 19:46:57,790 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:46:57,791 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:46:57,791 INFO  L85        PathProgramCache]: Analyzing trace with hash -2120801826, now seen corresponding path program 8 times
[2024-06-20 19:46:57,791 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:46:57,791 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144369458]
[2024-06-20 19:46:57,791 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:46:57,791 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:46:57,822 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:47:04,437 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:47:04,437 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:47:04,438 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144369458]
[2024-06-20 19:47:04,438 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144369458] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:47:04,438 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:47:04,438 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:47:04,438 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082919585]
[2024-06-20 19:47:04,438 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:47:04,438 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:47:04,438 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:47:04,438 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:47:04,439 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:47:04,559 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:47:04,559 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 394 transitions, 7144 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:47:04,559 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:47:04,559 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:47:04,559 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:47:08,902 INFO  L124   PetriNetUnfolderBase]: 8329/12991 cut-off events.
[2024-06-20 19:47:08,902 INFO  L125   PetriNetUnfolderBase]: For 922342/922348 co-relation queries the response was YES.
[2024-06-20 19:47:08,996 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 114477 conditions, 12991 events. 8329/12991 cut-off events. For 922342/922348 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 85443 event pairs, 2963 based on Foata normal form. 26/13010 useless extension candidates. Maximal degree in co-relation 114356. Up to 12299 conditions per place. 
[2024-06-20 19:47:09,047 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 342 selfloop transitions, 88 changer transitions 0/433 dead transitions.
[2024-06-20 19:47:09,047 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 433 transitions, 8250 flow
[2024-06-20 19:47:09,049 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:47:09,049 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:47:09,049 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions.
[2024-06-20 19:47:09,050 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43333333333333335
[2024-06-20 19:47:09,050 INFO  L175             Difference]: Start difference. First operand has 253 places, 394 transitions, 7144 flow. Second operand 9 states and 156 transitions.
[2024-06-20 19:47:09,050 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 433 transitions, 8250 flow
[2024-06-20 19:47:11,464 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 433 transitions, 7883 flow, removed 45 selfloop flow, removed 12 redundant places.
[2024-06-20 19:47:11,470 INFO  L231             Difference]: Finished difference. Result has 250 places, 396 transitions, 7057 flow
[2024-06-20 19:47:11,470 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6777, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7057, PETRI_PLACES=250, PETRI_TRANSITIONS=396}
[2024-06-20 19:47:11,470 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 209 predicate places.
[2024-06-20 19:47:11,470 INFO  L495      AbstractCegarLoop]: Abstraction has has 250 places, 396 transitions, 7057 flow
[2024-06-20 19:47:11,470 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:47:11,470 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:47:11,470 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:47:11,471 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-20 19:47:11,471 INFO  L420      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:47:11,471 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:47:11,471 INFO  L85        PathProgramCache]: Analyzing trace with hash -876532604, now seen corresponding path program 1 times
[2024-06-20 19:47:11,471 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:47:11,471 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670619810]
[2024-06-20 19:47:11,471 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:47:11,471 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:47:11,495 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:47:21,313 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:47:21,313 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:47:21,313 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670619810]
[2024-06-20 19:47:21,313 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670619810] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:47:21,313 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:47:21,313 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:47:21,314 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120536834]
[2024-06-20 19:47:21,314 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:47:21,314 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:47:21,314 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:47:21,314 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:47:21,314 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:47:21,429 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:47:21,429 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 396 transitions, 7057 flow. Second operand  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:47:21,429 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:47:21,429 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:47:21,430 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:47:25,284 INFO  L124   PetriNetUnfolderBase]: 8323/12980 cut-off events.
[2024-06-20 19:47:25,284 INFO  L125   PetriNetUnfolderBase]: For 907180/907192 co-relation queries the response was YES.
[2024-06-20 19:47:25,381 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 113861 conditions, 12980 events. 8323/12980 cut-off events. For 907180/907192 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 85330 event pairs, 3014 based on Foata normal form. 10/12986 useless extension candidates. Maximal degree in co-relation 113740. Up to 12923 conditions per place. 
[2024-06-20 19:47:25,438 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 392 selfloop transitions, 15 changer transitions 0/410 dead transitions.
[2024-06-20 19:47:25,438 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 410 transitions, 7967 flow
[2024-06-20 19:47:25,438 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:47:25,438 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:47:25,439 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions.
[2024-06-20 19:47:25,439 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3875
[2024-06-20 19:47:25,439 INFO  L175             Difference]: Start difference. First operand has 250 places, 396 transitions, 7057 flow. Second operand 6 states and 93 transitions.
[2024-06-20 19:47:25,439 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 410 transitions, 7967 flow
[2024-06-20 19:47:27,823 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 410 transitions, 7741 flow, removed 32 selfloop flow, removed 6 redundant places.
[2024-06-20 19:47:27,829 INFO  L231             Difference]: Finished difference. Result has 250 places, 399 transitions, 6931 flow
[2024-06-20 19:47:27,829 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6831, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6931, PETRI_PLACES=250, PETRI_TRANSITIONS=399}
[2024-06-20 19:47:27,829 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 209 predicate places.
[2024-06-20 19:47:27,829 INFO  L495      AbstractCegarLoop]: Abstraction has has 250 places, 399 transitions, 6931 flow
[2024-06-20 19:47:27,830 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:47:27,830 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:47:27,830 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:47:27,830 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-20 19:47:27,830 INFO  L420      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:47:27,830 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:47:27,830 INFO  L85        PathProgramCache]: Analyzing trace with hash -1054015478, now seen corresponding path program 1 times
[2024-06-20 19:47:27,830 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:47:27,830 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333315997]
[2024-06-20 19:47:27,831 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:47:27,831 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:47:27,865 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:47:35,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 19:47:35,220 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:47:35,220 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333315997]
[2024-06-20 19:47:35,220 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333315997] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:47:35,220 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:47:35,220 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:47:35,220 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055435188]
[2024-06-20 19:47:35,220 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:47:35,220 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:47:35,220 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:47:35,221 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:47:35,221 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:47:35,369 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:47:35,370 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 399 transitions, 6931 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:47:35,370 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:47:35,370 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:47:35,370 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:47:39,086 INFO  L124   PetriNetUnfolderBase]: 8344/13007 cut-off events.
[2024-06-20 19:47:39,086 INFO  L125   PetriNetUnfolderBase]: For 931874/931874 co-relation queries the response was YES.
[2024-06-20 19:47:39,205 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 114635 conditions, 13007 events. 8344/13007 cut-off events. For 931874/931874 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 85479 event pairs, 3120 based on Foata normal form. 1/13006 useless extension candidates. Maximal degree in co-relation 114512. Up to 12885 conditions per place. 
[2024-06-20 19:47:39,264 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 404 selfloop transitions, 37 changer transitions 0/444 dead transitions.
[2024-06-20 19:47:39,265 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 444 transitions, 8673 flow
[2024-06-20 19:47:39,265 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:47:39,265 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:47:39,265 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions.
[2024-06-20 19:47:39,266 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41785714285714287
[2024-06-20 19:47:39,266 INFO  L175             Difference]: Start difference. First operand has 250 places, 399 transitions, 6931 flow. Second operand 7 states and 117 transitions.
[2024-06-20 19:47:39,266 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 444 transitions, 8673 flow
[2024-06-20 19:47:41,572 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 444 transitions, 8573 flow, removed 33 selfloop flow, removed 4 redundant places.
[2024-06-20 19:47:41,578 INFO  L231             Difference]: Finished difference. Result has 256 places, 421 transitions, 7540 flow
[2024-06-20 19:47:41,578 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6839, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7540, PETRI_PLACES=256, PETRI_TRANSITIONS=421}
[2024-06-20 19:47:41,578 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 215 predicate places.
[2024-06-20 19:47:41,579 INFO  L495      AbstractCegarLoop]: Abstraction has has 256 places, 421 transitions, 7540 flow
[2024-06-20 19:47:41,579 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:47:41,579 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:47:41,579 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:47:41,579 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-20 19:47:41,579 INFO  L420      AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:47:41,579 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:47:41,579 INFO  L85        PathProgramCache]: Analyzing trace with hash -1053895322, now seen corresponding path program 1 times
[2024-06-20 19:47:41,579 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:47:41,580 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821364806]
[2024-06-20 19:47:41,580 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:47:41,580 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:47:41,611 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:47:48,941 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:47:48,941 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:47:48,941 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821364806]
[2024-06-20 19:47:48,941 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821364806] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:47:48,941 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:47:48,941 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:47:48,941 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197071549]
[2024-06-20 19:47:48,941 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:47:48,942 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:47:48,942 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:47:48,942 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:47:48,942 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:47:49,076 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:47:49,076 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 421 transitions, 7540 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:47:49,076 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:47:49,076 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:47:49,076 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:47:53,038 INFO  L124   PetriNetUnfolderBase]: 8440/13144 cut-off events.
[2024-06-20 19:47:53,039 INFO  L125   PetriNetUnfolderBase]: For 987622/987634 co-relation queries the response was YES.
[2024-06-20 19:47:53,147 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 117674 conditions, 13144 events. 8440/13144 cut-off events. For 987622/987634 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 86315 event pairs, 3148 based on Foata normal form. 20/13160 useless extension candidates. Maximal degree in co-relation 117547. Up to 12979 conditions per place. 
[2024-06-20 19:47:53,201 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 403 selfloop transitions, 55 changer transitions 0/461 dead transitions.
[2024-06-20 19:47:53,201 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 461 transitions, 9131 flow
[2024-06-20 19:47:53,201 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:47:53,201 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:47:53,202 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions.
[2024-06-20 19:47:53,202 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.390625
[2024-06-20 19:47:53,202 INFO  L175             Difference]: Start difference. First operand has 256 places, 421 transitions, 7540 flow. Second operand 8 states and 125 transitions.
[2024-06-20 19:47:53,202 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 461 transitions, 9131 flow
[2024-06-20 19:47:55,405 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 461 transitions, 8955 flow, removed 87 selfloop flow, removed 1 redundant places.
[2024-06-20 19:47:55,411 INFO  L231             Difference]: Finished difference. Result has 264 places, 444 transitions, 8058 flow
[2024-06-20 19:47:55,411 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7372, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8058, PETRI_PLACES=264, PETRI_TRANSITIONS=444}
[2024-06-20 19:47:55,412 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 223 predicate places.
[2024-06-20 19:47:55,412 INFO  L495      AbstractCegarLoop]: Abstraction has has 264 places, 444 transitions, 8058 flow
[2024-06-20 19:47:55,412 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:47:55,412 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:47:55,412 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:47:55,412 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-20 19:47:55,413 INFO  L420      AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:47:55,413 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:47:55,413 INFO  L85        PathProgramCache]: Analyzing trace with hash -1053895508, now seen corresponding path program 2 times
[2024-06-20 19:47:55,413 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:47:55,413 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211624947]
[2024-06-20 19:47:55,413 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:47:55,413 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:47:55,446 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:48:03,117 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:48:03,117 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:48:03,117 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211624947]
[2024-06-20 19:48:03,117 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211624947] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:48:03,117 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:48:03,117 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:48:03,117 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770100216]
[2024-06-20 19:48:03,117 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:48:03,117 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:48:03,118 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:48:03,118 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:48:03,118 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:48:03,330 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:48:03,331 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 444 transitions, 8058 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:48:03,331 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:48:03,331 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:48:03,331 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:48:07,248 INFO  L124   PetriNetUnfolderBase]: 8414/13108 cut-off events.
[2024-06-20 19:48:07,248 INFO  L125   PetriNetUnfolderBase]: For 1007255/1007267 co-relation queries the response was YES.
[2024-06-20 19:48:07,375 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 118328 conditions, 13108 events. 8414/13108 cut-off events. For 1007255/1007267 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 86152 event pairs, 3148 based on Foata normal form. 14/13118 useless extension candidates. Maximal degree in co-relation 118197. Up to 12955 conditions per place. 
[2024-06-20 19:48:07,440 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 402 selfloop transitions, 55 changer transitions 0/460 dead transitions.
[2024-06-20 19:48:07,440 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 460 transitions, 9022 flow
[2024-06-20 19:48:07,440 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:48:07,440 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:48:07,441 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions.
[2024-06-20 19:48:07,441 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3875
[2024-06-20 19:48:07,441 INFO  L175             Difference]: Start difference. First operand has 264 places, 444 transitions, 8058 flow. Second operand 8 states and 124 transitions.
[2024-06-20 19:48:07,441 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 460 transitions, 9022 flow
[2024-06-20 19:48:10,538 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 460 transitions, 8588 flow, removed 212 selfloop flow, removed 2 redundant places.
[2024-06-20 19:48:10,544 INFO  L231             Difference]: Finished difference. Result has 270 places, 444 transitions, 7754 flow
[2024-06-20 19:48:10,544 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7624, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7754, PETRI_PLACES=270, PETRI_TRANSITIONS=444}
[2024-06-20 19:48:10,545 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 229 predicate places.
[2024-06-20 19:48:10,545 INFO  L495      AbstractCegarLoop]: Abstraction has has 270 places, 444 transitions, 7754 flow
[2024-06-20 19:48:10,545 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:48:10,545 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:48:10,545 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:48:10,545 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-20 19:48:10,545 INFO  L420      AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:48:10,545 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:48:10,545 INFO  L85        PathProgramCache]: Analyzing trace with hash -1380579806, now seen corresponding path program 2 times
[2024-06-20 19:48:10,546 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:48:10,546 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504845824]
[2024-06-20 19:48:10,546 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:48:10,546 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:48:10,578 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:48:17,751 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:48:17,752 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:48:17,752 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504845824]
[2024-06-20 19:48:17,752 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504845824] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:48:17,752 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:48:17,752 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:48:17,752 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186119950]
[2024-06-20 19:48:17,752 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:48:17,752 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:48:17,752 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:48:17,753 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:48:17,753 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:48:17,815 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:48:17,815 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 444 transitions, 7754 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:48:17,815 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:48:17,815 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:48:17,815 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:48:22,338 INFO  L124   PetriNetUnfolderBase]: 8434/13136 cut-off events.
[2024-06-20 19:48:22,338 INFO  L125   PetriNetUnfolderBase]: For 1027548/1027560 co-relation queries the response was YES.
[2024-06-20 19:48:22,441 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 118460 conditions, 13136 events. 8434/13136 cut-off events. For 1027548/1027560 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 86162 event pairs, 3027 based on Foata normal form. 12/13144 useless extension candidates. Maximal degree in co-relation 118327. Up to 13081 conditions per place. 
[2024-06-20 19:48:22,492 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 442 selfloop transitions, 20 changer transitions 0/465 dead transitions.
[2024-06-20 19:48:22,492 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 465 transitions, 8895 flow
[2024-06-20 19:48:22,493 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:48:22,493 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:48:22,493 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions.
[2024-06-20 19:48:22,493 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3875
[2024-06-20 19:48:22,493 INFO  L175             Difference]: Start difference. First operand has 270 places, 444 transitions, 7754 flow. Second operand 6 states and 93 transitions.
[2024-06-20 19:48:22,493 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 465 transitions, 8895 flow
[2024-06-20 19:48:24,546 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 465 transitions, 8785 flow, removed 0 selfloop flow, removed 7 redundant places.
[2024-06-20 19:48:24,553 INFO  L231             Difference]: Finished difference. Result has 270 places, 455 transitions, 7909 flow
[2024-06-20 19:48:24,553 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7644, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7909, PETRI_PLACES=270, PETRI_TRANSITIONS=455}
[2024-06-20 19:48:24,553 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 229 predicate places.
[2024-06-20 19:48:24,553 INFO  L495      AbstractCegarLoop]: Abstraction has has 270 places, 455 transitions, 7909 flow
[2024-06-20 19:48:24,554 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:48:24,554 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:48:24,554 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:48:24,554 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-20 19:48:24,554 INFO  L420      AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:48:24,554 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:48:24,554 INFO  L85        PathProgramCache]: Analyzing trace with hash -1380816956, now seen corresponding path program 3 times
[2024-06-20 19:48:24,554 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:48:24,554 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53324385]
[2024-06-20 19:48:24,554 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:48:24,554 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:48:24,585 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:48:31,530 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:48:31,530 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:48:31,530 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53324385]
[2024-06-20 19:48:31,530 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53324385] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:48:31,530 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:48:31,530 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:48:31,531 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144646969]
[2024-06-20 19:48:31,531 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:48:31,531 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:48:31,531 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:48:31,531 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:48:31,531 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:48:31,660 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:48:31,660 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 455 transitions, 7909 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:48:31,660 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:48:31,660 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:48:31,660 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:48:35,506 INFO  L124   PetriNetUnfolderBase]: 8388/13060 cut-off events.
[2024-06-20 19:48:35,506 INFO  L125   PetriNetUnfolderBase]: For 1055461/1055473 co-relation queries the response was YES.
[2024-06-20 19:48:35,630 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 118900 conditions, 13060 events. 8388/13060 cut-off events. For 1055461/1055473 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 85573 event pairs, 3019 based on Foata normal form. 16/13072 useless extension candidates. Maximal degree in co-relation 118765. Up to 12909 conditions per place. 
[2024-06-20 19:48:35,688 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 432 selfloop transitions, 47 changer transitions 0/482 dead transitions.
[2024-06-20 19:48:35,688 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 482 transitions, 9134 flow
[2024-06-20 19:48:35,688 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:48:35,688 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:48:35,689 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions.
[2024-06-20 19:48:35,689 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4035714285714286
[2024-06-20 19:48:35,689 INFO  L175             Difference]: Start difference. First operand has 270 places, 455 transitions, 7909 flow. Second operand 7 states and 113 transitions.
[2024-06-20 19:48:35,689 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 482 transitions, 9134 flow
[2024-06-20 19:48:38,604 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 482 transitions, 9084 flow, removed 12 selfloop flow, removed 3 redundant places.
[2024-06-20 19:48:38,610 INFO  L231             Difference]: Finished difference. Result has 275 places, 467 transitions, 8238 flow
[2024-06-20 19:48:38,611 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7859, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=455, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8238, PETRI_PLACES=275, PETRI_TRANSITIONS=467}
[2024-06-20 19:48:38,611 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 234 predicate places.
[2024-06-20 19:48:38,611 INFO  L495      AbstractCegarLoop]: Abstraction has has 275 places, 467 transitions, 8238 flow
[2024-06-20 19:48:38,611 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:48:38,611 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:48:38,611 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:48:38,611 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-20 19:48:38,611 INFO  L420      AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:48:38,612 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:48:38,612 INFO  L85        PathProgramCache]: Analyzing trace with hash -1380570878, now seen corresponding path program 1 times
[2024-06-20 19:48:38,612 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:48:38,612 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888803671]
[2024-06-20 19:48:38,612 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:48:38,612 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:48:38,644 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:48:47,686 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:48:47,687 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:48:47,687 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888803671]
[2024-06-20 19:48:47,687 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888803671] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:48:47,687 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:48:47,687 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:48:47,687 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448711143]
[2024-06-20 19:48:47,687 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:48:47,687 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:48:47,687 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:48:47,687 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:48:47,688 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:48:47,799 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:48:47,799 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 467 transitions, 8238 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:48:47,799 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:48:47,799 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:48:47,799 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:48:51,944 INFO  L124   PetriNetUnfolderBase]: 8391/13065 cut-off events.
[2024-06-20 19:48:51,944 INFO  L125   PetriNetUnfolderBase]: For 1083379/1083391 co-relation queries the response was YES.
[2024-06-20 19:48:52,302 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 119615 conditions, 13065 events. 8391/13065 cut-off events. For 1083379/1083391 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 84870 event pairs, 3024 based on Foata normal form. 12/13073 useless extension candidates. Maximal degree in co-relation 119478. Up to 13004 conditions per place. 
[2024-06-20 19:48:52,359 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 455 selfloop transitions, 22 changer transitions 0/480 dead transitions.
[2024-06-20 19:48:52,359 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 480 transitions, 9284 flow
[2024-06-20 19:48:52,360 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:48:52,360 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:48:52,360 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions.
[2024-06-20 19:48:52,360 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3875
[2024-06-20 19:48:52,360 INFO  L175             Difference]: Start difference. First operand has 275 places, 467 transitions, 8238 flow. Second operand 6 states and 93 transitions.
[2024-06-20 19:48:52,360 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 480 transitions, 9284 flow
[2024-06-20 19:48:54,976 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 480 transitions, 9206 flow, removed 17 selfloop flow, removed 3 redundant places.
[2024-06-20 19:48:54,983 INFO  L231             Difference]: Finished difference. Result has 278 places, 470 transitions, 8285 flow
[2024-06-20 19:48:54,983 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8160, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=467, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8285, PETRI_PLACES=278, PETRI_TRANSITIONS=470}
[2024-06-20 19:48:54,984 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 237 predicate places.
[2024-06-20 19:48:54,984 INFO  L495      AbstractCegarLoop]: Abstraction has has 278 places, 470 transitions, 8285 flow
[2024-06-20 19:48:54,984 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:48:54,984 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:48:54,984 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:48:54,984 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-20 19:48:54,984 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 19:48:54,984 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:48:54,984 INFO  L85        PathProgramCache]: Analyzing trace with hash -798501163, now seen corresponding path program 1 times
[2024-06-20 19:48:54,984 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:48:54,984 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148197343]
[2024-06-20 19:48:54,985 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:48:54,985 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:48:55,029 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:49:01,780 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:49:01,780 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:49:01,780 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148197343]
[2024-06-20 19:49:01,780 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148197343] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:49:01,780 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:49:01,780 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:49:01,780 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591880943]
[2024-06-20 19:49:01,780 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:49:01,780 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:49:01,781 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:49:01,781 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:49:01,781 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:49:02,114 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-20 19:49:02,115 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 470 transitions, 8285 flow. Second operand  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:49:02,115 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:49:02,115 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-20 19:49:02,115 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:49:07,078 INFO  L124   PetriNetUnfolderBase]: 8879/13856 cut-off events.
[2024-06-20 19:49:07,078 INFO  L125   PetriNetUnfolderBase]: For 1302876/1302882 co-relation queries the response was YES.
[2024-06-20 19:49:07,228 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 128733 conditions, 13856 events. 8879/13856 cut-off events. For 1302876/1302882 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 91052 event pairs, 2818 based on Foata normal form. 68/13917 useless extension candidates. Maximal degree in co-relation 128595. Up to 12486 conditions per place. 
[2024-06-20 19:49:07,289 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 482 selfloop transitions, 52 changer transitions 0/537 dead transitions.
[2024-06-20 19:49:07,290 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 537 transitions, 10583 flow
[2024-06-20 19:49:07,290 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:49:07,290 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:49:07,290 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 180 transitions.
[2024-06-20 19:49:07,291 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5
[2024-06-20 19:49:07,291 INFO  L175             Difference]: Start difference. First operand has 278 places, 470 transitions, 8285 flow. Second operand 9 states and 180 transitions.
[2024-06-20 19:49:07,291 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 537 transitions, 10583 flow
[2024-06-20 19:49:10,434 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 537 transitions, 10482 flow, removed 31 selfloop flow, removed 4 redundant places.
[2024-06-20 19:49:10,441 INFO  L231             Difference]: Finished difference. Result has 286 places, 479 transitions, 8672 flow
[2024-06-20 19:49:10,442 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8184, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8672, PETRI_PLACES=286, PETRI_TRANSITIONS=479}
[2024-06-20 19:49:10,442 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 245 predicate places.
[2024-06-20 19:49:10,443 INFO  L495      AbstractCegarLoop]: Abstraction has has 286 places, 479 transitions, 8672 flow
[2024-06-20 19:49:10,443 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:49:10,443 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:49:10,443 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:49:10,443 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2024-06-20 19:49:10,443 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 19:49:10,444 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:49:10,444 INFO  L85        PathProgramCache]: Analyzing trace with hash -830488937, now seen corresponding path program 2 times
[2024-06-20 19:49:10,444 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:49:10,444 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487331912]
[2024-06-20 19:49:10,444 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:49:10,444 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms